Projection-minimization methods for nonsymmetric linear systems
From MaRDI portal
The paper starts with a survey of conjugate gradient-like methods for nonsymmetric linear systems. The algorithms may be divided into two groups; (1) Algorithms based on the minimization of some generalized residue; (2) Algorithms based on generalized orthogonality. The paper is devoted to those of the first type. In the algorithms called transformed projection minimization methods, the subspaces obtained by the standard choice are augmented.
Recommendations
Cites work
- A general projection algorithm for solving systems of linear equations
- A Schur complement approach to a general extrapolation algorithm
- A Theoretical Comparison of the Arnoldi and GMRES 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
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3133812 (Why is no real title available?)
- scientific article; zbMATH DE number 51614 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- scientific article; zbMATH DE number 3029984 (Why is no real title available?)
- scientific article; zbMATH DE number 3082021 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- On certain iterative methods for solving linear systems
- On the asymptotic directions of the s-dimensional optimum gradient method
- Preconditioning strategies for models of incompressible flow
- Projection method for solving a singular system of linear equations and its applications
- Row Projection Methods for Large Nonsymmetric Linear Systems
- s-step iterative methods for symmetric linear systems
- Sur-décomposition de normes générales et procédés itératifs
- The N‐Step Iteration Procedures
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Cited in
(10)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- A projection method for solving nonsymmetric linear systems on multiprocessors
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Analysis of a Minimum Perturbation Algorithm for Nonsymmetric Linear Systems
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- Row Projection Methods for Large Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 671780 (Why is no real title available?)
- scientific article; zbMATH DE number 2016596 (Why is no real title available?)
- scientific article; zbMATH DE number 7333392 (Why is no real title available?)
This page was built for publication: Projection-minimization methods for nonsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902114)
