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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 21; no. 11; pp. 1725 - 1748
Main Author: Notay, Y.
Format: Journal Article
Language:English
Published: Elsevier B.V 1995
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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