本文選題：網(wǎng)格生成 + 數(shù)值模擬　； 參考：《浙江大學(xué)》2016年博士論文

【摘要】：總體上,當(dāng)前的高性能數(shù)值模擬軟件的并行能力遠(yuǎn)落后于硬件可提供的最大并行能力。制約數(shù)值模擬軟件并行能力提高的關(guān)鍵不僅在于求解器并行能力不足,更多情形下是由于數(shù)值模擬支撐軟件并行能力的滯后。現(xiàn)有的并行數(shù)值模擬軟件大都采用“串行網(wǎng)格生成+并行求解”的“準(zhǔn)并行”計(jì)算模式,在生成很多復(fù)雜問(wèn)題求解所需的大規(guī)模網(wǎng)格時(shí)存在嚴(yán)重的內(nèi)存和時(shí)間性能瓶頸。開(kāi)展并行網(wǎng)格生成方法研究,實(shí)現(xiàn)“并行網(wǎng)格生成+并行求解”的“全過(guò)程并行”計(jì)算模式,是提高數(shù)值模擬并行計(jì)算能力的關(guān)鍵所在。本文聚焦問(wèn)題并行類(lèi)并行非結(jié)構(gòu)網(wǎng)格生成方法,系統(tǒng)研究了與之相適應(yīng)的串行網(wǎng)格生成和區(qū)域分解方法,取得創(chuàng)新如下：(1)針對(duì)四面體網(wǎng)格局部編輯問(wèn)題,提出了基于小空腔重連技術(shù)的點(diǎn)刪除操作,利用小空腔重連技術(shù)的窮舉機(jī)制提高點(diǎn)刪除的成功率,繼而將點(diǎn)刪除操作應(yīng)用于Delaunay網(wǎng)格生成的約束邊界恢復(fù)算法中,顯著減少了復(fù)雜輸入情形下邊界恢復(fù)算法所需Steiner點(diǎn)的數(shù)目,提高了四面體網(wǎng)格生成的可靠性和單元質(zhì)量。(2)改進(jìn)了一類(lèi)基于表面網(wǎng)格遞歸分解的區(qū)域分解方法,提出一系列網(wǎng)格局部編輯操作以及它們的組合操作,有效解決了區(qū)域分解中間過(guò)程產(chǎn)生的子區(qū)域表面網(wǎng)格相交問(wèn)題,提高了該類(lèi)區(qū)域分解方法的計(jì)算效率和可靠性,繼而實(shí)現(xiàn)了一類(lèi)基于該區(qū)域分解方法的并行四面體網(wǎng)格生成算法。(3)提出一類(lèi)基于網(wǎng)格對(duì)偶圖的網(wǎng)格簡(jiǎn)化算法,可消除初始背景網(wǎng)格包含的不理想形狀特征。繼而提出一類(lèi)以簡(jiǎn)化后網(wǎng)格為輸入、基于圖分解算法的新區(qū)域分解方法,基于它分解得到的子區(qū)域結(jié)構(gòu)除滿(mǎn)足負(fù)載平衡和通信最小化等目標(biāo)外,且子區(qū)域邊界的形狀質(zhì)量較高,減少了子區(qū)域邊界對(duì)并行網(wǎng)格生成或優(yōu)化算法所形成的單元質(zhì)量的影響。基于該區(qū)域分解方法,實(shí)現(xiàn)了完全解耦的并行曲面網(wǎng)格生成、并行四面體網(wǎng)格生成及并行四面體網(wǎng)格優(yōu)化算法。最終,針對(duì)不同問(wèn)題需求,集成上述創(chuàng)新成果,開(kāi)發(fā)了兩類(lèi)全過(guò)程并行非結(jié)構(gòu)網(wǎng)格生成軟件。以諸如飛行器整機(jī)外形這類(lèi)復(fù)雜模型的CAD文件為輸入,利用256個(gè)核在不到7分鐘時(shí)間內(nèi)實(shí)現(xiàn)了包含十億實(shí)體單元的大規(guī)模計(jì)算網(wǎng)格的全自動(dòng)、全過(guò)程并行生成。目前,上述并行軟件已和自研的并行空氣動(dòng)力學(xué)數(shù)值模擬軟件實(shí)現(xiàn)了無(wú)縫集成,針對(duì)典型空氣動(dòng)力學(xué)計(jì)算問(wèn)題實(shí)現(xiàn)了“并行網(wǎng)格生成+并行求解”的“全過(guò)程并行”計(jì)算模式,解決了這些問(wèn)題精細(xì)分析所面臨的大規(guī)模計(jì)算網(wǎng)格生成難題。
[Abstract]:In general, the parallel capability of the current high performance numerical simulation software lags far behind the maximum parallel capability that hardware can provide. The key to the improvement of parallel capability of numerical simulation software is not only the lack of parallel ability of solver, but also the lag of parallel ability of numerical simulation software in many cases. Most of the existing parallel numerical simulation software use "serial grid generation parallel solution" quasi-parallel "computing model, there are serious memory and time performance bottlenecks in generating large scale grid for solving many complex problems. It is the key to improve the parallel computing ability of numerical simulation to carry out the research on parallel grid generation method and to realize the "whole process parallel" computing model of "parallel grid generation and parallel solution". In this paper, the parallel class parallel unstructured mesh generation method for focusing problem is discussed. The corresponding serial mesh generation and domain decomposition methods are systematically studied. The innovations are as follows: 1) for the local editing problem of tetrahedron mesh, The point deletion operation based on the small cavity reconnection technique is proposed. The exhaustive mechanism of the small cavity reconnection technique is used to improve the success rate of point deletion, and then the point deletion operation is applied to the constrained boundary restoration algorithm of Delaunay mesh generation. The number of Steiner points required for the boundary restoration algorithm in complex input cases is significantly reduced, and the reliability and cell quality of tetrahedron mesh generation are improved. The domain decomposition method based on recursive decomposition of surface mesh is improved. A series of local grid editing operations and their combination operations are proposed, which can effectively solve the problem of the intersecting of subregion surface meshes generated by the intermediate process of domain decomposition, and improve the computational efficiency and reliability of this kind of domain decomposition methods. Then a class of parallel tetrahedron mesh generation algorithm based on the domain decomposition method is implemented. A mesh simplification algorithm based on the grid-to-bipartite graph is proposed which can eliminate the undesired shape feature of the initial background mesh. Then, a new domain decomposition method based on graph decomposition algorithm and simplified grid as input is proposed. The subregion structure based on it not only satisfies the objectives of load balancing and communication minimization, but also has high shape quality of sub-region boundary. The effect of sub-region boundary on the cell quality of parallel mesh generation or optimization algorithm is reduced. Based on the domain decomposition method, the fully decoupled parallel surface mesh generation, the parallel tetrahedron mesh generation and the parallel tetrahedron mesh optimization algorithm are implemented. Finally, two kinds of parallel unstructured grid generation software are developed to meet the needs of different problems and integrate the above innovative results. With the input of CAD files of complex models such as aircraft shape, 256 cores are used to realize the full automatic and parallel generation of large scale computing meshes containing 1 billion solid units in less than 7 minutes. At present, the above parallel software has been integrated seamlessly with the self-developed parallel aerodynamics numerical simulation software, and the "whole process parallel" computing mode of "parallel mesh generation and parallel solution" has been realized for typical aerodynamics computing problems. The problem of large scale mesh generation in fine analysis is solved.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：TP338.6

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 曾軍;器件模擬中網(wǎng)格的動(dòng)態(tài)生成與調(diào)整[J];電子科技大學(xué)學(xué)報(bào);1992年06期

