Numerical Stability of Lanczos Methods
arXiv:hep-lat/9909131 · doi:10.1016/S0920-5632(00)91816-4
Abstract
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 . 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
arXiv comment3 pages, Lattice 99 contribution
References in corpus (1)
Cited by in corpus (5)
- Lanczos recursion on a quantum computer for the Green's function and ground state
- Computational Methods for UV-Suppressed Fermions
- Lattice QCD with Suppressed High Momentum Modes of the Dirac Operator
- Low Rank Saddle Free Newton: A Scalable Method for Stochastic Nonconvex Optimization
- Block Lanczos method for excited states on a quantum computer