Papers › Stability of the Lanczos Method for Matrix Function Approximation
Stability of the Lanczos Method for Matrix Function Approximation
Cameron Musco, Christopher Musco, Aaron Sidford
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The ubiquitous Lanczos method can approximate f(A)x for any symmetric n ×n matrix A, vector x, and function f. In exact arithmetic, the method's error after k iterations is bounded by the error of the best degree-k polynomial uniformly approximating f(x) on the range [λₘᵢₙ(A), λₘₐₓ(A)]. However, despite decades of work, it has been unclear if this powerful guarantee holds in finite precision. We resolve this problem, proving that when max_(x ∈[λₘᵢₙ, λₘₐₓ])|f(x)| ≤C, Lanczos essentially matches the exact arithmetic guarantee if computations use roughly log(nCA) bits of precision. Our proof extends work of Druskin and Knizhnerman [DK91], leveraging the stability of the classic Chebyshev recurrence to bound the stability of any polynomial approximating f(x). We also study the special case of f(A) = A⁻¹, where stronger guarantees hold. In exact arithmetic Lanczos performs as well as the best polynomial approximating 1/x at each of A's eigenvalues, rather than on the full eigenvalue range. In seminal work, Greenbaum gives an approach to extending this bound to finite precision: she proves that finite precision Lanczos and the related CG method match any polynomial approximating 1/x in a tiny range around each eigenvalue [Gre89]. For A⁻¹, this bound appears stronger than ours. However, we exhibit matrices with condition number κ where exact arithmetic Lanczos converges in polylog(κ) iterations, but Greenbaum's bound predicts Ω(κ^(1/5)) iterations. It thus cannot offer significant improvement over the O(κ^(1/2)) bound achievable via our result. Our analysis raises the question of if convergence in less than poly(κ) iterations can be expected in finite precision, even for matrices with clustered, skewed, or otherwise favorable eigenvalue distributions.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections