Affordable Access

Publisher Website

An efficient parallel discrete PDE solver

Authors
Journal
Parallel Computing
0167-8191
Publisher
Elsevier
Publication Date
Volume
21
Issue
11
Identifiers
DOI: 10.1016/0167-8191(96)80005-6
Keywords
  • Partial Differential Equation
  • Conjugate Gradient Algorithm
  • Incomplete Factorization
  • Preconditioning
  • Distributed Memory Multiprocessor
Disciplines
  • Communication
  • Computer Science

Abstract

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

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Efficient vectorizable PDE solvers

on Journal of Computational and A... Jan 01, 1989

On the structure of parallelism in a highly concur...

on Journal of Parallel and Distri... Jan 01, 1986
More articles like this..