Conjugate residual squared method and its improvement for non-symmetric linear systems
From MaRDI portal
Publication:5747702
DOI10.1080/00207160802401029zbMath1195.65044OpenAlexW2033700550MaRDI QIDQ5747702
Jiang-Hua Yue, Tong-Xiang Gu, Li-Tao Zhang, Xian-Yu Zuo, Ting-Zhu Huang
Publication date: 14 September 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802401029
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations ⋮ Matrix iteration algorithms for solving the generalized Lyapunov matrix equation ⋮ Developing CRS iterative methods for periodic Sylvester matrix equation ⋮ An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing ⋮ A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides ⋮ An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
Cites Work
- Unnamed Item
- Unnamed Item
- A performance model for Krylov subspace methods on mesh-based parallel computers
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
- 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
- Multiple search direction conjugate gradient method I: methods and their propositions
