Name
Abstract | ||
|---|---|---|
When using the Arnoldi method for approximating f(A)b, the action of a matrix function on a vector, the maximum number of iterations that can be performed is often limited by the storage requirements of the full Arnoldi basis. As a remedy, different restarting algorithms have been proposed in the literature, none of which has been universally applicable, efficient, and stable at the same time. We utilize an integral representation for the error of the iterates in the Arnoldi method which then allows us to develop an efficient quadrature-based restarting algorithm suitable for a large class of functions, including the so-called Stieltjes functions and the exponential function. Our method is applicable for functions of Hermitian and non-Hermitian matrices, requires no a priori spectral information, and runs with essentially constant computational work per restart cycle. We comment on the relation of this new restarting approach to other existing algorithms and illustrate its efficiency and numerical stability by various numerical experiments. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1137/13093491X | SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS |
Keywords | Field | DocType |
matrix function,Krylov subspace approximation,restarted Arnoldi method,restarted Lanczos method,deflated restarting,polynomial interpolation,Gaussian quadrature,Pade approximation | Mathematical optimization,Generalized minimal residual method,Mathematical analysis,Arnoldi iteration,Matrix (mathematics),Matrix function,Quadrature (mathematics),Gaussian quadrature,Hermitian matrix,Iterated function,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 2 | 0895-4798 |
Citations | PageRank | References |
15 | 1.07 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Frommer | 1 | 79 | 11.58 |
| Stefan Güttel | 2 | 42 | 3.06 |
| Marcel Schweitzer | 3 | 21 | 3.69 |