A minimal residual class of algorithms for linear systems

DOI10.1007/BF02238540MaRDI QIDQ1313255zbMATH OpenFDO

Authors I. Nissen, Peter Kosmol

Publication date 26 January 1994

Published in Computing (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsminimal residual methodsnonsymmetric systemspreconditioningsecand methods with restart

Mathematics Subject Classification ID

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

Recommendations

• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The continued fraction methods for the solution of systems of linear equations
• A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
• On the Optimal Solution of Large Linear Systems

Cites work

• An analysis of the composite step biconjugate gradient method
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Fast secant methods for the iterative solution of large nonsymmetric linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• scientific article; zbMATH DE number 42525 (Why is no real title available?)
• scientific article; zbMATH DE number 3550114 (Why is no real title available?)

Cited in

(12)

• A modification of minimal residual iterative method to solve linear systems
• An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
• An algorithm for minimum L-infinity solution of under-determined linear systems
• Minimal residual algorithm and matrix-vector information
• Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
• On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
• A variant algorithm of the Orthomin\((m)\) method for solving linear systems
• A minimum residual algorithm for solving linear systems
• A minimal residual method for a special class of linear systems with normal matrices of coefficients
• A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
• Low synchronization Gram–Schmidt and generalized minimal residual algorithms
• A class of direct methods for linear systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313255)