大雷诺数Navier-Stokes方程的两水平亚格子模型稳定化方法

基于两重网格离散方法,提出三种求解大雷诺数定常Navier-Stokes方程的两水平亚格子模型稳定化有限元算法.其基本思想是首先在一粗网格上求解带有亚格子模型稳定项的Navier-Stokes方程,然后在细网格上分别用三种不同的校正格式求解一个亚格子模型稳定化的线性问题,以校正粗网格解.通过适当的稳定化参数和粗细网格尺寸的选取,这些算法能取得最优渐近收敛阶的有限元解.最后,用数值模拟验证三种算法的有效性.     

带阻尼项定常Navier-Stokes方程的并行两水平有限元算法

基于两重网格离散和区域分解技术，提出数值求解带阻尼项定常Navier-Stokes方程的三种并行两水平有限元算法。其基本思想是首先在粗网格上求解完全的非线性问题，以获得粗网格解，然后在重叠的局部细网格子区域上并行求解Stokes、 Oseen和Newton线性化的残差问题，最后在非重叠的局部细网格子区域上校正近似解。数值算例验证了算法的有效性。     

粘性不可压流的变分多尺度数值模拟

在变分多尺度的理论框架内,将待求解的各个物理量分解到"粗"、"细"两种尺度上.在"细"尺度上采用"泡"函数作为近似函数,通过Petrov-Galerkin方法得到"细"尺度上的近似解;然后引入求解"粗"尺度方程所需的稳定项及与其相适应的稳定化因子;最后运用有限元方法求解"粗"、"细"两种尺度耦合的整体变分多尺度方程,得到有限元近似解.数值算例表明,该处理方法成功地消除了数值求解粘性不可压Navier-Stokes方程过程中,由对流占优和速度-压力失耦引起的数值伪振荡;所引入的稳定化因子适用于结构网格及非结构网格上的数值计算.     

非定常Navier-Stokes方程基于两重网格离散的有限元并行算法

基于两重网格离散和区域分解技巧，提出三种求解非定常Navier-Stokes方程的有限元并行算法.算法的基本思想是在每一时间迭代步，在粗网格上采用Oseen迭代法求解非线性问题，在细网格上分别并行求解Oseen、Newton、Stokes线性问题以校正粗网格解.对于空间变量采用有限元离散，时间变量采用向后Euler格式离散.数值实验验证了算法的有效性.     

一种可扩展的三维半导体器件并行数值模拟算法

在基于漂移-扩散模型的三维半导体器件数值模拟中,通过有限体积法进行数值离散,采用完全耦合的牛顿迭代求解非线性代数方程组,并使用基于代数多重网格预条件子的GMRES方法求解牛顿迭代中的线性方程组,构造一种稳健且高度可扩展的非结构四面体网格上求解半导体方程的并行算法.基于PHG平台实现该算法的并行计算程序,并对PN结和MOS场效应晶体管等问题进行了最大网格规模达到5亿单元、最大并行规模达到1 024进程的大规模数值模拟实验,结果表明,该算法计算效率高,可扩展性好.     

不规则区域上并行求解Poisson方程

提出一种并行求解不规则区域上的Poisson方程方法,将不规则区域转化为带约束的三维结构网格表示,在该区域采用红黑排序并行求解Poisson方程.数值实验表明,方法可较好地解决不规则区域上的Poisson并行求解问题.同时评估了不规则区域对并行性能带来的影响.     

地球外核热对流运动的区域分解多重网格并行数值模拟

旋转球层中热对流运动的数值模拟是地球发电机模型的重要组成部分,对研究地球发电机作用机理具有重要意义.本文设计一个基于国产超级计算平台并行性能良好的地球外核热对流运动并行数值模型.时间积分方案采用与Crank-Nicolson格式和二阶Adams-Bashford公式相结合的近似分解分步法,空间离散基于立方球网格的二阶精度有限体积格式.所得到的两个大规模稀疏线性代数方程组采用带预处理的Krylov子空间迭代法进行求解.为加速迭代求解过程及提高并行性能,迭代过程采用区域分解多重网格的多层限制型加法Schwarz预处理子,减少了求解程序的计算时间,提高了数值模型的并行性能,模型被很好地扩展到上万处理器核数.数值模拟结果与基准模型算例0的参考值吻合得很好.     

惯性约束聚变内爆中基于多块结构网格的高效辐射扩散并行算法

针对三维球形靶丸内爆高效模拟需求和传统笛卡尔正交网格上辐射加源困难的问题, 发展一种多块结构非正交网格生成方法, 并基于此种计算网格提出高效的三维扩散格式并行算法, 将其应用于辐射流体方程组的求解和三维内爆不对称性的数值模拟, 数值结果显示了算法的有效性。并行性能测试显示该算法可扩展到5400个核上, 并行效率达到69%。     

间断问题的并行多重网格预条件共轭梯度法求解

首先比较了四种串行多重网格预条件共轭梯度法求解四类典型间断问题时,数值收敛因子与间断类型、间断程度、网格步长的关系;然后,在算法中引入Schwarz并行,探讨了并行算法收敛因子与子区域个数的关系,以及Schwarz并行的获益。给出了详细的性能比较结果。     

一种求解流体力学方程组的自适应显式时间积分算法及其应用

针对交替方向显式离散格式,提出一个基于结构网格局部加密技术(SAMR)的求解流体力学方程组的自适应时间积分算法;基于该算法,在JASMIN框架上研制多介质流体力学并行自适应数值模拟程序;在512个处理器上模拟惯性约束聚变中的二维内爆模型.数值模拟结果和并行性能分析显示了算法的正确性和并行实现的高效率.     

