Abstract
Preconditioned Krylov subspace solvers are an important and frequently used technique for solving large sparse linear systems. There are many advantageous properties concerning convergence rates and error estimates. However, implementing such a solver on a computer, we often observe an unexpected and even contrary behavior.
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
D. Adams. Life, the Universe and Everything. Ballantine Books, 1995.
G. Alefeld and J. Herzberger. Introduction to Interval Computations. Academic Press, 1983
American National Standards Institute / Institute of Electrical and Electronic Engineers, New York. A Standard for Binary Floating-Point Arithmetic, 1985. ANSI/IEEE Std. 754-1985.
T. J. Dekker. A floating-point technique for extending the available precision. Numer. Math., 18:224–242, 1971.
J. Demmel, B. Diament, and G. Malajovich. On the complexity of computing error bounds. www.cs.berkeley.edurdemmel/, 1999.
A. Facius. The need for higher precision in solving ill-conditioned linear systems. to be published in Iterative methods in Scientific Computation II, 2000.
A. Frommer and A. Weinberg. Verified error bounds for linear systems through the Lanczos process. Reliable Computing, 5(3):255–267, 1999.
G. Golub and C. van Loan. Matrix Computations. Johns Hopkins, third edition, 1996.
T. Granlund. The GNU Multiple Precision Arithmetic Library. vwv.csd.uu.se/documentation/-programming/gmp/
A. Greenbaum. Iterative Methods for Solving Linear Systems. SIAM, Philadelphia, 1997.
M. Hestenes and E. Stiefel. Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 49:409–436, 1952.
N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, 1996.
R. Klatte, U. Kulisch, A. Wiethoff, C. Lawo, and M. Rauch. C-XSC. Springer Verlag, 1992.
U. Kulisch. Advanced Aithmetic for the Digital Computer- Design of Arithmetic Units. Electronic Notes of Theoretical Computer Science, vwv.elsevier.nl/locate/entcs/volume24.html pp. 1-72, 1999.
C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research 0/ the National Bureau of Standards, 45:255–282, 1950.
The matrix market: a visual web database for numerical matrix data. math.nist.gov/MatrixMarket/
C. Paige. The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices. PhD thesis, University of London, 1971.
C. Paige and M. Saunders. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Soft., 8:43–71, 1982.
B. N. Parlett and D. S. Scott. The Lanczos algorithm with selective orthogonalization. Math. Comput., 33:217–238, 1979.
S. M. Rump. Validated solution of large linear systems. In R. Albrecht, G. Alefeld, and H. J. Stetter, editors, Validation Numeries, number 9 in Computing Supplementum, pages 191–212. Springer Verlag, 1993.
H. D. Simon. The Lanczos Algorithm for Solving Symmetrie Linear Systems. PhD thesis, University of California, Berkeley, 1982.
Z. Strakos. On the real convergence rate of the conjugate gradient method. Linear Algebra Appl., 154/156:535–549, 1991.
J. H. Wilkinson. The Aigebraic Eigenvalue Problem. Clarendon Press, Oxford, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this chapter
Cite this chapter
Facius, A. (2001). Highly Accurate Verified Error Bounds for Krylov Type Linear System Solvers. In: Kulisch, U., Lohner, R., Facius, A. (eds) Perspectives on Enclosure Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6282-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6282-8_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83590-6
Online ISBN: 978-3-7091-6282-8
eBook Packages: Springer Book Archive