Avoiding breakdown in variants of the BI-CGSTAB algorithm
From MaRDI portal
Publication:1368763
DOI10.1016/S0024-3795(96)00525-3zbMath0885.65033OpenAlexW2072431272MaRDI QIDQ1368763
Publication date: 2 April 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(96)00525-3
numerical examplesnonsymmetric linear systemsbi-conjugate-gradient methodbreakdown-free BI-CGSTAB algorithm
Related Items (4)
Recycling BiCGSTAB with an Application to Parametric Model Order Reduction ⋮ On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems ⋮ A note on convergence of quasi-minimal residual smoothing ⋮ On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
Uses Software
Cites Work
- Padé-type approximation and general orthogonal polynomials
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- A breakdown-free Lanczos type algorithm for solving linear systems
- Avoiding breakdown in the CGS algorithm
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Polynômes orthogonaux formels - applications
- Beiträge zur Kenntnis des Biorthogonalisierungs-Algorithmus von Lanczos
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric 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
- How Fast are Nonsymmetric Matrix Iterations?
- Variants of BICGSTAB for Matrices with Complex Spectrum
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- 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: Avoiding breakdown in variants of the BI-CGSTAB algorithm
