Skip to main content
Log in

An immersed boundary method on Cartesian adaptive grids for the simulation of compressible flows around arbitrary geometries

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

In this article, we present an immersed boundary method for the simulation of compressible flows of complex geometries encountered in aerodynamics. The immersed boundary methods allow the mesh not to conform to obstacles, whose influence is taken into account by modifying the governing equations locally (either by a source term within the equation or by imposing the flow variables or fluxes locally, similarly to a boundary condition). A main feature of the approach which we propose is that it relies on structured Cartesian grids in combination with a dedicated HPC Cartesian solver, taking advantage of their low memory and CPU time requirements but also the automation of the mesh generation and adaptation. Turbulent flow simulations are performed by solving the Reynolds-averaged Navier–Stokes equations or by a Large-Eddy simulation approach, in combination with a wall function at high Reynolds number, to mitigate the cell count resulting from the isotropic nature of Cartesian cells. The objective of this paper is to demonstrate that this automatic workflow is fast and robust and enables to get quantitative aerodynamics results on geometrically complex configurations. Results obtained are in good agreement with classical body-fitted approaches but with a significant reduction of the time of the whole process, that is a day for RANS simulations, including the mesh generation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. http://elsa.onera.fr/Cassiopee/Userguide.html. Accessed 5 Feb 2020

  2. https://w3.onera.fr/FAST. Accessed 5 Feb 2020

  3. Barequet G, Chazelle B, Guibas LJ (1996) BOXTREE: a hierarchical representation for surfaces in 3D. Comput Graph Forum 15

  4. Benoit C, Péron S, Landier S (2015) Cassiopee: a CFD pre- and post-processing tool. Aerosp Sci Technol 45:272–283

    Article  Google Scholar 

  5. Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517

    Article  Google Scholar 

  6. Berger MJ, Aftosmis MJ (2012) Progress towards a Cartesian cut-cell method for viscous compressible flow. AIAA paper 2012-1301

  7. Berger MJ, Aftosmis MJ (2017) An ODE-based wall model for turbulent flow simulations. AIAA J 2:1–15

    Google Scholar 

  8. Brehm C, Barad MF, Kiris CC (2016) Open rotor computational aeroacoustic analysis with an immersed boundary method. In: 54th AIAA aerospace sciences meeting, p 0815

  9. Cambier L, Heib S, Plot S (2013) The ONERA elsA CFD software: input from research and feedback from industry. Mech Ind 14(03):159–174

    Article  Google Scholar 

  10. Capizzano F (2011) Turbulent wall model for immersed boundary methods. AIAA J 49(11):2367–2381

    Article  Google Scholar 

  11. Capizzano F (2018) Automatic generation of locally refined Cartesian meshes: data management and algorithms. Int J Numer Methods Eng 113(5):789–813

    Article  MathSciNet  Google Scholar 

  12. Chen ZL, Hickel S, Devesa A, Berland J, Adams NA (2014) Wall modeling for implicit large-eddy simulation and immersed-interface methods. Theoret Comput Fluid Dyn 28(1):1–21

    Article  Google Scholar 

  13. Cheng Z-Q, Wang Y-Z, Li Bao, Xu Kai, Dang Gang, Jin S-Y (2008) A survey of methods for moving least squares surfaces. In: Proceedings of the fifth Eurographics/IEEE VGTC conference on point-based graphics, p 9–23

  14. Coakley TJ (1985) Implicit upwind methods for the compressible Navier–Stokes equations. AIAA J 23(3):374–380

    Article  Google Scholar 

  15. Coirier WJ, Powell KG (1996) Solution-adaptive Cartesian cell approach for viscous and inviscid flows. AIAA J 34(5):938–945

    Article  Google Scholar 

  16. Dandois J, Mary I, Brion V (2018) Large-eddy simulation of laminar transonic buffet. J Fluid Mech 850:156–178

    Article  MathSciNet  Google Scholar 

  17. Daude F, Mary I, Comte P (2014) Self-adaptive Newton-based iteration strategy for the les of turbulent multi-scale flows. Comput Fluids 100:278–290

    Article  MathSciNet  Google Scholar 

  18. Edwards JR, Liou M-S (1998) Low-diffusion flux-splitting methods for flows at all speeds. AIAA J 36(9):1610–1617

    Article  Google Scholar 

  19. Fadlun EA, Verzicco R, Orlandi P, Mohd-Yusof J (2000) Combined immersed-boundary finite-difference methods for three-dimensional complex flow simulations. J Comput Phys 161(1):35–60

    Article  MathSciNet  Google Scholar 

  20. Hantrais-Gervois J-L, Cartieri A, Mouton S, Piat J-F (2010) Empty wind tunnel flow field computations. Int J Eng Syst Model Simul 2(1–2):46–57

    Google Scholar 

  21. Jameson A, Yoon S (1987) Lower-upper implicit schemes with multiple grids for the euler equations. AIAA J 25(7):929–935

    Article  Google Scholar 

  22. Jeong W-K, Whitaker RT (2008) A fast iterative method for Eikonal equations. SIAM J Sci Comput 30(5):2512–2534

    Article  MathSciNet  Google Scholar 

  23. Lancaster P, Salkauskas K (1981) Surfaces generated by moving least squares methods. Math Comput 37(155):141–158

    Article  MathSciNet  Google Scholar 

  24. Laurent C, Mary I, Gleize V, Lerat A, Arnal D (2012) DNS database of a transitional separation bubble on a flat plate and application to RANS modeling validation. Comput Fluids 61:21–30

    Article  Google Scholar 

  25. Manoha E, Bulté J, Caruelle B (2008) LAGOON: an experimental database for the validation of CFD/CAA methods for landing gear noise prediction. In: 14th AIAA/CEAS aeroacoustics conference, AIAA paper 2008-2816

  26. Mary I, Sagaut P (2002) Large Eddy simulation of flow around an airfoil near stall. AIAA J 40(6):1139–1145

    Article  Google Scholar 

  27. Meakin RL (2001) Object X-rays for cutting holes in composite overset structured grids. AIAA paper 2001-2537

  28. Mittal R, Dong H, Bozkurttas M, Najjar FM, Vargas A, von Loebbecke A (2008) A versatile sharp interface immersed boundary method for incompressible flows with complex boundaries. J Comput Phys 227(10):4825–4852

    Article  MathSciNet  Google Scholar 

  29. Mittal R, Iaccarino G (2005) Immersed boundary methods. Annu Rev Fluid Mech 37:239–261

    Article  MathSciNet  Google Scholar 

  30. Mochel L, Weiss P-E, Deck S (2014) Zonal immersed boundary conditions: application to a high-Reynolds-number afterbody flow. AIAA J 52(12):2782–2794

    Article  Google Scholar 

  31. Musker AJ (1979) Explicit expression for the smooth wall velocity distribution in a turbulent boundary layer. AIAA J 17(6):655–657

    Article  Google Scholar 

  32. Nakahashi K (2011) Immersed boundary method for compressible Euler equations in the Building-Cube Method. AIAA paper 2011-3386

  33. Péron S, Benoit C (2013) Automatic off-body overset adaptive Cartesian mesh method based on an octree approach. J Comput Phys 232(1):153–173

    Article  Google Scholar 

  34. Peskin CS (1972) Flow patterns around heart valves: a numerical method. J Comput Phys 10(2):252–271

    Article  MathSciNet  Google Scholar 

  35. Peskin CS (2002) The immersed boundary method. Acta Numer 11:479–517

    Article  MathSciNet  Google Scholar 

  36. Poinot M (2010) Five good reasons to use the hierarchical data format. Comput Sci Eng 12(5):84–90

    Article  Google Scholar 

  37. Beyer RP, LeVeque RJ (1992) Analysis of a one-dimensional model for the immersed boundary method. SIAM J Numer Anal 29(2):332–364

    Article  MathSciNet  Google Scholar 

  38. Renaud T, Benoit C, Péron S, Mary I, Alferez N (2019) Validation of an immersed boundary method for compressible flows. In: AIAA Scitech 2019 Forum, AIAA paper 2019–2179

  39. Rigby D L, Steinthorsson E, Coirier WJ (1997) Automatic block merging methodology using the method of weakest descent. AIAA paper 97-0197

  40. Roe PL (1981) Approximate Riemann solvers, parameter vectors, and difference schemes. J Comput Phys 43(2):357–372

    Article  MathSciNet  Google Scholar 

  41. Rumsey CL, Wedan B, Hauser T, Poinot M (2012) Recent updates to the CFD general notation system (CGNS). In: 50th AIAA aerospace sciences meeting, vol 10, p 6–2012

  42. Sethian JA (1999) Fast marching methods. SIAM Rev 41(2):199–235

    Article  MathSciNet  Google Scholar 

  43. Spalart PR, Allmaras SR (1992) A one-equation turbulence model for aerodynamic flows. AIAA J 94:20

    Google Scholar 

  44. Terracol M, Manoha E (2014) Wall-resolved large eddy simulation of a highlift airfoil: detailed flow analysis and noise generation study. In: 20th AIAA/CEAS aeroacoustics conference, AIAA paper 2014-3050

  45. Tseng Y-H, Ferziger JH (2003) A ghost-cell immersed boundary method for flow in complex geometry. J Comput Phys 192(2):593–623

    Article  MathSciNet  Google Scholar 

  46. Vreman AW (1995) Direct and large-eddy simulation of the compressible turbulent mixing layer. Universiteit Twente

  47. Zhu WJ, Behrens T, Shen WZ, Sørensen JN (2012) Hybrid immersed boundary method for airfoils with a trailing-edge flap. AIAA J 51(1):30–41

    Article  Google Scholar 

