Parallel implementation of the block conjugate gradient algorithm
From MaRDI portal
The mathematics of the block preconditioned conjugate gradient algorithm is reviewed. The coarse grained parallel version of the algorithm is presented and analyzed for message passing architectures.
Cited in
(17)- Parallel implementations of Broyden's method
- Efficient parallel implementations of finite element methods based on the conjugate gradient method
- Parallel versions of implicit LU-SGS method
- Numerical investigation of ensemble methods with block iterative solvers for evolution problems
- A breakdown-free block conjugate gradient method
- Convergence properties of block GMRES and matrix polynomials
- Parallel running of a modular simulation scheme
- scientific article; zbMATH DE number 4066520 (Why is no real title available?)
- A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
- scientific article; zbMATH DE number 2069330 (Why is no real title available?)
- A multilevel Monte Carlo ensemble scheme for random parabolic PDEs
- scientific article; zbMATH DE number 926693 (Why is no real title available?)
- Block conjugate gradient algorithms for least squares problems
- Block truncated-Newton methods for parallel optimization
- Parallel implementation of BVM methods
- Block conjugate gradient methods with error norm estimates for least squares problems
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
This page was built for publication: Parallel implementation of the block conjugate gradient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580889)
