A posteriori error estimates of Krylov subspace approximations to matrix functions
From MaRDI portal
Publication:2346271
DOI10.1007/s11075-014-9878-0zbMath1331.65069arXiv1307.7219OpenAlexW3105157329MaRDI QIDQ2346271
Publication date: 1 June 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.7219
numerical examplesHermitian matriceserror boundsa posteriori error estimatesKrylov subspace methodmatrix functionsmatrix exponentialerror expansionmatrix cosinematrix sineKrylov-like approximation
Iterative numerical methods for linear systems (65F10) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items
A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions, AN ESTIMATE OF APPROXIMATION OF A MATRIX-VALUED FUNCTION BY AN INTERPOLATION POLYNOMIAL, APPROXIMATION OF THE LINEAR COMBINATION OF <i>φ</i>-FUNCTIONS USING THE BLOCK SHIFT-AND-INVERT KRYLOV SUBSPACE METHOD, \textit{TimeEvolver}: a program for time evolution with improved error bound, Frequency-Limited Balanced Truncation with Low-Rank Approximations, Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions, Error Bounds for Lanczos-Based Matrix Function Approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of the steepest descent method for matrix functions
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- 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
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
- Error estimates for Krylov subspace approximations of matrix exponentials
- A Krylov--Schur Algorithm for Large Eigenproblems
- Residual, Restarting, and Richardson Iteration for the Matrix Exponential
- A restarted Lanczos approximation to functions of a symmetric matrix
- Deflated Restarting for Matrix Functions
- On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
- Interpolating functions of matrices on zeros of quasi-kernel polynomials
- Error Estimates for Polynomial Krylov Approximations to Matrix Functions
- Spectral Methods in Time for Parabolic Problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- On Logarithmic Norms
- Expokit
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Exponential Integrators for Large Systems of Differential Equations
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- GMRES with Deflated Restarting
- A Restarted GMRES Method Augmented with Eigenvectors
- Error Bounds for the Lanczos Methods for Approximating Matrix Exponentials
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Functions of Matrices
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
- Two polynomial methods of calculating functions of symmetric matrices
- An interpolatory approximation of the matrix exponential based on Faber polynomials
