BibTeX
@MISC{94anefficient,
author = {},
title = {AN EFFICIENT PARALLEL DISCRETE PDE SOLVER},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
efficient parallel discrete pde solver parallel iterative solver triangular solves internal boundary node conjugate gradient algorithm incomplete factorization preconditioning discrete second order elliptic pdes parallelization technique numerical result workstation cluster transputer network communication bottleneck
