Fast Poisson solvers for MIMD computers
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 pa...
Gespeichert in:
Veröffentlicht in: | Parallel computing 1988, Vol.6 (3), p.265-274 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0167-8191 1872-7336 |
DOI: | 10.1016/0167-8191(88)90069-5 |