Download references

Acknowledgements

We thank Aurélia Cartieri from the Wind Tunnel Division at ONERA for providing us the mounted tripod configuration and her elsA results for comparisons. We are grateful to Nicolas Alferez for his involvement in improving the performances of FastS solver and also Marc Terracol for our fruitful exchanges concerning wall models and the LEISA2 configuration.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Péron.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Wall functions

Figure 18 shows a typical mean velocity profile in wall units \(u^+\) within the inner layer of a turbulent boundary layer. This velocity profile can be split into three portions within this inner layer:

  • The viscous sub-layer, for \(y^+ \le 5\), where dissipation and viscous diffusion dominate. This yields the linear behavior: \(u^+\)=\(y^+.\)

  • the log-layer, for \(y^+\)>30, where there is an equilibrium between turbulence production and dissipation. This region constitutes the junction between the inner and upper layers.

  • The buffer layer, for \(5 < y^{+} \le 30\), joining the two previously defined layers.

Fig. 18
figure 18

Asymptotic behaviors of an equilibrium boundary layer

The most common function to describe the evolution of the velocity within an equilibrium turbulent boundary layer (zero-pressure gradient) is the log law of the wall defined as:

$$\begin{aligned} \displaystyle u^{+}=\frac{1}{\kappa }\text {log}(y^{+})+\beta , \end{aligned}$$
(2)

