2013.48: Efficient and stable Arnoldi restarts for matrix functions based on quadrature
2013.48: Andreas Frommer, Stefan Güttel and Marcel Schweitzer (2013) Efficient and stable Arnoldi restarts for matrix functions based on quadrature.
This is the latest version of this eprint.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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 was 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.
|Item Type:||MIMS Preprint|
|Uncontrolled Keywords:||matrix function, Krylov subspace approximation, restarted Arnoldi/Lanczos method, deflated restarting, polynomial interpolation, Gaussian quadrature, PadÃ© approximation|
|Subjects:||MSC 2000 > 65 Numerical analysis|
|Deposited By:||Stefan Güttel|
|Deposited On:||25 February 2014|
Available Versions of this Item
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature (deposited 25 February 2014) [Currently Displayed]