An engineering approach to generalized conjugate gradient methods and beyond
type: Item
instance of: scholarly article
title: An engineering approach to generalized conjugate gradient methods and beyond
zbMATH Open document ID: 0854.65030
DOI: 10.1016/0168-9274(95)00083-6
author: Willi Schönauer
author: Rüdiger Weiss
published in: Applied Numerical Mathematics
publication date: 1996-07-07T00:00:00Z
review text: The authors give a simple introduction of generalized conjugate gradient methods for readers who are not experts in this field. They present an overview of various conjugate gradient-type methods with their characteristic properties. The nonsymmetric linear systems used in numerical experiments are obtained by discretization and linearization of a coarse model of Navier-Stokes equations for various magnitudes of the Reynolds number. Preconditioning ``from the left and from the right'' is discussed. Behaviour of \(\log (|r_k|/ |r_0|)\) and \(\log(|e_k|/|e_0|)\) is plotted and the methods are compared using obtained graphs.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 35Q30
Mathematics Subject Classification ID: 65F35
zbMATH DE Number: 897509
zbMATH Keywords: preconditioning
zbMATH Keywords: conjugate gradient methods
zbMATH Keywords: nonsymmetric linear systems
zbMATH Keywords: Navier-Stokes equations
reviewed by: Jan Zítko
describes a project that uses: FIDISOL
describes a project that uses: CGS
describes a project that uses: BiCGstab
describes a project that uses: na1
describes a project that uses: ILUT
MaRDI profile type: Publication
full work available at URL: 0168-9274(95)00083-6
OpenAlex ID: W1976261693
cites work: Avoiding breakdown and near-breakdown in Lanczos type algorithms
cites work: A breakdown-free Lanczos type algorithm for solving linear systems
cites work: Avoiding breakdown in the CGS algorithm
cites work: The N‐Step Iteration Procedures
cites work: Q4091368
cites work: A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
cites work: Variants of BICGSTAB for Matrices with Complex Spectrum
cites work: Q3909906
cites work: Methods of conjugate gradients for solving linear systems
cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
cites work: ILUT: A dual threshold incomplete LU factorization
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Q4026745
cites work: BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
cites work: BiCGstab(\(l\)) and other hybrid Bi-CG methods
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Implementations of the GMRES method
cites work: Q4001994
cites work: Error-Minimizing Krylov Subspace Methods
cites work: Minimization properties and short recurrences for Krylov subspace methods
cites work: Q5604166
cites work: Residual Smoothing Techniques for Iterative Methods
description: scientific article; zbMATH DE number 897509