Abstract
Very often used methods for solving linear systems are Krylov subspace iterative methods. Usually, the iterations stop at the moment when some norm of the residual reaches tolerable value. Since all computations are done in finite precision arithmetic, we can check only some approximation of the residual norm. The main goal of our research is, to give estimation for the real residual norm, calculated from this approximation, in order to make stopping criterion more reliable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Drkošová, A. Greenbaum, M. Rozložník, and Z. Strakoš. Numerical Stability of GM-RES. BIT, 35: pp. 309–330, 1995.
A. Greenbaum. Estimating the attainable accuracy of recursively computed residual methods. SIAM J. Matrix Anal. Appl., 18 (3): pp. 535–551, July 1997.
N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bosner, N. (2002). Numerical Stability of Krylov Subspace Iterative Methods for Solving Linear Systems. In: Drmač, Z., Hari, V., Sopta, L., Tutek, Z., Veselić, K. (eds) Applied Mathematics and Scientific Computing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4532-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4532-0_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-3390-4
Online ISBN: 978-1-4757-4532-0
eBook Packages: Springer Book Archive