Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
From MaRDI portal
Publication:291379
DOI10.1007/s40314-014-0188-xzbMath1339.65051OpenAlexW2022697411MaRDI QIDQ291379
Publication date: 7 June 2016
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0188-x
numerical experimentmultiple right-hand sidescomplex spectrumGl-BiCGSTABGl-GPBiCGmatrix Krylov subspace methodnon-symmetric linear systemsproduct-type method
Related Items (3)
Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis ⋮ Global GPBiCGstab\((L)\) method for solving linear matrix equations ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\)
Uses Software
Cites Work
- Unnamed Item
- A new family of global methods for linear systems with multiple right-hand sides
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- Oblique projection methods for linear systems with multiple right-hand sides
- New convergence results on the global GMRES method for diagonalizable matrices
- Generalized global conjugate gradient squared algorithm
- An extension of the conjugate residual method to nonsymmetric linear systems
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Global FOM and GMRES algorithms for matrix equations
- Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
- CG-type algorithms to solve symmetric matrix equations
- Convergence properties of block GMRES and matrix polynomials
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- The university of Florida sparse matrix collection
- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
This page was built for publication: Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
