Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.cma.2006.09.012
Title: A multigrid overset grid flow solver with implicit hole cutting method
Authors: Liao, W. 
Cai, J. 
Tsai, H.M. 
Keywords: Aerodynamics
Implicit hole cutting
Multigrid
Overset grid
Parallel computing
Issue Date: 1-Feb-2007
Citation: Liao, W., Cai, J., Tsai, H.M. (2007-02-01). A multigrid overset grid flow solver with implicit hole cutting method. Computer Methods in Applied Mechanics and Engineering 196 (9-12) : 1701-1715. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cma.2006.09.012
Abstract: In the computation of flow over complex configurations, the use of overset grids eases the grid generation process, but the non-trivial task of ensuring communication between the overlapping grids must first be established. This need is efficiently addressed by using a new practically useful implicit hole cutting (IHC) method introduced by Lee and Baeder. This approach is a cell selection process based on the main criterion of cell size, and all grid points including hole interior points and hole fringe points are treated indiscriminately in the flow computation. Potentially these features ease the implementation of the multigrid algorithms which are rarely used in overset methods. The present study addresses the use of IHC method as an inter-grid communication method within a hybrid multi-block framework amenable for the implementation of a multigrid method and parallel computation. The convergence, accuracy and efficiency of the current solver are assessed particularly for the large-scale computations of realistic aerodynamic configurations. © 2006 Elsevier B.V. All rights reserved.
Source Title: Computer Methods in Applied Mechanics and Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/111312
ISSN: 00457825
DOI: 10.1016/j.cma.2006.09.012
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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