A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
From MaRDI portal
Publication:1349128
DOI10.1016/S0168-9274(01)00107-6zbMath0996.65034MaRDI QIDQ1349128
Martin H. Gutknecht, Miroslav Rozložnik
Publication date: 21 May 2002
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
algorithms; sparse linear systems; Krylov subspace method; minimal residual method; orthogonal residual method; generalized conjugate gradient methods
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
Related Items
Lanczos-type variants of the COCR method for complex nonsymmetric linear systems, Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms, Combination preconditioning of saddle point systems for positive definiteness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On the stable implementation of the generalized minimal error method
- Implementations of the GMRES method
- Minimization properties and short recurrences for Krylov subspace methods
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Residual smoothing and peak/plateau behavior in Krylov subspace methods
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- A Taxonomy for Conjugate Gradient Methods
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Changing the Norm in Conjugate Gradient Type Algorithms
- Solution of Sparse Indefinite Systems of Linear Equations
- Residual Smoothing Techniques for Iterative Methods
- Error-Minimizing Krylov Subspace Methods
- Properties of generalized conjugate gradient methods
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
- 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 Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
- By how much can residual minimization accelerate the convergence of orthogonal residual methods?
