GPBiCG(\(m,\ell\)): A hybrid of biCGSTAB and GPBiCG methods with efficiency and robustness
From MaRDI portal
Publication:1349137
DOI10.1016/S0168-9274(01)00113-1zbMath0993.65042MaRDI QIDQ1349137
Publication date: 21 May 2002
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
convergencenumerical experimentslarge sparse linear systemiterative methodBiCGSTABconjugate gradient type methodsGPBiCGproduct-type methods
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (6)
Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems ⋮ ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems ⋮ A superposition-based parallel discrete operator splitting method for incompressible flows ⋮ Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Iterative solution of linear systems in the 20th century
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
This page was built for publication: GPBiCG(\(m,\ell\)): A hybrid of biCGSTAB and GPBiCG methods with efficiency and robustness