An analysis of the composite step biconjugate gradient method
From MaRDI portal
Publication:1326493
DOI10.1007/BF01385699zbMath0802.65038OpenAlexW2051160435WikidataQ57397413 ScholiaQ57397413MaRDI QIDQ1326493
Randolph E. Bank, Tony F. Chan
Publication date: 18 May 1994
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133764
convergencenumerical examplesiterative methodtridiagonal matricesroundoff errorLanczos processcomposite step biconjugate gradient method
Related Items
A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems ⋮ Treatment of near-breakdown in the CGS algorithm ⋮ Recycling BiCGSTAB with an Application to Parametric Model Order Reduction ⋮ Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ Maintaining convergence properties of BiCGStab methods in finite precision arithmetic ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ Deflated BiCG with an application to model reduction ⋮ An overview of approaches for the stable computation of hybrid BiCG methods ⋮ Conjugate gradient methods for continuation problems. II ⋮ Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration ⋮ Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems ⋮ A two level solver for \(h{-}p\) adaptive finite element equations ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A new iterative method for solving complex symmetric linear systems ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ Developing iterative algorithms to solve Sylvester tensor equations ⋮ Error Analysis of Krylov Methods In a Nutshell ⋮ Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids ⋮ Iterative solution of linear systems in the 20th century ⋮ Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems ⋮ A minimal residual class of algorithms for linear systems ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some upwinding techniques for finite element approximations of convection-diffusion equations
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- Lanczos-type algorithms for solving systems of linear equations
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- 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
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Solution of Sparse Indefinite Systems of Linear Equations
- 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
