Krylov Subspace Restarting for Matrix Laplace Transforms
From MaRDI portal
Publication:6158488
Abstract: A common way to approximate -- the action of a matrix function on a vector -- is to use the Arnoldi approximation. Since a new vector needs to be generated and stored in every iteration, one is often forced to rely on restart algorithms which are either not efficient, not stable or only applicable to restricted classes of functions. We present a new representation of the error of the Arnoldi iterates if the function is given as a Laplace transform. Based on this representation we build an efficient and stable restart algorithm. In doing so we extend earlier work for the class of Stieltjes functions which are special Laplace transforms. We report several numerical experiments including comparisons with the restart method for Stieltjes functions.
Recommendations
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- A restarted Lanczos approximation to functions of a symmetric matrix
- On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
Cites work
- scientific article; zbMATH DE number 3470714 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 3437808 (Why is no real title available?)
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
- A generalization of the steepest descent method for matrix functions
- A practical guide to splines.
- A restarted Lanczos approximation to functions of a symmetric matrix
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Approximation of functions of large matrices with Kronecker structure
- Bernstein functions. Theory and applications
- Computation of matrix gamma function
- Computing the action of the matrix exponential, with an application to exponential integrators
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Discrete interpolation norms with applications
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Error bounds for the Krylov subspace methods for computations of matrix exponentials
- Exponential integrators
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Matrix functions
- Methods of conjugate gradients for solving linear systems
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
- On monotonicity of the Lanczos approximation to the matrix exponential
- On the Convergence of Some Cubic Spline Interpolation Schemes
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Quadrature rule-based bounds for functions of adjacency matrices
- Rational Krylov for Stieltjes matrix functions: convergence and pole selection
- Rational Krylov methods for fractional diffusion problems on graphs
- Residual and restarting in Krylov subspace evaluation of the \(\varphi\) function
- Residual, restarting, and Richardson iteration for the matrix exponential
- The Representation of Functions as Laplace and Laplace–Stieltjes Transforms
- The University of Florida sparse matrix collection
- The numerical range is a \((1+\sqrt{2})\)-spectral set
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The representation of functions as Laplace transforms
- Two polynomial methods of calculating functions of symmetric matrices
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- Vectorized adaptive quadrature in MATLAB
- Verified computation of matrix gamma function
Cited in
(3)
This page was built for publication: Krylov Subspace Restarting for Matrix Laplace Transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158488)
