Look-ahead in Bi-CGSTAB and other product methods for linear systems
From MaRDI portal
Publication:1899929
DOI10.1007/BF01737161zbMath0831.65032OpenAlexW1978429153MaRDI QIDQ1899929
Claude Brezinski, Michela Redivo-Zaglia
Publication date: 11 October 1995
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01737161
Related Items (max. 100)
Treatment of near-breakdown in the CGS algorithm ⋮ VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems ⋮ BiCGStab, VPAStab and an adaptation to mildly nonlinear systems ⋮ Unnamed Item ⋮ Advances in iterative methods and preconditioners for the Helmholtz equation ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ On vector Hankel determinants ⋮ Vector sequence transformations: Methodology and applications to linear systems ⋮ Iterative solution of linear systems in the 20th century ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Some vector sequence transformations with applications to systems of equations
- Lanczos maximal algorithm for unsymmetric eigenvalue problems
- Padé-type approximation and general orthogonal polynomials
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Generating conjugate directions for arbitrary matrices by matrix equations. I
- Stieltjes- and Geronimus-type polynomials
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Avoiding breakdown in the CGS algorithm
- A new presentation of orthogonal polynomials with applications to their computation
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Généralisations de la transformation de Shanks, de la table de Padé et de l'\(\varepsilon\)-algorithme
- Hybrid procedures for solving linear systems
- An analysis of the composite step biconjugate gradient method
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Treatment of near-breakdown in the CGS algorithm
- Lanczos-type algorithms for solving systems of linear equations
- Least-squares orthogonal polynomials
- Polynômes orthogonaux formels - applications
- The stable computation of formal orthogonal polynomials
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- 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
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Methods of conjugate gradients for solving linear systems
- Mean Value Methods in Iteration
This page was built for publication: Look-ahead in Bi-CGSTAB and other product methods for linear systems
