Projection-minimization methods for nonsymmetric linear systems
type: Item
instance of: scholarly article
title: Projection-minimization methods for nonsymmetric linear systems
zbMATH Open document ID: 0837.65032
DOI: 10.1016/0024-3795(93)00348-4
author: Khalide Jbilou
published in: Linear Algebra and its Applications
publication date: 1996-05-21T00:00:00Z
review text: 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.
reviewed by: D. Braess
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 815898
zbMATH Keywords: generalized residual minimization methods
zbMATH Keywords: conjugate gradient-like methods
zbMATH Keywords: nonsymmetric linear systems
zbMATH Keywords: algorithms
zbMATH Keywords: transformed projection minimization methods
describes a project that uses: CGS
MaRDI profile type: Publication
full work available at URL: 0024-3795(93)00348-4
OpenAlex ID: W2078469482
cites work: Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
cites work: Row Projection Methods for Large Nonsymmetric Linear Systems
cites work: A Schur complement approach to a general extrapolation algorithm
cites work: A Theoretical Comparison of the Arnoldi and GMRES Algorithms
cites work: s-step iterative methods for symmetric linear systems
cites work: Q5769827
cites work: The N‐Step Iteration Procedures
cites work: Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
cites work: Preconditioning strategies for models of incompressible flow
cites work: Q4091368
cites work: On the asymptotic directions of the s-dimensional optimum gradient method
cites work: Q3250017
cites work: Sur-décomposition de normes générales et procédés itératifs
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q5820842
cites work: On certain iterative methods for solving linear systems
cites work: A general projection algorithm for solving systems of linear equations
cites work: Q5768822
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Projection method for solving a singular system of linear equations and its applications
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Q4001994
cites work: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
description: scientific article; zbMATH DE number 815898