An arbitrary Lagrangian-Eulerian gradient smoothing method (GSM/ALE) for interaction of fluid and a moving rigid body

被引:30
作者
Wang, S. [1 ,2 ]
Khoo, B. C. [2 ]
Liu, G. R. [3 ]
Xu, G. X. [4 ]
机构
[1] Natl Univ Singapore, Dept Mech Engn, Ctr Adv Computat Engn Sci ACES, Singapore 119260, Singapore
[2] Natl Univ Singapore, Dept Mech Engn, Singapore 119260, Singapore
[3] Univ Cincinnati, Cincinnati, OH 45221 USA
[4] Parsons Brinckerhoff Pte Ltd, Singapore 199555, Singapore
关键词
Gradient smoothing; Strong form; Arbitrary Lagrangian-Eulerian; Fluid-rigid body interaction; Numerical method; Computational fluid dynamics; IMMERSED-BOUNDARY METHOD; GENERAL HYBRID MESHES; NUMERICAL-SIMULATION; INCOMPRESSIBLE-FLOW; DIFFERENCE-SCHEMES; CIRCULAR-CYLINDER; EQUATIONS;
D O I
10.1016/j.compfluid.2012.10.028
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The gradient smoothing method (GSM) was recently proposed for fluid dynamic problems governed by the Navier-Stokes equations, using unstructured triangular cells. This work extends the GSM to solve the fluid-rigid body interaction problems, by combining the GSM with the arbitrary Lagrangian-Eulerian (ALE) method to handle moving solid in fluids. A moving mesh source term derived directly from the geometric conservation law is incorporated into the discrete equations to ensure the recovery of uniform flow while the mesh is moving. The artificial compressibility formulation is utilized with a dual time stepping approach for accurate time integration. The gradient smoothing operation is utilized based on carefully designed node/mid-point associated gradient smoothing domains for the 1st-/2nd-order spatial approximations of the field variables at the nodes. To ensure the spatial stability, the 2nd-order Roe flux differencing splitting unwinding scheme is adopted to deal with the convective flux. Convergence, accuracy and robustness of the proposed method, i.e. GSM/ALE, are examined through a series of benchmark tests. Numerical results show that the proposed method can preserve the 2nd-order spatial/temporal accuracies, and produce reliable results even on extremely distorted mesh. Good agreement of calculated results with the reference ones in several examples indicates the robustness of the proposed method for solving fluid-rigid body interaction problems. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:327 / 347
页数:21
相关论文
共 41 条
[1]   Strongly coupled flow/structure interactions with a geometrically conservative ALE scheme on general hybrid meshes [J].
Ahn, Hyung Taek ;
Kallinderis, Yannis .
JOURNAL OF COMPUTATIONAL PHYSICS, 2006, 219 (02) :671-696
[2]   Moving boundary simulations with dynamic mesh smoothing [J].
Ahn, Hyung Taek ;
Branets, Larisa ;
Carey, Graham F. .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 2010, 64 (08) :887-907
[3]   Implicit/multigrid algorithms for incompressible turbulent flows on unstructured grids [J].
Anderson, WK ;
Rausch, RD ;
Bonhaus, DL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1996, 128 (02) :391-408
[4]   Computation of unsteady flows with moving boundaries using body fitted curvilinear moving grids [J].
Anwer, Syed Fahad ;
Hasan, Nadeem ;
Sanghi, Sanjeev ;
Mukherjee, S. .
COMPUTERS & STRUCTURES, 2009, 87 (11-12) :691-700
[5]  
Belov A., 1995, AIAA J, V95
[6]   A Cartesian grid method for solving the two-dimensional streamfunction-vorticity equations in irregular regions [J].
Calhoun, D .
JOURNAL OF COMPUTATIONAL PHYSICS, 2002, 176 (02) :231-275
[7]  
Chen JS, 2001, INT J NUMER METH ENG, V50, P435, DOI 10.1002/1097-0207(20010120)50:2<435::AID-NME32>3.0.CO
[8]  
2-A
[9]   A numerical method for solving incompressible viscous flow problems (Reprinted from the Journal of Computational Physics, vol 2, pg 12-26, 1997) [J].
Chorin, AJ .
JOURNAL OF COMPUTATIONAL PHYSICS, 1997, 135 (02) :118-125
[10]   Numerical Simulation of Compressible Vortical Flows Using a Conservative Unstructured-Grid Adaptive Scheme [J].
Forestieri, Giuseppe ;
Guardone, Alberto ;
Isola, Dario ;
Marulli, Filippo ;
Quaranta, Giuseppe .
COMMUNICATIONS IN COMPUTATIONAL PHYSICS, 2012, 12 (03) :866-884