𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust Multigrid Algorithms for the Navier–Stokes Equations

✍ Scribed by Ruben S Montero; Ignacio M Llorente; Manuel D Salas


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
223 KB
Volume
173
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis


Anisotropies occur naturally in computational fluid dynamics where the simulation of small-scale physical phenomena, such as boundary layers at high Reynolds numbers, causes the grid to be highly stretched, leading to a slowdown in convergence of multigrid methods. Several approaches aimed at making multigrid a robust solver have been proposed and analyzed in the literature using the scalar diffusion equation. However, they have rarely been applied to solving more complicated models, such as the incompressible Navier-Stokes equations. This paper contains the first published numerical results of the behavior of two popular robust multigrid approaches (alternating-plane smoothers combined with standard coarsening and plane-implicit smoothers combined with semi-coarsening) for solving the 3-D incompressible Navier-Stokes equations in the simulation of the driven-cavity and a boundary layer over a flat plate on a stretched grid. Grid size, grid stretching, and Reynolds number are the factors considered in evaluating the robustness of the multigrid methods. Both approaches yield large increases in convergence rates over cellimplicit smoothers on stretched grids. The combination of plane-implicit smoothers and semi-coarsening was found to be fully robust in the flat-plate simulation up to Reynolds numbers 10 6 and the best alternative in the driven-cavity simulation for Reynolds numbers above 10 3 . The alternating-plane approach exhibits a better behavior for lower Reynolds numbers (below 10 3 ) in the driven-cavity simulation.


📜 SIMILAR VOLUMES


On Newton–Krylov Multigrid Methods for t
✍ D.A. Knoll; V.A. Mousseau 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 46 KB

In this note we continue our investigation [1] of multigrid methods as preconditioners to a Jacobian-free Newton-Krylov method [2,3]. We consider two different options for the formation of the coarse grid operators required in the multigrid preconditioner. The first option (Method 1) involves restri

Nodal operator splitting adaptive finite
✍ S.Ø. Wille 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 2 views

Solution algorithms for solving the Navier-Stokes equations without storing equation matrices are developed. The algorithms operate on a nodal basis, where the finite element information is stored as the co-ordinates of the nodes and the nodes in each element. Temporary storage is needed, such as th

Algebraic multigrid methods for the solu
✍ Michael Griebel; Tilman Neunhoeffer; Hans Regler 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB 👁 3 views

The application of standard multigrid methods for the solution of the Navier±Stokes equations in complicated domains causes problems in two ways. First, coarsening is not possible to full extent since the geometry must be resolved by the coarsest grid used. Second, for semi-implicit time-stepping sc