一种分布式内存环境下的并行二分网格加密算法

给出了一个基于ALBERT(Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques)的并行二分网格加密算法.其目的是开发基于ALBERT的、适合于分布式内存计算机的并行自适应有限元软件包.首先给出了针对ALBERT的并行化策略,然后重点介绍并行网格加密算法,并证明了并行算法和原有串行算法在加密结果上完全等效.最后,数值实验证明该并行算法能有效地在分布式内存的计算机上执行.     

面向结构网格并行应用的一类快速通信算法

通信算法需要在相邻子区域间传输数据.通过求解子区域间的相交问题可以寻找相邻区域.针对子区域的求交问题,基于区间树,结合结构网格应用的特点,构造近似线性时间复杂度的算法.数值实验表明该算法具有较高的计算效率和可扩展性,能够支持百万量级矩形子区域的并行计算.     

流动数值模拟中一种并行自适应有限元算法

给出了一种流动数值模拟中的基于误差估算的并行网格自适应有限元算法.首先,以初网格上获得的当地事后误差估算值为权,应用递归谱对剖分方法划分初网格,使各子域上总体误差近似相等,以解决负载平衡问题.然后以误差值为判据对各子域内网格进行独立的自适应处理.最后应用基于粘接元的区域分裂法在非匹配的网格上求解N-S方程.区域分裂情形下N-S方程有限元解的误差估算则是广义Stokes问题误差估算方法的推广.为验证方法的可靠性,给出了不可压流经典算例的数值结果.     

A parallel solution – adaptive method for three-dimensional turbulent non-premixed combusting flows

A parallel adaptive mesh refinement (AMR) algorithm is proposed and applied to the prediction of steady turbulent non-premixed compressible combusting flows in three space dimensions. The parallel solution-adaptive algorithm solves the system of partial-differential equations governing turbulent compressible flows of reactive thermally perfect gaseous mixtures using a fully coupled finite-volume formulation on body-fitted multi-block hexahedral meshes. The compressible formulation adopted herein can readily accommodate large density variations and thermo-acoustic phenomena. A flexible block-based hierarchical data structure is used to maintain the connectivity of the solution blocks in the multi-block mesh and to facilitate automatic solution-directed mesh adaptation according to physics-based refinement criteria. For calculations of near-wall turbulence, an automatic near-wall treatment readily accommodates situations during adaptive mesh refinement where the mesh resolution may not be sufficient for directly calculating near-wall turbulence using the low-Reynolds-number formulation. Numerical results for turbulent diffusion flames, including cold- and hot-flow predictions for a bluff-body burner, are described and compared to available experimental data. The numerical results demonstrate the validity and potential of the parallel AMR approach for predicting fine-scale features of complex turbulent non-premixed flames.     

A fast mesh deformation method using explicit interpolation

A novel mesh deformation algorithm for unstructured polyhedral meshes is developed utilizing a tree-code optimization of a simple direct interpolation method. The algorithm is shown to provide mesh quality that is competitive with radial basis function based methods, with markedly better performance in preserving boundary layer orthogonality in viscous meshes. The parallelization of the algorithm is described, and the algorithm cost is demonstrated to be O(n log n). The parallel implementation was used to deform meshes of 100 million nodes on nearly 200 processors demonstrating that the method scales to large mesh sizes. Results are provided for a simulation of a high Reynolds number fluid–structure interaction case using this technique.     

基于静态双重区域分解的两种接触并行算法

CHAP3D是北京应用物理与计算数学研究所自主研发的Lagrange通用弹塑性流体力学分析程序.文章介绍了在CHAP3D程序中使用的、针对多处理器集群的、基于静态双重区域分解的两种接触并行算法.第一种是分配单个完整接触面的接触并行算法，此算法将一对完整的接触面分配到一个处理器上，并建立计算域与接触域的通信关系.此接触并行算法的优点是简单，在具有接触面的处理器上可以直接使用串行的接触搜索算法和接触力耦合计算算法.另一种是主面剖分区域分解的接触并行算法，此算法将所有接触面的主面区域分解到所有处理器上.须建立计算域与接触域以及接触域内各处理器间的两种通信关系.该接触并行算法是一个负载平衡的并行算法，具有很好的并行效率和可扩展性.数值算例显示，这两种接触并行算法都能够很好地模拟多种不同类型的接触问题.      

Two-Level Stabilized Finite Volume Methods for the Stationary Navier-Stokes Equations

In this work, two-level stabilized finite volume formulations for the 2D steady Navier-Stokes equations are considered. These methods are based on the local Gauss integration technique and the lowest equal-order finite element pair. Moreover, the two-level stabilized finite volume methods involve solving one small Navier-Stokes problem on a coarse mesh with mesh size $H$, a large general Stokes problem for the Simple and Oseen two-level stabilized finite volume methods on the fine mesh with mesh size $h$=$\mathcal{O}(H^2)$ or a large general Stokes equations for the Newton two-level stabilized finite volume method on a fine mesh with mesh size $h$=$\mathcal{O}(|\log h|^{1/2}H^3)$. These methods we studied provide an approximate solution $(\widetilde{u}_h^v,\widetilde{p}_h^v)$ with the convergence rate of same order as the standard stabilized finite volume method, which involve solving one large nonlinear problem on a fine mesh with mesh size $h$. Hence, our methods can save a large amount of computational time.     

Parallel adaptation of general three-dimensional hybrid meshes

A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.