We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing f(\bfA)\bfb when \bfA is a Hermitian matrix and \bfb is a given vector. Assuming that f : \BbbC \rightarrow \BbbC is piecewise analytic, we give a framework, based on the Cauchy integral formula, which can be used to derive a priori and a posteriori error bounds for Lanczos-FA in terms of the error of Lanczos used to solve linear systems. Unlike many error bounds for Lanczos-FA, these bounds account for fine-grained properties of the spectrum of \bfA, such as clustered or isolated eigenvalues. Our results are derived assuming exact arithmetic, but we show that they are easily extended to finite precision computations using existing theory about the Lanczos algorithm in finite precision. We also provide generalized bounds for the Lanczos method used to approximate quadratic forms \bfb Hf(\bfA)\bfb and demonstrate the effectiveness of our bounds with numerical experiments.
- Krylov subspace method
- matrix function approximation
ASJC Scopus subject areas