A direct Schur-Fourier decomposition for the solution of the three-dimensional Poisson equation of incompressible flow problems using loosely coupled parallel computers

Parallel computers based on PC-class hardware (Beowulf clusters) provide a matchless computing power per cost unit. However, their network performance tends to be too low for standard parallel computational fluid dynamics (CFD) algorithms. A relevant example is the solution of the Poisson equations....

Full description

Saved in:
Bibliographic Details
Published inNumerical heat transfer. Part B, Fundamentals Vol. 43; no. 5; pp. 467 - 488
Main Authors Soria, M, Perez-Segarra, C D, Oliva, A
Format Journal Article
LanguageEnglish
Published 01.05.2003
Online AccessGet full text
ISSN1040-7790
DOI10.1080/10407790390122113

Cover

More Information
Summary:Parallel computers based on PC-class hardware (Beowulf clusters) provide a matchless computing power per cost unit. However, their network performance tends to be too low for standard parallel computational fluid dynamics (CFD) algorithms. A relevant example is the solution of the Poisson equations. The subject of this article is a direct Schur-Fourier decomposition (DSFD) algorithm that, for certain three-dimensional flows, produces an accurate solution of each Poisson equation with just one message, providing speed-ups of at least 24 in a low-cost PC cluster with a conventional network and 36 processors. Direct Numerical Simulation (DNS) of turbulent natural convection flow is used as a benchmark problem.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-1
ISSN:1040-7790
DOI:10.1080/10407790390122113