A new taxonomy of conjugate gradient methods
From MaRDI portal
Publication:1361262
DOI10.1016/0898-1221(95)00211-1zbMATH Open0874.65024OpenAlexW2021692536MaRDI QIDQ1361262FDOQ1361262
Authors: C. G. 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
Recommendations
conjugate gradientconjugate directionLanczos methodsthree-term recurrence formulabiconjugate gradientsbiconjugate residualscg algorithmsHegedus methodstwo-term methods
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A conjugate direction algorithm without line searches
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Methods of conjugate gradients for solving linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- An approach to nonlinear programming
- A Taxonomy for Conjugate Gradient Methods
- Variants of BICGSTAB for Matrices with Complex Spectrum
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Title not available (Why is that?)
- Generating conjugate directions for arbitrary matrices by matrix equations. I
- A breakdown-free Lanczos type algorithm for solving linear systems
- The N‐Step Iteration Procedures
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Présentation de synthèse des méthodes de gradient conjugué
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Preconditioning strategies for models of incompressible flow
- Sparse matrix test problems
- Augmentability in optimization theory
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Iterative methods for solving linear equations
- Title not available (Why is that?)
- 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
- A new taxonomy of conjugate gradient methods
- Generalized conjugate directions
- On methods of conjugate direction
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- On a recursive method including both CG and Burg's algorithms
- Duality in conjugate gradient methods
- On Conjugate Gradient Algorithms as Objects of Scientific Study
- Title not available (Why is that?)
- Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Abstract perturbed Krylov methods
- A new taxonomy of conjugate gradient methods
- Combination preconditioning of saddle point systems for positive definiteness.
- Convergence analysis of Krylov subspace methods
- Convergence properties of block GMRES and matrix polynomials
- A Taxonomy for Conjugate Gradient Methods
- Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
Uses Software
This page was built for publication: A new taxonomy of conjugate gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361262)
