Vector and parallel methods for the direct solution of Poisson's equation

Recent developments in the area of fast direct Poisson solvers are examined in the context of parallel computing. The growing gap that exists between peak and actual performance of contemporary architectures is attributed to internal communication requirements that do not contribute to performance as measured in m flops. For this reason, we focus on algorithms for parallel communication as well as parallel computation. Parallel algorithms for transposition, binary-reflected orderings, and index permutations in support of parallel methods for fast direct solvers are discussed. Both fine and medium grain computations are considered for: the “complete” Fourier method, partial matrix decomposition, parallel cyclic reduction with partial fraction expansion, and parallel approximate cyclic reduction.

[1]  D. Heller.  Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems , 1976 .

[2]  R. Hockney.  The potential calculation and some applications , 1970 .

[3]  P. Swarztrauber.  A direct Method for the Discrete Solution of Separable Elliptic Equations , 1974 .

[4]  Clive Temperton.  On the FACR( l) algorithm for the discrete Poisson equation , 1980 .

[5]  Duncan H. Lawrie,et al.  The computation and communication complexity of a parallel banded system solver , 1984, TOMS.

[6]  Chris R. Jesshope,et al.  Parallel Computers 2: Architecture, Programming and Algorithms , 1981 .

[7]  P. Swarztrauber.  A parallel algorithm for solving general tridiagonal equations , 1979 .

[8]  S. Johnsson.  Solving tridiagonal systems on ensemble architectures , 1987 .

[9]  P. Swarztrauber.  Approximate Cyclic Reduction for Solving Poisson's Equation , 1987 .

[10]  Harold S. Stone,et al.  An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations , 1973, JACM.

[11]  R. Sweet.  A Cyclic Reduction Algorithm for Solving Block Tridiagonal Systems of Arbitrary Dimension , 1977 .

[12]  M. Schultz,et al.  Preconditioning by fast direct methods for nonself-adjoint nonseparable elliptic equations , 1986 .

[13]  J. Ortega,et al.  Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[14]  H. H. Wang,et al.  A Parallel Method for Tridiagonal Equations , 1981, TOMS.

[15]  Paul N. Swarztrauber,et al.  EFFICIENT FORTRAN SUBPROGRAMS FOR THE SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS , 1981 .

[16]  Roger W. Hockney,et al.  A Fast Direct Solution of Poisson's Equation Using Fourier Analysis , 1965, JACM.

[17]  Harold S. Stone,et al.  Parallel Tridiagonal Equation Solvers , 1975, TOMS.

[18]  Roland A. Sweet,et al.  Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3] , 1979, TOMS.

[19]  Oliver A. McBryan,et al.  Hypercube Algorithms and Implementations , 1985, PPSC.

[20]  David J. Kuck,et al.  On Stable Parallel Linear System Solvers , 1978, JACM.

[21]  R. Sweet.  A Parallel and Vector Variant of the Cyclic Reduction Algorithm , 1988 .

[22]  Paul N Swarztrauber.  Symmetric FFTs , 1986 .

[23]  Donald Fraser,et al.  Array Permutation by Index-Digit Permutation , 1976, JACM.

[24]  Roger W. Hockney.  Optimizing the FACR Poisson-solver on parallel computers , 1982, ICPP.

[25]  David H. Bailey.  A High-Performance FFT Algorithm for Vector Supercomputers , 1987, PPSC.

[26]  P. Swarztrauber.  THE METHODS OF CYCLIC REDUCTION, FOURIER ANALYSIS AND THE FACR ALGORITHM FOR THE DISCRETE SOLUTION OF POISSON'S EQUATION ON A RECTANGLE* , 1977 .