z-logo
Premium
A multigrid adaptive mesh refinement strategy for 3D aerodynamic design
Author(s) -
Jouhaud J.C.,
Montagnac M.,
Tourrette L.
Publication year - 2005
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.804
Subject(s) - multigrid method , polygon mesh , euler equations , aerodynamics , computational fluid dynamics , finite volume method , computer science , mathematics , grid , adaptive mesh refinement , euler's formula , convergence (economics) , mathematical optimization , computation , computational science , algorithm , partial differential equation , aerospace engineering , geometry , mathematical analysis , mechanics , engineering , physics , computer graphics (images) , economic growth , economics
Presently, improving the accuracy and reducing computational costs are still two major CFD objectives often considered incompatible. This paper proposes to solve this dilemma by developing an adaptive mesh refinement method in order to integrate the 3D Euler and Navier–Stokes equations on structured meshes, where a local multigrid method is used to accelerate convergence for steady compressible flows. The time integration method is a LU‐SGS method ( AIAA J 1988; 26: 1025–1026) associated with a spatial Jameson‐type scheme (Numerical solutions of the Euler equations by finite volume methods using Runge–Kutta time‐stepping schemes. AIAA Paper , 81‐1259, 1981). Computations of turbulent flows are handled by the standard k–ω model of Wilcox ( AIAA J 1994; 32: 247–255). A coarse grid correction, based on composite residuals, has been devised in order to enforce the coupling between the different grid levels and to accelerate the convergence. The efficiency of the method is evaluated on standard 2D and 3D aerodynamic configurations. Copyright © 2004 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here