Multiple search direction conjugate gradient method I: methods and their propositions
From MaRDI portal
Publication:4823351
DOI10.1080/00207160410001712305zbMath1059.65027MaRDI QIDQ4823351
Tong-Xiang Gu, Xuebin Chi, Xing-Ping Liu, Ze-Yao Mo
Publication date: 27 October 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160410001712305
performance; parallel computing; inner product; large and sparse linear systems; conjugate gradient-type method
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65Y05: Parallel numerical computation
Related Items
s-Step Enlarged Krylov Subspace Conjugate Gradient Methods, Improved QMRCGSTAB method in distributed parallel environments, Conjugate residual squared method and its improvement for non-symmetric linear systems, Gradient-based maximal convergence rate iterative method for solving linear matrix equations, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation, A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides, An improved bi-conjugate residual algorithm suitable for distributed parallel computing, An improved GBPi-CG algorithm suitable for distributed parallel computing, An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing, A parallel version of GPBi-CG method suitable for distributed parallel computing, An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing, An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing, Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication, Iterative algorithm for minimal norm least squares solution to general linear matrix equations
Cites Work
- Unnamed Item
- Multitasking the conjugate gradient method on the CRAY X-MP/48
- A performance model for Krylov subspace methods on mesh-based parallel computers
- The block preconditioned conjugate gradient method on vector computers
- s-step iterative methods for symmetric linear systems
- The block conjugate gradient algorithm and related methods
- Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
- Preconditioned CG methods for sparse matrices on massively parallel machines
- Krylov Subspace Methods on Supercomputers
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Generalized Schwarz Splittings