paper

Optimal near-optimality bounds for the Lanczos method for matrix functions

arXiv:2608.07160

Abstract

Let be Hermitian positive definite and let denote the Lanczos approximation to . We prove that if or is Stieltjes, then the -norm error of the Lanczos approximation is within a factor of the the best possible Krylov Subspace Method, where is the condition number of and . Our result strengthens and generalizes the upper bound of [Schweitzer; SIMAX, 46.3 (2025)]. Moreover, we prove that the constant is optimal.

Optimal near-optimality bounds for the Lanczos method for matrix functions · wovepaper