Elsevier

Parallel Computing

Volume 6, Issue 3, March 1988, Pages 265-274
Parallel Computing

Fast Poisson solvers for MIMD computers

https://doi.org/10.1016/0167-8191(88)90069-5Get rights and content

Abstract

The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR(l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the parameter l are determined for various problem sizes and degrees of parallelism. The algorithms are implemented on a shared memory multiprocessor and performance results are discussed.

References (19)

  • C. Temperton

    On the FACR(l) algorithm for the discrete Poisson equation

    J. Comput. Phys.

    (1980)
  • O. Buneman

    A compact non-iterative Poisson solver

  • W.L. Briggs, R.A. Sweet, L.B. Hart and A. O'Gallagher, Multiprocessor FFT methods, SIAM J. Sci. Statist. Comput., to...
  • W.L. Briggs, Further symmetries for in-place FFTs, SIAM J. Sci. Statist. Comput., to...
  • B.L. Buzbee et al.

    On direct methods for solving Poisson's equations

    SIAM J. Numer. Anal.

    (1970)
  • J.W. Cooley et al.

    An algorithm for the machine calculation of complex Fourier series

    Math. Comp.

    (1965)
  • R.W. Hockney

    A fast direct solution of Poisson's equation using Fourier analysis

    J. Acm

    (1965)
  • R.W. Hockney

    The potential calculation and some applications

    Methods Comput. Phys.

    (1970)
  • R.W. Hockney et al.

    Parallel Computers — Architecture, Programming and Algorithms

    (1981)
There are more references available in the full text version of this article.

Cited by (6)

View full text