Journal Article

FZJ-2015-01624

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Conjugate Gradients Parallelized on the Hypercube

Basermann, A. (Corresponding Author)

1993
World Scientific Singapore [u.a.]

This record in other databases:    

Please use a persistent id in citations: http://hdl.handle.net/2128/11843  doi:10.1142/S0129183193001014

Abstract: For the solution of discretized ordinary or partial differential equations it is necessary to solve systems of equations with coefficient matrices of different sparsity pattern, depending on the discretization method; using the finite element method (FE) results in largely unstructured systems of equations. A frequently used iterative solver for systems of equations is the method of conjugate gradients (CG) with different preconditioners. On a multiprocessor system with distributed memory, in particular the data distribution and the communication scheme depending on the used data struture are of greatest importance for the efficient execution of this method. Here, a data distribution and a communication scheme are presented which are based on the analysis of the column indices of the non-zero matrix elements. The performance of the developed parallel CG-method was measured on the distributed-memory-system INTEL iPSC/860 of the Research Centre Jülich with systems of equations from FE-models. The parallel CG-algorithm has been shown to be well suited for both regular and irregular discretization meshes, i.e. for coefficient matrices of very different sparsity pattern.

---

Contributing Institute(s):

1. Jülich Supercomputing Center (JSC)

Research Program(s):

1. 899 - ohne Topic (POF2-899) (POF2-899)

---

Database coverage:
; Current Contents - Physical, Chemical and Earth Sciences ; IF < 5 ; JCR ; SCOPUS ; Science Citation Index ; Science Citation Index Expanded ; Thomson Reuters Master Journal List ; Web of Science Core Collection

---