Log In Sign Up

Error bounds for Lanczos-based matrix function approximation

by   Tyler Chen, et al.

We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing f(𝐀) 𝐛 when 𝐀 is a Hermitian matrix and 𝐛 is a given mathbftor. Assuming that f : ℂ→ℂ 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 𝐀, 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 𝐛^ f(𝐀) 𝐛, and demonstrate the effectiveness of our bounds with numerical experiments.

∙ 11/28/2022

A posteriori error bounds for the block-Lanczos method for matrix function approximation

We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (20...
∙ 01/31/2020

A study of defect-based error estimates for the Krylov approximation of φ-functions

Prior recent work, devoted to the study of polynomial Krylov techniques ...
∙ 05/13/2021

Analysis of stochastic Lanczos quadrature for spectrum approximation

The cumulative empirical spectral measure (CESM) Φ[𝐀] : ℝ→ [0,1] of a n×...
∙ 07/17/2018

Minimizing convex quadratic with variable precision Krylov methods

Iterative algorithms for the solution of convex quadratic optimization p...
∙ 07/02/2016

Approximate Joint Matrix Triangularization

We consider the problem of approximate joint triangularization of a set ...
∙ 12/09/2022

A general framework for the rigorous computation of invariant densities and the coarse-fine strategy

In this paper we present a general, axiomatical framework for the rigoro...
∙ 05/17/2019

Randomization of Approximate Bilinear Computation for Matrix Multiplication

We present a method for randomizing a formula for bilinear computation o...