Please use this identifier to cite or link to this item:
Title: Aeroelastic simulations using gridless boundary condition and small perturbation techniques
Authors: Lai, K.L. 
Carolina, L. 
Tsai, H.M. 
Keywords: Aeroelastic
Cartesian grid
Small perturbation
Issue Date: May-2010
Citation: Lai, K.L., Carolina, L., Tsai, H.M. (2010-05). Aeroelastic simulations using gridless boundary condition and small perturbation techniques. Computers and Fluids 39 (5) : 829-844. ScholarBank@NUS Repository.
Abstract: This paper examines the use of stationary Cartesian mesh for non-linear flutter computations involving complex geometries. The surface boundary conditions are implemented using reflected points which are determined via a gridless approach. The method uses a cloud of nodes in the vicinity of the surface to get a weighted-average of the flow properties using radial basis functions. To ensure computational efficiency and for local grid refinements, multigrid computations within an embedded grids framework are used. As the displacements of moving surfaces from their original position are typically small for flutter problems, a small perturbation boundary condition method is used to account for the moving surfaces. The method therefore does not require repeated grid re-generation for the deforming surfaces. The overall method is both accurate and robust. Computations of the well-known Onera M6 wing, RAE wing-body configuration, the AGARD 445.6 wing flutter test case show good accuracy and efficiencies. Simulations of the aeroelastic behavior of a complete fighter-type aircraft with wing tip missiles at high transonic speeds further demonstrate the practical usefulness of the present boundary conditions technique. © 2010 Elsevier Ltd. All rights reserved.
Source Title: Computers and Fluids
ISSN: 00457930
DOI: 10.1016/j.compfluid.2009.12.011
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.