A new taxonomy of conjugate gradient methods

DOI10.1016/0898-1221(95)00211-1zbMath0874.65024OpenAlexW2021692536MaRDI QIDQ1361262

Charles Broyden

Publication date: 2 November 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00211-1

zbMATH Keywords

Lanczos methodsconjugate gradientconjugate directionthree-term recurrence formulabiconjugate gradientsbiconjugate residualscg algorithmsHegedus methodstwo-term methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (5)

A new taxonomy of conjugate gradient methods ⋮ Combination preconditioning of saddle point systems for positive definiteness ⋮ Abstract perturbed Krylov methods ⋮ Convergence analysis of Krylov subspace methods ⋮ Convergence properties of block GMRES and matrix polynomials

Uses Software

• CGS
• Harwell-Boeing sparse matrix collection
• na1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preconditioning strategies for models of incompressible flow
• Generating conjugate directions for arbitrary matrices by matrix equations. I
• A breakdown-free Lanczos type algorithm for solving linear systems
• Generalized conjugate directions
• Augmentability in optimization theory
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Avoiding breakdown and near-breakdown in Lanczos type algorithms
• Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
• A conjugate direction algorithm without line searches
• A new taxonomy of conjugate gradient methods
• An approach to nonlinear programming
• Iterative methods for solving linear equations
• A Taxonomy for Conjugate Gradient Methods
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• Présentation de synthèse des méthodes de gradient conjugué
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Sparse matrix test problems
• On methods of conjugate direction
• Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Variants of BICGSTAB for Matrices with Complex Spectrum
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
• Hyperbolic Pairs in the Method of Conjugate Gradients
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures

This page was built for publication: A new taxonomy of conjugate gradient methods