z-logo
Premium
Two‐dimensional compact finite difference immersed boundary method
Author(s) -
Ferreira de Sousa Paulo J. S. A.,
Pereira José C. F.,
Allen James J.
Publication year - 2011
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.2199
Subject(s) - immersed boundary method , discretization , compact finite difference , computational fluid dynamics , interpolation (computer graphics) , boundary (topology) , solver , grid , convergence (economics) , regular grid , mathematics , cartesian coordinate system , boundary value problem , navier–stokes equations , finite difference , mathematical analysis , compressibility , geometry , mathematical optimization , mechanics , physics , classical mechanics , motion (physics) , economics , economic growth
We present a compact finite differences method for the calculation of two‐dimensional viscous flows in biological fluid dynamics applications. This is achieved by using body‐forces that allow for the imposition of boundary conditions in an immersed moving boundary that does not coincide with the computational grid. The unsteady, incompressible Navier–Stokes equations are solved in a Cartesian staggered grid with fourth‐order Runge–Kutta temporal discretization and fourth‐order compact schemes for spatial discretization, used to achieve highly accurate calculations. Special attention is given to the interpolation schemes on the boundary of the immersed body. The accuracy of the immersed boundary solver is verified through grid convergence studies. Validation of the method is done by comparison with reference experimental results. In order to demonstrate the application of the method, 2D small insect hovering flight is calculated and compared with available experimental and computational results. Copyright © 2009 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here