The behaviour of conjugate gradient based algorithms on a multi-vector processor with a memory hierarchy
Technical Report
·
OSTI ID:5768319
The conjugate gradient algorithm is one of the most efficient solvers for elliptic partial differential equations and has been successfully implemented on various vector computers. In this paper, the behaviour of conjugate gradient based algorithms on a multi-vector processor with a two-level memory hierarchy is investigated. Several domain decomposition techniques are considered as well as preconditioners that are suitable to be parallelized such as polynomial preconditioners or a vectorized version of the ICCG. Experimental results for the Poisson equation performed on an Alliant FX/8 are presented. 16 refs., 17 figs., 13 tabs.
- Research Organization:
- Illinois Univ., Urbana (USA). Center for Supercomputing Research and Development
- DOE Contract Number:
- FG02-85ER25001
- OSTI ID:
- 5768319
- Report Number(s):
- DOE/ER/25001-88; ON: DE88003529
- Country of Publication:
- United States
- Language:
- English
Similar Records
Conjugate gradient preconditioners for vector and parallel processors
Successive overrelaxation, multigrid, and preconditioned conjugate gradients algorithms for solving a diffusion problem on a vector computer
Vectorization of algorithms for solving systems of elliptic difference equations
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:6518740
Successive overrelaxation, multigrid, and preconditioned conjugate gradients algorithms for solving a diffusion problem on a vector computer
Journal Article
·
Mon Oct 31 23:00:00 EST 1983
· Appl. Math. Comput.; (United States)
·
OSTI ID:5136165
Vectorization of algorithms for solving systems of elliptic difference equations
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5517126