Numerical Stability of Lanczos Methods

Physics – High Energy Physics – High Energy Physics - Lattice

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3 pages, Lattice 99 contribution

Scientific paper

The Lanczos algorithm for matrix tridiagonalisation suffers from strong numerical instability in finite precision arithmetic when applied to evaluate matrix eigenvalues. The mechanism by which this instability arises is well documented in the literature. A recent application of the Lanczos algorithm proposed by Bai, Fahey and Golub allows quadrature evaluation of inner products of the form $\psi^\dagger g(A) \psi$. We show that this quadrature evaluation is numerically stable and explain how the numerical errors which are such a fundamental element of the finite precision Lanczos tridiagonalisation procedure are automatically and exactly compensated in the Bai, Fahey and Golub algorithm. In the process, we shed new light on the mechanism by which roundoff error corrupts the Lanczos procedure

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Numerical Stability of Lanczos Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Numerical Stability of Lanczos Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical Stability of Lanczos Methods will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-377292

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.