Highly accurate verified error bounds for Krylov type linear system solvers

DOI10.1016/S0168-9274(02)00234-9zbMath1018.65037MaRDI QIDQ1873165

Axel Facius

Publication date: 19 May 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

verificationconvergencenumerical examplespreconditioningerror boundsKrylov subspace methodsprogramslarge sparse linear systems of equationsproblem-oriented arithmetic

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Algorithms with automatic result verification (65G20) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Uses Software

• gmp
• LSQR
• mctoolbox
• CRAIG

Cites Work

• On the real convergence rate of the conjugate gradient method
• On the applicability of the interval Gaussian algorithm
• A floating-point technique for extending the available precision
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• The Lanczos Algorithm with Selective Orthogonalization
• Methods of conjugate gradients for solving linear systems
• On the complexity of computing error bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Highly accurate verified error bounds for Krylov type linear system solvers