Near-Optimality Guarantees for Approximating Rational Matrix Functions by the Lanczos Method
share
We study the Lanczos method for approximating the action of a symmetric matrix function f(𝐀) on a vector 𝐛 (Lanczos-FA). For the function 𝐀^-1, it is known that the error of Lanczos-FA after k iterations matches the error of the best approximation from the Krylov subspace of degree k when A⃗ is positive definite. We prove that the same holds, up to a multiplicative approximation factor, when f is a rational function with no poles in the interval containing 𝐀's eigenvalues. The approximation factor depends the degree of f's denominator and the condition number of 𝐀, but not on the number of iterations k. Experiments confirm that our bound accurately predicts the convergence of Lanczos-FA. Moreover, we believe that our result provides strong theoretical justification for the excellent practical performance that has long by observed of the Lanczos method, both for approximating rational functions and functions like 𝐀^-1/2𝐛 that are well approximated by rationals.
READ FULL TEXT
