Domain decomposition methods in computational fluid dynamics

William D. Gropp*, David Elliot Keyes

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

The divide‐and‐conquer paradigm of iterative domain decomposition or substructuring has become a practical tool in computational fluid dynamics applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi‐uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. We illustrate these features on the classic model problem of flow over a backstep using Newton's method as the non‐linear iteration. Multiple discretizations (second‐order in the operator and first‐order in the preconditioner) and locally uniform mesh refinement pay dividends separately and can be combined synergistically. We include sample performance results from an Intel iPSC/860 hypercube implementation.

Original languageEnglish (US)
Pages (from-to)147-165
Number of pages19
JournalInternational Journal for Numerical Methods in Fluids
Volume14
Issue number2
DOIs
StatePublished - Jan 1 1992

Keywords

  • Computational fluid dynamics
  • Domain decomposition
  • Locally uniform mesh refinement
  • Newton's method
  • Preconditioned Krylov iteration

ASJC Scopus subject areas

  • Computational Mechanics
  • Mechanics of Materials
  • Mechanical Engineering
  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Domain decomposition methods in computational fluid dynamics'. Together they form a unique fingerprint.

Cite this