An efficient parallel discrete PDE solver

We present a parallel iterative solver for discrete second order elliptic PDEs. It is based on the conjugate gradient algorithm with incomplete factorization preconditioning, using a domain decomposed ordering to allow parallelism in the triangular solves, and resorting to some special recently deve...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Parallel computing Ročník 21; číslo 11; s. 1725 - 1748
Hlavný autor: Notay, Y.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 1995
Predmet:
Conjugate gradient algorithm
Distributed memory multiprocessor
Incomplete factorization
Partial differential equation
Preconditioning
Incomplete factorization
Distributed memory multiprocessor
Preconditioning
Partial differential equation
Conjugate gradient algorithm
ISSN:0167-8191, 1872-7336
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a parallel iterative solver for discrete second order elliptic PDEs. It is based on the conjugate gradient algorithm with incomplete factorization preconditioning, using a domain decomposed ordering to allow parallelism in the triangular solves, and resorting to some special recently developed parallelization technique to avoid communication bottleneck for the computation associated to the internal boundary nodes. Numerical results are given for a transputer network with up to 512 processors and a few workstation cluster.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/0167-8191(96)80005-6