A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
From MaRDI portal
Publication:1334200
DOI10.1007/BF02141258zbMath0809.65025WikidataQ57397406 ScholiaQ57397406MaRDI QIDQ1334200
Randolph E. Bank, Tony F. Chan
Publication date: 2 April 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
numerical experimentsnonsymmetric linear systemsLanczos processBCG algorithmcomposite step bi-conjugate gradient algorithm
Related Items (18)
An analysis of the composite step biconjugate gradient method ⋮ A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges ⋮ 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 ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ A look-ahead strategy for the implementation of some old and new extrapolation methods ⋮ Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems ⋮ Localized radial basis functions-based pseudo-spectral method (LRBF-PSM) for nonlocal diffusion problems ⋮ Iterative computation of negative curvature directions in large scale optimization ⋮ 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 ⋮ Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks ⋮ On solving sparse symmetric linear systems whose definiteness is unknown ⋮ Numerical simulations of nonlocal phase-field and hyperbolic nonlocal phase-field models via localized radial basis functions-based pseudo-spectral method (LRBF-PSM) ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- An analysis of the composite step biconjugate gradient method
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Polynômes orthogonaux formels - applications
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- GMRES: A Generalized Minimal Residual Algorithm 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?
- Solution of Sparse Indefinite Systems of Linear Equations
- 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 Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Hyperbolic Pairs in the Method of Conjugate Gradients
This page was built for publication: A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
