An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing

DOI10.1007/s13160-014-0163-3zbMath1320.65052OpenAlexW2074608668MaRDI QIDQ2352144

Xian-Yu Zuo, Li-Tao Zhang, Xiao-Na Dong, Xing-Ping Liu, Tong-Xiang Gu

Publication date: 30 June 2015

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-014-0163-3

zbMATH Keywords

Krylov subspace methodsglobal communicationsparse nonsymmetric linear systemsIGCRS algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Uses Software

• CGS

Cites Work

• Unnamed Item
• 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
• Conjugate residual squared method and its improvement for non-symmetric linear systems

This page was built for publication: An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing