scholarly journals An Immersed Boundary Geometric Preprocessor for Arbitrarily Complex Terrain and Geometry

2015 ◽  
Vol 32 (11) ◽  
pp. 2075-2087 ◽  
Author(s):  
Inanc Senocak ◽  
Micah Sandusky ◽  
Rey DeLeon ◽  
Derek Wade ◽  
Kyle Felzien ◽  
...  

AbstractThere is a growing interest to apply the immersed boundary method to compute wind fields over arbitrarily complex terrain. The computer implementation of an immersed boundary module into an existing flow solver can be accomplished with minor modifications to the rest of the computer program. However, a versatile preprocessor is needed at the first place to extract the essential geometric information pertinent to the immersion of an arbitrarily complex terrain inside a 3D Cartesian mesh. Errors in the geometric information can negatively impact the correct implementation of the immersed boundary method as part of the solution algorithm. Additionally, the distance field from the terrain is needed to implement various subgrid-scale turbulence models and to initialize wind fields over complex terrain. Despite the popularity of the immersed boundary method, procedures used in the geometric preprocessing stage have received less attention. The present study found that concave and convex regions of complex terrain are particularly challenging to process with existing procedures discussed in the literature. To address this issue, a geometric preprocessor with a distance field solver was presented, and the solver demonstrated its versatility for arbitrarily complex geometry, terrain, and urban environments. The distance field solver uses the initial distance field at the immersed boundaries and propagates it to the rest of the domain by solving the Eikonal equation with the fast sweeping method.

Author(s):  
Inanc Senocak ◽  
Micah Sandusky ◽  
Rey DeLeon ◽  
Derek Wade

Computer implementation of an immersed boundary (IB) module inside a flow solver can be accomplished non-intrusively. However a versatile preprocessor is needed at the first place to extract the geometric information pertinent to the immersion of an arbitrarily complex geometry inside a Cartesian mesh. Geometric errors can negatively impact the correct implementation of the IB method as part of the solution algorithm. Additionally, the distance field from the geometry is needed to implement various turbulence models or flow initialization. Geometric processing stage for complex geometry have received less attention despite the popularity of the IB method. Our experience has shown that some of the procedures described in the literature have difficulties processing highly complex geometry or can be inflexible to implement reconstruction schemes for turbulent flows. To address these issues, we present a geometric preprocessor with a distance field solver. We constructed our procedure from computational geometry algorithms such as point-in-triangle and point-in-edge. The distance field solver uses the initial distance field at the immersed boundaries and propagates it to the rest of the domain by solving the Eikonal equation with the fast sweeping method. We demonstrate the versatility of our preprocessor for challenging test geometries from the computer graphics field, complex terrain and urban environments.


2012 ◽  
Vol 140 (5) ◽  
pp. 1603-1619 ◽  
Author(s):  
Yu-Chieng Liou ◽  
Shao-Fan Chang ◽  
Juanzhen Sun

This study develops an extension of a variational-based multiple-Doppler radar synthesis method to construct the three-dimensional wind field over complex topography. The immersed boundary method (IBM) is implemented to take into account the influence imposed by a nonflat surface. The IBM has the merit of providing realistic topographic forcing without the need to change the Cartesian grid configuration into a terrain-following coordinate system. Both Dirichlet and Neumann boundary conditions for the wind fields can be incorporated. The wind fields above the terrain are obtained by variationally adjusting the solutions to satisfy a series of weak constraints, which include the multiple-radar radial velocity observations, anelastic continuity equation, vertical vorticity equation, background wind, and spatial smoothness terms. Experiments using model-simulated data reveal that the flow structures over complex orography can be successfully retrieved using radial velocity measurements from multiple Doppler radars. The primary advantages of the original synthesis method are still maintained, that is, the winds along and near the radar baseline are well retrieved, and the resulting three-dimensional flow fields can be used directly for vorticity budget diagnosis. If compared with the traditional wind synthesis algorithm, this method is able to merge data from different sources, and utilize data from any number of radars. This provides more flexibility in designing various scanning strategies, so that the atmosphere may be probed more efficiently using a multiple-radar network. This method is also tested using the radar data collected during the Southwest Monsoon Experiment (SoWMEX), which was conducted in Taiwan from May to June 2008 with reasonable results being obtained.


Author(s):  
Mayank Tyagi ◽  
Sumanta Acharya

A solution methodology for complex turbulent flows of industrial interests is developed using Immersed Boundary Method (IBM). IBM combines the efficiency inherent in using a fixed Cartesian grid to compute the fluid motion, along with the ease of tracking the immersed boundary at a set of moving Lagrangian points. IBM relies upon the body force terms added in the momentum equations to represents the complex geometry on a fixed Cartesian mesh. Resolution issues for turbulent flows can be addressed by Large Eddy Simulation (LES) technique provided an accurate and robust Subgrid Stress (SGS) model is available. Higher order of numerical accuracy schemes for turbulent flows can be maintained as well as the geometrical complexities can be rendered physically by combining LES with IBM. The proposed methodology is simple and ideally suited for the moving geometries involving no-slip walls with prescribed trajectories and locations. IBM is validated for the laminar flow past a heated cylinder in a channel and LES is validated for the turbulent lid-driven cavity flow. LES-IBM is then is used to render complex geometry of trapped vortex combustor to study fluid mixing inside trapped vortex cavity. To demonstrate the full potential of LES-IBM, a complex moving geometry problem of stator-rotor interaction is solved.


2011 ◽  
Vol 134 (1) ◽  
Author(s):  
S. Jafari ◽  
N. Chokani ◽  
R. S. Abhari

The accurate modeling of the wind resource over complex terrain is required to optimize the micrositing of wind turbines. In this paper, an immersed boundary method that is used in connection with the Reynolds-averaged Navier–Stokes equations with k-ω turbulence model in order to efficiently simulate the wind flow over complex terrain is presented. With the immersed boundary method, only one Cartesian grid is required to simulate the wind flow for all wind directions, with only the rotation of the digital elevation map. Thus, the lengthy procedure of generating multiple grids for conventional rectangular domain is avoided. Wall functions are employed with the immersed boundary method in order to relax the stringent near-wall grid resolution requirements as well as to allow the effects of surface roughness to be accounted for. The immersed boundary method is applied to the complex terrain test case of Bolund Hill. The simulation results of wind speed and turbulent kinetic energy show good agreement with experiments for heights greater than 5 m above ground level.


2018 ◽  
Vol 141 (6) ◽  
Author(s):  
Chenguang Zhang ◽  
Chunliang Wu ◽  
Krishnaswamy Nandakumar

We present three algorithms for robust and efficient geometric calculations in the context of immersed boundary method (IBM), including classification of mesh cells as inside/outside of a closed surface, projection of points onto a surface, and accurate calculation of the solid volume fraction field created by a closed surface overlapping with a background Cartesian mesh. The algorithms use the signed distance field (SDF) to represent the surface and remove the intersection tests, which are usually required by other algorithms developed before, no matter the surface is described in analytic or discrete form. The errors of the algorithms are analyzed. We also develop an approximate method on efficient SDF field calculation for complex geometries. We demonstrate how the algorithms can be implemented within the framework of IBM with a volume-average discrete-forcing scheme and applied to simulate fluid–structure interaction problems.


Sign in / Sign up

Export Citation Format

Share Document