where \(\displaystyle u^{+}=\frac{u}{u_{\tau }}\) and \(\displaystyle y^{+}=\frac{\rho _w~y~u_{\tau }}{\mu _w}\), with \(\kappa\) = 0.41 is the Vón Kármán constant and \(\beta =5.2\); \(u_{\tau }\) denotes the friction velocity; \(\rho _w\) and \(\mu _w\) denote the values of density and viscosity at the wall, assumed equal to their values at corresponding image points B.

However, the limitation of the log law is that it is not able to model the inner and buffer layers of the boundary layer, which is critical in our approach, since the dimensionless wall distance \(y^{+}\) cannot be controlled at image points. Several algebraic wall functions have been developed to bridge the viscous sub-layer and the log layer: we can cite the law derived by Spalding, by finding a power-series for \(y^+\) = \(f(u^+)\) or the one proposed by Musker [31], which is very similar (as shown in Fig. 18) but easier to use, since it explicitly provides an expression for the velocity for the point to be addressed. Similarly to the log law, it is based on considerations of the boundary-layer equations. By blending the log layer and the viscous sub-layer asymptotic trends of the turbulent viscosity through an interpolation function, integration of the momentum balance yields the following formula:

$$\begin{aligned} \displaystyle u^{+}&=5.424 \arctan \left[ \frac{2y^{+}-8.15}{16.7}\right] \\&\quad+\log ~\left[ \frac{ \left( y^{+}+10.6 \right) ^{9.6} }{\left( y^{+2}-8.15~y^{+}+86 \right) ^2} \right] -3.52. \end{aligned}$$
(3)

