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
Algorithms for computational fluid dynamics n parallel processors
Vectorization of algorithms for solving systems of elliptic difference equations
Conference
·
Sat Jan 01 00:00:00 EST 1983
·
OSTI ID:5768319
Algorithms for computational fluid dynamics n parallel processors
Thesis/Dissertation
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:5768319
Vectorization of algorithms for solving systems of elliptic difference equations
Conference
·
Sat Jan 01 00:00:00 EST 1983
·
OSTI ID:5768319