Parallel Computational Fluid Dynamics 2008 pp 219-226 | Cite as

# From extruded-2D to fully-3D geometries for DNS: a Multigrid-based extension of the Poisson solver

## Abstract

Direct numerical simulation (DNS) of incompressible flows is an essential tool for improving the understanding of the physics of turbulence and for the development of better turbulence models. The Poisson equation, the main bottleneck from a parallel point of view, usually also limits its applicability for complex geometries. In this context, efficient and scalable Poisson solvers on fully-3D geometries are of high interest.In our previous work, a scalable algorithm for Poisson equation was proposed. It performed well on both small clusters with poor network performance and supercomputers using efficiently up to a thousand of CPUs. This algorithm named Krylov-Schur-Fourier Decomposition (KSFD) can be used for problems in parallelepipedic 3D domains with structured meshes and obstacles can be placed inside the flow. However, since a FFT decomposition is applied in one direction, mesh is restricted to be uniform and obstacles to be 2D shapes extruded along this direction.The present work is devoted to extend the previous KSFD algorithm to eliminate these limitations. The extension is based on a two-level Multigrid (MG) method that uses KSFD as a solver for second level. The algorithm is applied for a DNS of a turbulent flow in a channel with wall-mounted cube. Illustrative results at *Re* _{τ} = 590 (based on the cube height and the bulk velocity *Re* _{ h } = 7235) are shown.

## Key words

parallel 3D Poisson solver Schur complement method FFT Multigrid Preconditioned Conjugate Gradient Wall-mounted cube DNS## Preview

Unable to display preview. Download preview PDF.

## References

- 1.A. Gorobets, F. X. Trias, M. Soria, and A. Oliva. A scalable Krylov-Schur-Fourier Decomposition for the efficient solution of high-order Poisson equation on parallel systems from small clusters to supercomputers.
*Computers and Fluids*, under revision, 2008.Google Scholar - 2.Yousef Saad.
*Iterative Methods for Sparse Linear Systems*. PWS, 1996.Google Scholar - 3.M. Soria, C. D. Pérez-Segarra, and A. Oliva. A Direct Parallel Algorithm for the Efficient Solution of the Pressure-Correction Equation of Incompressible Flow Problems Using Loosely Coupled Computers.
*Numerical Heat Transfer, Part B*, 41:117–138, 2002.Google Scholar - 4.F. X. Trias, A. Gorobets, M. Soria, and A. Oliva. DNS of Turbulent Natural Convection Flows on the MareNostrum Supercomputer. In
*Parallel Computational Fluid Dynamics*, Antalya, Turkey, May 2007. Elsevier.Google Scholar - 5.F. X. Trias, M. Soria, A. Oliva, and C. D. Pérez-Segarra. Direct numerical simulations of two- and three-dimensional turbulent natural convection flows in a differentially heated cavity of aspect ratio 4.
*Journal of Fluid Mechanics*, 586:259–293, 2007.MATHCrossRefGoogle Scholar - 6.F. X. Trias, M. Soria, C. D. Pérez-Segarra, and A. Oliva. A Direct Schur-Fourier Decomposition for the Efficient Solution of High-Order Poisson Equations on Loosely Coupled Parallel Computers.
*Numerical Linear Algebra with Applications*, 13:303–326, 2006.MATHCrossRefMathSciNetGoogle Scholar - 7.R. W. C. P. Verstappen and A. E. P. Veldman. Symmetry-Preserving Discretization of Turbulent Flow.
*Journal of Computational Physics*, 187:343–368, May 2003.MATHCrossRefMathSciNetGoogle Scholar - 8.A. Yakhot, T. Anor, H. Liu, and N. Nikitin. Direct numerical simulation of turbulent flow around a wall-mounted cube: spatio-temporal evolution of large-scale vortices.
*Journal of Fluid Mechanics*, 566:1–9, 2006.MATHCrossRefGoogle Scholar