Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
From MaRDI portal
Recommendations
- When does the Lanczos algorithm compute exactly?
- Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
- Stability of the Lanczos method for matrix function approximation
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalue problems
Cited in
(44)- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- Residual and restarting in Krylov subspace evaluation of the function
- Optimal near-optimality bounds for the Lanczos method for matrix functions
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Exponential time differencing for mimetic multilayer Ocean models
- Error Bounds for Lanczos-Based Matrix Function Approximation
- A block Krylov subspace time-exact solution method for linear ordinary differential equation systems.
- Stability of the Lanczos method for matrix function approximation
- Krylov Subspace Restarting for Matrix Laplace Transforms
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- Monotonicity, bounds and acceleration of block Gauss and Gauss-Radau quadrature for computing B^T (A)B
- 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 black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes
- On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation
- Near-optimal convergence of the full orthogonalization method
- Approximation of matrix operators applied to multiple vectors
- On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
- An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices
- Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
- Limited‐memory polynomial methods for large‐scale matrix functions
- Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling
- When does the Lanczos algorithm compute exactly?
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- On monotonicity of the Lanczos approximation to the matrix exponential
- Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
- 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
- The short-term rational Lanczos method and applications
- Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential
- Error bounds for the Krylov subspace methods for computations of matrix exponentials
- 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
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- Error bounds for the Lanczos methods for approximating matrix exponentials
This page was built for publication: Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389226)