An engineering approach to generalized conjugate gradient methods and beyond

DOI10.1016/0168-9274(95)00083-6zbMath0854.65030OpenAlexW1976261693MaRDI QIDQ1917417

Rüdiger Weiss, Willi Schönauer

Publication date: 7 July 1996

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00083-6

zbMATH Keywords

Navier-Stokes equationspreconditioningconjugate gradient methodsnonsymmetric linear systems

Mathematics Subject Classification ID

Navier-Stokes equations (35Q30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items (4)

Special issue: Developments and trends in iterative methods for large systems of equations -- in memoriam Rüdiger Weiss. Minisymposium: 16th IMACS world congress, Lausanne, Switzerland, August 21--25, 2000 ⋮ Numerical experiments to optimize the use of (I)LU preconditioning in the iterative linear solver package LINSOL ⋮ A theoretical overview of Krylov subspace methods ⋮ Fast generalized cross validation using Krylov subspace methods

Uses Software

• Unnamed Item
• BiCGstab
• CGS
• ILUT
• na1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A breakdown-free Lanczos type algorithm for solving linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Avoiding breakdown in the CGS algorithm
• Avoiding breakdown and near-breakdown in Lanczos type algorithms
• Implementations of the GMRES method
• BiCGstab(\(l\)) and other hybrid Bi-CG methods
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• Minimization properties and short recurrences for Krylov subspace methods
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• Variants of BICGSTAB for Matrices with Complex Spectrum
• Residual Smoothing Techniques for Iterative Methods
• Error-Minimizing Krylov Subspace Methods
• ILUT: A dual threshold incomplete LU factorization
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures

This page was built for publication: An engineering approach to generalized conjugate gradient methods and beyond