Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions

DOI10.1137/S1064827596303661zbMath0912.65021MaRDI QIDQ4389226

V. L. Druskin, L. A. Knizhnerman, Anne Greenbaum

Publication date: 12 May 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

error boundsLanczos algorithmmatrix exponentialKrylov subspacefinite precision arithmetic

Mathematics Subject Classification ID

Related Items (34)

Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds ⋮ A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions ⋮ A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators ⋮ Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources ⋮ A block Krylov subspace time-exact solution method for linear ordinary differential equation systems ⋮ On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ Unnamed Item ⋮ Error Bounds for the Krylov Subspace Methods for Computations of Matrix Exponentials ⋮ The Short-Term Rational Lanczos Method and Applications ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation ⋮ Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential ⋮ Krylov Subspace Restarting for Matrix Laplace Transforms ⋮ On the stability of some algorithms for computing the action of the matrix exponential ⋮ \textit{TimeEvolver}: a program for time evolution with improved error bound ⋮ Exponential time differencing for mimetic multilayer Ocean models ⋮ On monotonicity of the Lanczos approximation to the matrix exponential ⋮ On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic ⋮ Residual and Restarting in Krylov Subspace Evaluation of the $\varphi$ Function ⋮ THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES ⋮ An interpolatory approximation of the matrix exponential based on Faber polynomials ⋮ Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation ⋮ An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential ⋮ ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations ⋮ An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices ⋮ Approximation of matrix operators applied to multiple vectors ⋮ Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions ⋮ Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling ⋮ A new investigation of the extended Krylov subspace method for matrix function evaluations ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation ⋮ Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes ⋮ A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices

This page was built for publication: Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions