A minimal residual class of algorithms for linear systems

DOI10.1007/BF02238540zbMath0837.65025MaRDI QIDQ1313255

I. Nissen, Peter Kosmol

Publication date: 26 January 1994

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmspreconditioningnonsymmetric systemsminimal residual methodssecand methods with restart

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of the composite step biconjugate gradient method
• Fast secant methods for the iterative solution of large nonsymmetric linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems

This page was built for publication: A minimal residual class of algorithms for linear systems