A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
From MaRDI portal
Publication:4294367
DOI10.1137/0915023zbMath0803.65038DBLPjournals/siamsc/ChanGSST94OpenAlexW2094920787WikidataQ57397405 ScholiaQ57397405MaRDI QIDQ4294367
Tedd Szeto, Tony F. Chan, Valeria Simoncini, Charles H. Tong, Efstratios Gallopoulos
Publication date: 30 June 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9d2ee180c272db076485b352fcf597b1688dad08
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (35)
A quasi-minimal residual variant of IDRstab using the residual smoothing technique ⋮ BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems ⋮ A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems ⋮ A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems ⋮ A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments ⋮ Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm ⋮ The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems ⋮ Maintaining convergence properties of BiCGStab methods in finite precision arithmetic ⋮ A new taxonomy of conjugate gradient methods ⋮ Improved QMRCGSTAB method in distributed parallel environments ⋮ Minimal residual smoothing in multi-level iterative method ⋮ Approximate inverse computation using Frobenius inner product ⋮ An overview of approaches for the stable computation of hybrid BiCG methods ⋮ Residual smoothing and peak/plateau behavior in Krylov subspace methods ⋮ Conjugate gradient methods for continuation problems. II ⋮ Generalized conjugate gradient squared ⋮ IDR: a new generation of Krylov subspace methods? ⋮ Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems ⋮ A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\) ⋮ GMRES implementations and residual smoothing techniques for solving ill-posed linear systems ⋮ On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems ⋮ Unnamed Item ⋮ A variant of the IDR\((s)\) method with the quasi-minimal residual strategy ⋮ A new fully coupled method for computing turbulent flows ⋮ Variants of residual smoothing with a small residual gap ⋮ Solving the general coupled and the periodic coupled matrix equations via the extended QMRCGSTAB algorithms ⋮ An extension of the conjugate residual method to nonsymmetric linear systems ⋮ Stochastic discontinuous Galerkin methods with low-rank solvers for convection diffusion equations ⋮ 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 methods for linear systems of equations: A brief historical journey ⋮ 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 ⋮ Krylov subspace projection method and its application to oil reservoir simulation ⋮ The generalized QMRCGSTAB algorithm for solving Sylvester-transpose matrix equations ⋮ Iterative solution of linear systems in the 20th century
Uses Software
This page was built for publication: A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems