Abstract
Efficient parallel algorithms are required to simulate incompressible turbulent flows in complex two- and three-dimensional domains. The incompressible Navier-Stokes equations are discretized in general coordinates on a structured grid. For a flow on a general domain we use an unstructured decomposition of the domain into subdomains of simple shape, with a structured grid inside each subdomain. We have developed a parallel block-preconditioned GCR method to solve the resulting systems of linear equations. The method can be smoothly varied between a coarse grain parallel method in which the subdomain problems are solved accurately with an inner iteration process and a fine grain parallel method when only a preconditioner is used to approximate the solution on the blocks. Parallel performance results for Boussinesq flow in a cavity are included.
Original language | English |
---|---|
Pages (from-to) | 31-40 |
Number of pages | 10 |
Journal | Future Generation Computer Systems |
Volume | 18 |
Issue number | 1 |
DOIs | |
Publication status | Published - Sept 2001 |
Externally published | Yes |
Keywords
- Approximate subdomain solution
- Domain decomposition
- Incompressible Navier-Stokes equations
- Orthogonalization methods
- Parallel Krylov subspace methods