A new taxonomy of conjugate gradient methods
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3736914 (Why is no real title available?)
- scientific article; zbMATH DE number 3787937 (Why is no real title available?)
- scientific article; zbMATH DE number 3788816 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- A Taxonomy for Conjugate Gradient Methods
- A breakdown-free Lanczos type algorithm for solving linear systems
- A conjugate direction algorithm without line searches
- A new taxonomy of conjugate gradient methods
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- An approach to nonlinear programming
- Augmentability in optimization theory
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Generalized conjugate directions
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Generating conjugate directions for arbitrary matrices by matrix equations. I
- Hyperbolic Pairs in the Method of Conjugate Gradients
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Iterative methods for solving linear equations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Methods of conjugate gradients for solving linear systems
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- On methods of conjugate direction
- Preconditioning strategies for models of incompressible flow
- Présentation de synthèse des méthodes de gradient conjugué
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Sparse matrix test problems
- The N‐Step Iteration Procedures
- The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
- Variants of BICGSTAB for Matrices with Complex Spectrum
Cited in
(14)- scientific article; zbMATH DE number 1779937 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7675633 (Why is no real title available?)
- 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
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)