A posteriori error estimates of Krylov subspace approximations to matrix functions
From MaRDI portal
Publication:2346271
Abstract: Krylov subspace methods for approximating a matrix function times a vector are analyzed in this paper. For the Arnoldi approximation to , two reliable a posteriori error estimates are derived from the new bounds and generalized error expansion we establish. One of them is similar to the residual norm of an approximate solution of the linear system, and the other one is determined critically by the first term of the error expansion of the Arnoldi approximation to due to Saad. We prove that each of the two estimates is reliable to measure the true error norm, and the second one theoretically justifies an empirical claim by Saad. In the paper, by introducing certain functions defined recursively by the given function for certain nodes, we obtain the error expansion of the Krylov-like approximation for sufficiently smooth, which generalizes Saad's result on the Arnoldi approximation to . Similarly, it is shown that the first term of the generalized error expansion can be used as a reliable a posteriori estimate for the Krylov-like approximation to some other matrix functions times . Numerical examples are reported to demonstrate the effectiveness of the a posteriori error estimates for the Krylov-like approximations to , and .
Recommendations
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Error estimates for Krylov subspace approximations of matrix exponentials
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- A moment-matching Arnoldi iteration for linear combinations of \(\phi\) functions
- Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
- Krylov subspace approximations for the exponential Euler method: error estimates and the harmonic Ritz approximant
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- RD-rational approximations of the matrix exponential
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices
- Residual, restarting, and Richardson iteration for the matrix exponential
Cites work
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 956801 (Why is no real title available?)
- A Krylov--Schur algorithm for large eigenproblems
- A Restarted GMRES Method Augmented with Eigenvectors
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- A generalization of the steepest descent method for matrix functions
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
- A restarted Lanczos approximation to functions of a symmetric matrix
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Deflated restarting for matrix functions
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- Error Estimates for Polynomial Krylov Approximations to Matrix Functions
- Error bounds for the Lanczos methods for approximating matrix exponentials
- Error estimates for Krylov subspace approximations of matrix exponentials
- Expokit
- Exponential Integrators for Large Systems of Differential Equations
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Functions of Matrices
- GMRES with Deflated Restarting
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Interpolating functions of matrices on zeros of quasi-kernel polynomials
- Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On Logarithmic Norms
- On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Residual, restarting, and Richardson iteration for the matrix exponential
- Spectral Methods in Time for Parabolic Problems
- Two polynomial methods of calculating functions of symmetric matrices
Cited in
(15)- Approximation of the linear combination of \(\varphi \)-functions using the block shift-and-invert Krylov subspace method
- A posteriorierror estimators for linear reduced-order models using Krylov-based integrators
- Krylov subspace approximations for the exponential Euler method: error estimates and the harmonic Ritz approximant
- Error Bounds for Lanczos-Based Matrix Function Approximation
- An estimate of approximation of a matrix-valued function by an interpolation polynomial
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Error estimates for Krylov subspace approximations of matrix exponentials
- The Surrogate Matrix Methodology: A Priori Error Estimation
- Frequency-limited balanced truncation with low-rank approximations
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- The error analysis of the Krylov subspace methods for computing the bilinear form of matrix functions
- \textit{TimeEvolver}: a program for time evolution with improved error bound
- Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- Error Estimates for Polynomial Krylov Approximations to Matrix Functions
This page was built for publication: A posteriori error estimates of Krylov subspace approximations to matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346271)