It must be noted that expressions (2) and (3) involve the skin friction velocity \(u_{\tau }\), which is unknown. The first step of the process is, therefore, to estimate its value using a Newton–Raphson iterative algorithm.

Determination of the pseudo-viscosity of Spalart–Allmaras at IB target point

In the Spalart–Allmaras model, the turbulent viscosity can be expressed as follows:

$$\begin{aligned} \mu _t = \rho \tilde{\nu } f_{v1}, \end{aligned}$$
(4)

where:

$$\begin{aligned} f_{v1} = \frac{\chi ^3}{\chi ^3 + C_{v1}^3}; \end{aligned}$$
(5)

\(C_{v1}\) is a constant and \(\displaystyle \chi = \frac{\rho \tilde{\nu }}{\mu }.\) Hence:

$$\begin{aligned} \nu _t = \tilde{\nu } f_{v1}. \end{aligned}$$
(6)

The mixing length assumption can be expressed by:

$$\begin{aligned} \nu _t = \kappa u_{\tau } y D, \end{aligned}$$
(7)

with the Van Driest damping term D, such that \(A^{+}\) being a constant, chosen equal to 19:

$$\begin{aligned} D = [1-exp(-\frac{y^{+}}{A^{+}})]^2. \end{aligned}$$
(8)

The pseudo-viscosity \(\tilde{\nu }\) must be reconstructed at IB target point A. The friction velocity \(u_{\tau }\) is known and has been computed by the algebraic wall function, and y and D are known and \(\kappa\) is the Von Kármán constant, equal to 0.4. We have to solve \(\tilde{\nu }\) solution of:

$$\begin{aligned} \tilde{\nu } f_{v1} = \kappa u_{\tau } y D; \end{aligned}$$
(9)

that is:

$$\begin{aligned} \tilde{\nu }^4 - \kappa u_{\tau } y D \tilde{\nu }^3 - \kappa u_{\tau } y D \frac{\mu ^3}{\rho ^3}C_{v1}^3 = 0. \end{aligned}$$
(10)

To avoid ill-conditioned problems, the variable that is actually solved is \(\displaystyle \frac{\tilde{\nu }}{\nu }\). This leads to solve:

$$\begin{aligned} x^4 - a x^3 - b = 0, \end{aligned}$$
(11)

with:

$$\begin{aligned} x = \frac{\tilde{\nu }}{\nu }; a = \frac{\kappa u_{\tau } y D}{\nu }; b = \frac{\kappa u_{\tau } y D}{\nu } C_{v1}^3 = a C_{v1}^3. \end{aligned}$$
(12)

It is possible to solve this equation explicitly. The following variable change \(y=x-\frac{a}{4}\) is performed to remove the monomial of degree 3, leading to an equation of the form \(y^4+py^2+qy+r=0\), which is solved by Ferrari’s method. Note that if Eq. (11) was obtained from variable \(x=\tilde{\nu }\), q would be very close to zero. Or if it is zero, the equation to be solved would be of the form \(y^4+py^2+r=0\), with different solution from the quartic equation above.

Ferrari’s method consists in finding a factorization of two polynomials of degree 2. The main difficulty lies in the fact that four solutions of this equation are possible, and thus, the wrong candidates (especially the complex ones) shall be removed smartly. The monomial of degree 4 is first replaced by the polynomial \((y^2+\lambda ^2)^2-2\lambda ~y^2-\lambda ^2\). This leads to the resolution of a cubic on \(\lambda\), and then, the solution \(\lambda _0\) is replaced in the quartic on y. This results in a factorization of two polynomials of degree 2. The roots are explicitly obtained, and then, x is derived.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Péron, S., Benoit, C., Renaud, T. et al. An immersed boundary method on Cartesian adaptive grids for the simulation of compressible flows around arbitrary geometries. Engineering with Computers 37, 2419–2437 (2021). https://doi.org/10.1007/s00366-020-00950-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-020-00950-y

Keywords

Navigation