Please use this identifier to cite or link to this item:
|Title:||Aerodynamic shape optimization on overset grids using the adjoint method||Authors:||Liao, W.
Implicit hole cutting
|Issue Date:||Apr-2010||Citation:||Liao, W., Tsai, H.M. (2010-04). Aerodynamic shape optimization on overset grids using the adjoint method. International Journal for Numerical Methods in Fluids 62 (12) : 1332-1356. ScholarBank@NUS Repository. https://doi.org/10.1002/fld.2070||Abstract:||This paper deals with the use of the continuous adjoint equation for aerodynamic shape optimization of complex configurations with overset grids methods. While the use of overset grid eases the grid generation process, the non-trivial task of ensuring communication between overlapping grids needs careful attention. This need is effectively addressed by using a practically useful technique known as the implicit hole cutting (IHC) method. The method depends on a simple cell selection process based on the criterion of cell size, and all grid points including interior points and fringe points are treated indiscriminately in the computation of the flow field. This paper demonstrates the simplicity of the IHC method for the adjoint equation. Similar to the flow solver, the adjoint equations are solved on conventional point-matched and overlapped grids within a multi-block framework. Parallel computing with message passing interface is also used to improve the overall efficiency of the optimization process. The method is successfully demonstrated in several two-and a three-dimensional shape optimization cases for both external and internal flow problems. Copyright © 2009 John Wiley & Sons, Ltd.||Source Title:||International Journal for Numerical Methods in Fluids||URI:||http://scholarbank.nus.edu.sg/handle/10635/114990||ISSN:||02712091||DOI:||10.1002/fld.2070|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 22, 2019
WEB OF SCIENCETM
checked on Aug 13, 2019
checked on Aug 16, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.