A. Frommer, K. Kahl, Th. Lippert, H. Rittich
The Lanczos process constructs a sequence of orthonormal vectors v_m spanning a nested sequence of Krylov subspaces generated by a hermitian matrix A and some starting vector b. In this paper we show how to cheaply recover a secondary Lanczos process, starting at an arbitrary Lanczos vector v_m and how to use this secondary process to efficiently obtain computable error estimates and error bounds for the Lanczos approximations to a solution of a linear system Ax = b as well as, more generally, for the Lanczos approximations to the action of a rational matrix function on a vector. Our approach uses the relation between the Lanczos process and quadrature as developed by Golub and Meurant. It is different from methods known so far because of its use of the secondary Lanczos process. With our approach, it is now in particular possible to efficiently obtain upper bounds for the error in the 2-norm, provided a lower bound on the smallest eigenvalue of A is known. This holds for the error of the cg iterates as well as for the Lanczos approximations for a large class of rational matrix functions including best rational approximations to the inverse square root and the sign function. We will compare our approach to other existing error estimates and bounds known from the literature and include results of several numerical experiments.
View original:
http://arxiv.org/abs/1204.5052
No comments:
Post a Comment