2 劉勇奎,鄒善舉,米守防,李春時(shí);六角網(wǎng)格上的圓與橢圓生成算法[J];大連民族學(xué)院學(xué)報(bào);2002年01期

3 劉勇奎,石教英;六角網(wǎng)格上的圖形顯示[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2004年03期

4 裴蒸;利用網(wǎng)格直接求解幾何問(wèn)題的方法[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);1992年03期

5 雷曉松;透平葉柵網(wǎng)格的生成與繪制[J];鄂州大學(xué)學(xué)報(bào);1999年03期

6 孟敏;計(jì)忠平;劉利剛;;基于保特征調(diào)和場(chǎng)的交互式網(wǎng)格分片[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2008年09期

7 王梅珍;王府梅;王善元;;基于網(wǎng)格的織物虛擬場(chǎng)景真實(shí)感模擬及計(jì)算機(jī)實(shí)現(xiàn)[J];東華大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年06期

8 馮占榮;于建群;付宏;盧洪濤;;一種二維貼體網(wǎng)格改進(jìn)算法的研究[J];西安交通大學(xué)學(xué)報(bào);2009年03期

9 Ian Foster;Yong Zhao;Ioan Raicu;Shiyong Lu;楊莎莎;劉宴兵;;網(wǎng)格計(jì)算和云計(jì)算360度比較[J];數(shù)字通信;2010年03期

10 葉強(qiáng)強(qiáng);余燁;張靜;劉曉平;;基于網(wǎng)格的球面虛擬實(shí)景空間搭建方法[J];華南師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年04期

相關(guān)會(huì)議論文 前9條

1 王瑞利;付漢清;;流體力學(xué)數(shù)值模擬中的網(wǎng)格自適應(yīng)技術(shù)[A];中國(guó)工程物理研究院科技年報(bào)（1999）[C];1999年

2 李盾;陳靖;方華;;復(fù)雜外形三維非結(jié)構(gòu)粘性直角網(wǎng)格的生成[A];中國(guó)造船工程學(xué)會(huì)電子技術(shù)學(xué)術(shù)委員會(huì)2006學(xué)術(shù)年會(huì)論文集（上冊(cè)）[C];2006年

3 葉強(qiáng)強(qiáng);余燁;張靜;劉曉平;;基于網(wǎng)格的球面虛擬實(shí)景空間搭建方法[A];安徽首屆科普產(chǎn)業(yè)博士科技論壇——暨社區(qū)科技傳播體系與平臺(tái)建構(gòu)學(xué)術(shù)交流會(huì)論文集[C];2012年

4 鄭冠男;楊國(guó)偉;;三維非結(jié)構(gòu)動(dòng)網(wǎng)格計(jì)算方法研究[A];第十三屆全國(guó)激波與激波管學(xué)術(shù)會(huì)議論文集[C];2008年

5 周磊;譚偉偉;;聚合多重網(wǎng)格的體網(wǎng)格可視化技術(shù)[A];探索 創(chuàng)新 交流（第4集）——第四屆中國(guó)航空學(xué)會(huì)青年科技論壇文集[C];2010年

6 晉長(zhǎng)秋;曹雄;;二維拉氏程序中的重分[A];中國(guó)工程物理研究院科技年報(bào)（2000）[C];2000年

7 陳立崗;梁義;陳建軍;鄭耀;;保特征的曲面網(wǎng)格重生成方法[A];慶祝中國(guó)力學(xué)學(xué)會(huì)成立50周年暨中國(guó)力學(xué)學(xué)會(huì)學(xué)術(shù)大會(huì)’2007論文摘要集（下）[C];2007年

8 楊永;;基于網(wǎng)格計(jì)算的CFD模擬可信度分析[A];計(jì)算流體力學(xué)研究進(jìn)展——第十二屆全國(guó)計(jì)算流體力學(xué)會(huì)議論文集[C];2004年

9 龔也君;;浸入界面法快速生成網(wǎng)格[A];第十七屆全國(guó)反應(yīng)堆結(jié)構(gòu)力學(xué)會(huì)議論文集[C];2012年

相關(guān)博士學(xué)位論文 前10條

1 郭e，

本文編號(hào)：2026909