Volume 46 Issue 2
Feb.  2020
Turn off MathJax
Article Contents
XUAN Chuanwei, HAN Jinglong. Enhancement of implicit assembly strategy in overlapping grids[J]. Journal of Beijing University of Aeronautics and Astronautics, 2020, 46(2): 350-358. doi: 10.13700/j.bh.1001-5965.2019.0260(in Chinese)
Citation: XUAN Chuanwei, HAN Jinglong. Enhancement of implicit assembly strategy in overlapping grids[J]. Journal of Beijing University of Aeronautics and Astronautics, 2020, 46(2): 350-358. doi: 10.13700/j.bh.1001-5965.2019.0260(in Chinese)

Enhancement of implicit assembly strategy in overlapping grids

doi: 10.13700/j.bh.1001-5965.2019.0260
Funds:

National Natural Science Foundation of China 11472133

Priority Academic Program Development of Jiangsu Higher Eduction Institutions 

More Information
  • Corresponding author: HAN Jinglong, E-mail: hjlae@nuaa.edu.cn
  • Received Date: 28 May 2019
  • Accepted Date: 19 Jul 2019
  • Publish Date: 20 Feb 2020
  • As an important part of the overlapping grid technology, the implicit grid assembly has no explicit "hole-cutting" process, and it is only necessary to classify cells by comparing their qualities while searching for donor cells. By improving the traditional implicit assembly process, a more efficient implicit assembly strategy is developed to alleviate the effort of searching for donorcells. At the same time, a local donorcell search method based on Cartesian grid mapping is developed to improve grid assembly efficiency. First, for each sub-grid, the shortest distances to all other wall surfaces are calculated while calculating the shortest distance to its own wall surface.Then, the position of hole boundary is controlled by comparing the shortest distances of the same cell to different wall surfaces. Finally, only partial donorcell search is performed on interpolation cells, which avoids the process of global donor cell search for all cells. The accuracy and efficiency of the developed strategy are verified by three typical complex flow examples.

     

  • loading
  • [1]
    BENEK J A, STEGER J L, DOUGHERTY F C.A flexible grid embedding technique with applications to the Euler equations: AIAA-83-1944[R].Reston: AIAA, 1983.
    [2]
    NAKAHASHI K, GUMIYA T.An intergrid boundary definition method for overset unstructured grid approach: AIAA-99-3304[R].Reston: AIAA, 1999.
    [3]
    CHO K W, KWON J H, SEUNGSOO L.Development of a fully systemized chimera methodology for steady/unsteady problems[J].Journal of Aircraft, 1999, 36(6):973-980. doi: 10.2514/2.2538
    [4]
    CHIU I T, MEAKIN R.On automating domain connectivity for overset grids: AIAA-1995-0854[R].Reston: AIAA, 1995.
    [5]
    CRABILL J A, WITHERDEN F D, JAMESON A.A parallel direct cut algorithm for high-order overset methods with application to a spinning golf ball[J].Journal of Computational Physics, 2018, 374(1):692-723. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=07e556f6a901a309f161734398f891dd
    [6]
    WEY T C.Development of a mesh interface generator for overlapped structured grids: AIAA-1994-1924[R].Reston: AIAA, 1994.
    [7]
    TOGASHI F, NAKAHASHI K, ITO Y.Flow simulation of NAL experimental supersonic airplane/booster separation using overset unstructured grids[J].Computers & Fluids, 2001, 30(6):673-688. http://cn.bing.com/academic/profile?id=2f0a4bfdea5952ede10dbd381c33a3ae&encoded=0&v=paper_preview&mkt=zh-cn
    [8]
    TOGASHI F, ITO Y, MURAYAMA M.Flow simulation of flapping wings of an insect using overset unstructured grid: AIAA-2001-2619[R].Reston: AIAA, 2001.
    [9]
    TOGASHI F, ITO Y.Extensions of overset unstructured grids to multiple bodies in contact: AIAA-2002-2809[R].Reston: AIAA, 2002.
    [10]
    TOGASHI F, ITO Y.Overset unstructured grids method for viscous flow computations: AIAA-2003-3405[R].Reston: AIAA, 2003.
    [11]
    徐汝锋, 陈志同, 陈五一.计算点到曲面最短距离的网格法[J].计算机集成制造系统, 2011, 17(1):95-100. http://d.old.wanfangdata.com.cn/Periodical/jsjjczzxt201101014

    XU R F, CHEN Z T, CHEN W Y.Grid algorithm for calculating the shortest distance from spatial point to free-form surface[J].Computer Integrated Manufacturing Systems, 2011, 17(1):95-100(in Chinese). http://d.old.wanfangdata.com.cn/Periodical/jsjjczzxt201101014
    [12]
    陈丽萍, 陈燕, 胡德金.一种快速完备的自由曲线和曲面间最短距离求取算法[J].上海交通大学学报, 2003, 37(Suppl 2):41-44. http://d.old.wanfangdata.com.cn/Periodical/shjtdxxb2003z1009

    CHEN L P, CHEN Y, HU D J.A high-efficiency algorithm to calculate the shortest distance between free-form curve and free-form surface[J].Journal of Shanghai Jiaotong University, 2003, 37(Suppl 2):41-44(in Chinese). http://d.old.wanfangdata.com.cn/Periodical/shjtdxxb2003z1009
    [13]
    BOGER D A.Efficient method for calculating wall proximity[J].AIAA Journal, 2001, 39(12):2404-2406. doi: 10.2514/2.1251
    [14]
    郭中州, 何志强, 夏陈超.高效计算网格壁面距离的KD树方法[J].国防科技大学学报, 2017, 39(4):21-25. http://d.old.wanfangdata.com.cn/Periodical/gfkjdxxb201704004

    GUO Z Z, HE Z Q, XIA C C.KD tree method for efficient wall distance computation of mesh[J].Journal of National University of Defense Technology, 2017, 39(4):21-25(in Chinese). http://d.old.wanfangdata.com.cn/Periodical/gfkjdxxb201704004
    [15]
    TUCKER P G, RUMSEY C L, SPALART P R.Computations of wall distances based on differential equations[J].AIAA Journal, 2005, 43(3):539-549. doi: 10.2514/1.8626
    [16]
    XU J L, YAN C, FAN J J.Computations of wall distances by solving a transport equation[J].Applied Mathematics and Mechanics, 2011, 32(2):135-143. http://d.old.wanfangdata.com.cn/Periodical/yysxhlx201102002
    [17]
    王刚, 曾铮, 叶正寅.混合非结构网格下壁面最短距离的快速计算方法[J].西北工业大学学报, 2014, 32(4):511-516. doi: 10.3969/j.issn.1000-2758.2014.04.007

    WANG G, ZENG Z, YE Z Y.An efficient search algorithm for calculating minimum wall distance of unstructured mesh[J].Journal of Northwestern Polytechnical University, 2014, 32(4):511-516(in Chinese). doi: 10.3969/j.issn.1000-2758.2014.04.007
    [18]
    XIAO T, QIN N, LUO D.Deformable overset grid for multibody unsteady flow simulation[J].AIAA Journal, 2016, 54(8):2392-2406. doi: 10.2514/1.J054861
    [19]
    XU X, WANG X D, ZHANG M.A parallelized hybrid N-S/DSMC-IP approach based on adaptive structured/unstructured overlapping grids for hypersonic transitional flows[J].Journal of Computational Physics, 2018, 371(15):409-433. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=1b9221ba7402ff0dd9f9bb4824ca049c
    [20]
    MISHRA A, BAEDER J D.Coupled aeroelastic prediction of the effects of leading-edge slat on rotor performance[J].Journal of Aircraft, 2012, 53(1):1-17. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=b5217116c6b8d10419560f62f0b8d0f6
    [21]
    LEE Y, BAEDER J.High-order overset method for blade vortex interaction: AIAA-2002-0559[R].Reston: AIAA, 2002.
    [22]
    LOHNER R, SHAROV D, LUO H.Overlapping unstructured grids: AIAA-2001-0439[R].Reston: AIAA, 2001.
    [23]
    LUO H.An overlapping unstructured grid method for viscous flows: AIAA-2001-2603[R].Reston: AIAA, 2001.
    [24]
    LANDMANN B, MONTAGNAC M.A highly automated parallel Chimera method for overset grids based on the implicit hole cutting technique[J].International Journal for Numerical Methods in Fluids, 2011, 66(6):778-804. doi: 10.1002/fld.2292
    [25]
    XU J, CAI J, LIU Q.Flow simulations by enhanced implicit-hole-cutting method on overset grids[J].Journal of Aircraft, 2014, 51(5):1401-1409. doi: 10.2514/1.C032283
    [26]
    田书玲.基于非结构网格方法的重叠网格算法研究[D].南京: 南京航空航天大学, 2008.

    TIAN S L.Investigation of overset unstructured grids algorithm[D].Nanjing: Nanjing University of Aeronautics and Astronautics, 2008(in Chinese).
    [27]
    BONET J, PERAIRE J.An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems[J].International Journal for Numerical Methods in Engineering, 1991, 31(1):1-17. doi: 10.1002-nme.1620310102/
    [28]
    BROWN R A.Building a balanced k-d tree in O(nlogn) time[J].Journal of Computer Graphics Techniques, 2015, 4(1):50-68.
    [29]
    MARSTIN C W, MCCONNAUGHEY H V.Computational problems on composite grids: AIAA-1984-1611[R].Reston: AIAA, 1984.
    [30]
    张来平, 邓小刚, 张涵信.动网格生成技术及非定常计算方法进展综述[J].力学进展, 2010, 40(4):424-447. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=lxjz201004004

    ZHANG L P, DENG X G, ZHANG H X.Reviews of moving grid generation techniques and numerical methods for unsteady flows[J].Advances in Mechanics, 2010, 40(4):424-447(in Chinese). http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=lxjz201004004
    [31]
    李鹏, 高振勋, 蒋崇文.重叠网格装配中的一种改进ADT搜索方法[J].北京航空航天大学学报, 2017, 43(6):1182-1190. doi: 10.13700/j.bh.1001-5965.2016.0425

    LI P, GAO Z X, JIANG C W.Improved ADT searching method in overlapping grid assembly[J].Journal of Beijing University of Aeronautics and Astronautics, 2017, 43(6):1182-1190(in Chinese). doi: 10.13700/j.bh.1001-5965.2016.0425
    [32]
    CHIN V D, PETER D W, SPAID F W.Flow field measurements about a multi-element airfoil at high Reynolds numbers: AIAA-1993-3137[R].Reston: AIAA, 1993.
    [33]
    BIEDRON S, JOHNSON C T, WANG L V.Simulations using a concurrent implicit Navier-Stokes solver: AIAA-1995-223[R].Reston: AIAA, 1995.
    [34]
    ELIAS E, SPYRIDON D.CFD transonic store separation trajectory predictions with comparison to wind tunnel investigations[J].International Journal of Engineering, 2010, 3(6):538-553. http://d.old.wanfangdata.com.cn/OAPaper/oai_doaj-articles_acbac54646bfc85f7fe2fc05de3c53ad
    [35]
    江维青, 杨爱明.重叠网格隐式挖洞方法的改进与应用[J].复旦学报(自然科学版), 2018, 57(5):50-65. http://d.old.wanfangdata.com.cn/Periodical/fdxb201805005

    JIANG W Q, YANG A M.Enhancement and application of implicit hole cutting method for overset grids[J].Journal of Fudan University(Natural Science), 2018, 57(5):50-65(in Chinese). http://d.old.wanfangdata.com.cn/Periodical/fdxb201805005
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(18)  / Tables(1)

    Article Metrics

    Article views(765) PDF downloads(88) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return