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

DOI10.1016/j.cam.2014.04.009zbMath1326.65045OpenAlexW1974587895MaRDI QIDQ2517500

Xian-Yu Zuo, Li-Tao Zhang, Tong-Xiang Gu

Publication date: 26 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.cam.2014.04.009

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) Parallel numerical computation (65Y05)

Related Items (3)

A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations ⋮ Chaotic multigrid methods for the solution of elliptic equations ⋮ Developing CRS iterative methods for periodic Sylvester matrix equation

Cites Work

• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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