Breakdown and near-breakdown control in the CGS algorithm using stochastic arithmetic

DOI10.1007/BF02142491zbMath0847.65017OpenAlexW2030342534MaRDI QIDQ1911443

Ana C. Matos, Jean-Marie Chesneaux

Publication date: 13 October 1996

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02142491

zbMATH Keywords

numerical resultsLanczos methodrecurrence relationsorthogonal matrix polynomialsconjugate gradient squared methodstochastic arithmeticnear-breakdowncontrolling numerical instabilities

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Uses Software

• CGS
• na5
• na1

Cites Work

• Unnamed Item
• Padé-type approximation and general orthogonal polynomials
• New methods for evaluating the validity of the results of mathematical computations
• A new presentation of orthogonal polynomials with applications to their computation
• Treatment of near-breakdown in the CGS algorithm
• The equality relations in scientific computing
• Lanczos-type algorithms for solving systems of linear equations
• Polynômes orthogonaux formels - applications
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems

This page was built for publication: Breakdown and near-breakdown control in the CGS algorithm using stochastic arithmetic