Journal of Computational and Applied Mathematics
A method for exponential propagation of large systems of stiff nonlinear differential equations
Journal of Scientific Computing
Two polynomial methods of calculating functions of symmetric matrices
USSR Computational Mathematics and Mathematical Physics
Analysis of some Krylov subspace approximations to the matrix exponential operator
SIAM Journal on Numerical Analysis
Efficient solution of parabolic equations by Krylov approximation methods
SIAM Journal on Scientific and Statistical Computing
Numerical ranges and stability estimates
Selected papers of the sixth conference on Numerical Treatment of Differential Equations
On Krylov Subspace Approximations to the Matrix Exponential Operator
SIAM Journal on Numerical Analysis
Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
SIAM Journal on Matrix Analysis and Applications
Exponential Integrators for Large Systems of Differential Equations
SIAM Journal on Scientific Computing
An interpolatory approximation of the matrix exponential based on Faber polynomials
Journal of Computational and Applied Mathematics
GMRES with Deflated Restarting
SIAM Journal on Scientific Computing
Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
SIAM Journal on Numerical Analysis
On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
SIAM Journal on Scientific Computing
Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
SIAM Journal on Scientific Computing
Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
SIAM Journal on Numerical Analysis
Acceleration Techniques for Approximating the Matrix Exponential Operator
SIAM Journal on Matrix Analysis and Applications
Exponential Runge--Kutta methods for parabolic problems
Applied Numerical Mathematics
Error Estimates for Polynomial Krylov Approximations to Matrix Functions
SIAM Journal on Matrix Analysis and Applications
Error Estimates and Evaluation of Matrix Functions via the Faber Transform
SIAM Journal on Numerical Analysis
Computing $f(A)b$ via Least Squares Polynomial Approximations
SIAM Journal on Scientific Computing
| Hi-index | 7.29 |
A deflated restarting Krylov subspace method for approximating a function of a matrix times a vector is proposed. In contrast to other Krylov subspace methods, the performance of the method in this paper is better. We further show that the deflating algorithm inherits the superlinear convergence property of its unrestarted counterpart for the entire function and present the results of numerical experiments.