An overview of approaches for the stable computation of hybrid BiCG methods

DOI10.1016/0168-9274(95)00085-2zbMath0856.65022OpenAlexW2127499737MaRDI QIDQ1917419

Henk A. van der Vorst, Gerard L. G. Sleijpen

Publication date: 24 February 1997

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

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

zbMATH Keywords

stabilizationnumerical examplesconjugate gradient methodhybrid methodsnonsymmetric linear systemsBiCG iterationlook-ahead strategies

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (5)

A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ Analysis of 3D time-dependent acoustic problems via a generic BE substructuring algorithm based on iterative solvers. ⋮ FLEXMG: A new library of multigrid preconditioners for a spectral/finite element incompressible flow solver ⋮ Improving the convergence behaviour of BiCGSTAB by applying <i>D</i>-norm minimization

Uses Software

• BiCGstab
• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The superlinear convergence behaviour of GMRES
• An analysis of the composite step biconjugate gradient method
• A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
• Treatment of near-breakdown in the CGS algorithm
• BiCGstab(\(l\)) and other hybrid Bi-CG methods
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
• Reliable updated residuals in hybrid Bi-CG methods
• Generalized conjugate gradient squared
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• 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
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Variants of BICGSTAB for Matrices with Complex Spectrum
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms

This page was built for publication: An overview of approaches for the stable computation of hybrid BiCG methods