不可压缩流基于块预处理的并行有限元计算

发展了一个模拟非定常不可压缩粘性流的并行有限元求解器,时间离散使用具有二阶精度的隐式中点格式,基于三维非结构四面体网格剖分,使用高阶混合有限元离散速度场（P2）和压力场（P1）.全离散格式产生的代数方程组是大型、稀疏、非对称和病态的,基于修正的压力对流扩散预处理（PCD）和精心设计的子问题迭代执行策略,采用预处理的GMRES迭代法来高效求解线性方程组.利用相同的子问题迭代策略,同时给出基于最小二乘交换子（LSC）预处理的并行效率对比.大量数值算例验证了算法的精度、可扩展性和可靠性.三维驱动方腔流模拟结果（Re=3200.0）清晰地显示了方腔流中主涡（PE）、下游二次涡（DSE）、上游二次涡（USE）、侧壁涡（EWV）和TGL涡的存在.     

湍流热对流DNS多分辨率并行直接求解方法

依据温度标量场与动量计算的空间和时间计算分辨率不同的特点,采用两套网格,建立多分辨率双网格并行直接求解方法,用以解决极高Ra数湍流热对流DNS模拟巨大计算工作量的难题.在两套网格的数据交换上,根据每个细网格都满足连续方程,设计了速度的守恒平移插值方法.二维极高Ra数湍流热对流的计算结果表明,采用多分辨率双网格并行直接求解方法的DNS计算,可以使计算工作量降低近一个量级.瞬时温度场显示,双网格方法的计算结果可以很好地描述极高Ra数下快速运动的小尺寸漩涡团状羽流,得到的结果与原网格一致,不同方法计算得到的传热Nu数误差不超过1%.     

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

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

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

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

非结构网格下涡轮级三维非定常N-S方程的数值解

本文在非结构网格下,采用时间上二阶精度、空间上不低于二阶的高分辨率格式求解涡轮级三维流场,得到了与实验数据大体接近的N-S方程数值解。计算表明:本文所构造的双时间步迭代格式具有稳定、高效的特征。实践显示:本文用FORTRAN与C语言混合编制的N-S方程源程序,可用于涡轮级三维非定常流场计算。     

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

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

非定常对流扩散方程的高精度多重网格方法

由已有的求解定常对流扩散方程的高阶紧致差分格式出发,直接推导出了数值求解非定常对流扩散方程的一种高阶隐式紧致差分格式,其时间为二阶精度,空间为四阶精度,并且是无条件稳定的。为了加快传统迭代法在求解隐格式时在每一个时间步上的迭代收敛速度,采用了多重网格加速技术。数值实验结果验证了本文方法的高阶精度、高效性及高稳定性。     

粒子输运离散纵标方程基于界面修正的并行计算方法

为了改造粒子输运方程求解的隐式格式,研究设计适应大型并行计算机的并行计算方法,介绍一类求解粒子输运方程离散纵标方程组的基于界面修正的源迭代并行计算方法.应用空间区域分解,在子区域内界面处首先采用迎风显式差分格式进行预估,构造子区域的入射边界条件,然后,在各个子区域内部进行源迭代求解隐式离散纵标方程组.在源迭代过程中,在内界面入射边界处采用隐式格式进行界面修正.数值算例表明该并行计算方法在精度、并行度、简单性诸方面均具有良好的性质.     

并行重叠/变形混合网格生成技术及其应用

为了适用于柔性变形、相对运动等复杂动边界问题,建立了并行环境下重叠和变形相结合的动态混合网格生成技术.通过计算区域分解以及分布式并行实现了重叠和变形技术的结合,其中重叠网格采用了并行化的隐式装配方法,并发展了两种并行化查询策略.变形网格则采用了并行化的径向基函数（RBF）插值方法.并行化动态网格生成方法大幅提高了动态网格生成效率,有利于处理大规模的动边界问题.在此基础上,发展了基于变形/重叠动态混合网格的流动/运动/控制一体化数值模拟方法,进一步改进了耦合模拟软件平台——HyperFLOW.典型应用算例证明了该动态混合网格技术及一体化算法的实用性.      

三维湍流Rayleigh-Bénard热对流的高效并行直接求解方法

高Ra数Rayleigh-Bénard热对流的湍流特性研究是当前国际上的一个热门研究课题, DNS模拟计算是研究该课题的重要手段之一. 当计算规模增大而网格数巨大时计算工作难以实现, 高Ra湍流热对流的数值模拟研究面临重大挑战. 本文创建了大规模高效并行计算的三维湍流热对流直接求解方法. 采用FFT变换解耦压力泊松方程, 将其变换成沿z方向上的块三对角方程组, 并利用块三对角方程的MPI与OpenMP联立的大规模高效并行近似解求解方案, 创建了可以高效并行计算的热对流直接求解方法. 通过对该方法并行效率的验证计算, 证明新的直接求解并行计算方法具有很好的并行效率和计算时效. 三维窄方腔热对流的计算结果表明, 本文方法计算的三维热对流特性是合理的. 本文创建的可大规模高效并行计算的三维湍流热对流直接求解方法, 也很可能是关于计算流体力学不可压NS方程大规模高效并行计算在特殊情况中计算技术上的一个突破.     

A dispersion minimizing finite difference scheme and preconditioned solver for the 3D Helmholtz equation

In this paper, a new 27-point finite difference method is presented for solving the 3D Helmholtz equation with perfectly matched layer (PML), which is a second order scheme and pointwise consistent with the equation. An error analysis is made between the numerical wavenumber and the exact wavenumber, and a refined choice strategy based on minimizing the numerical dispersion is proposed for choosing weight parameters. A full-coarsening multigrid-based preconditioned Bi-CGSTAB method is developed for solving the linear system stemming from the Helmholtz equation with PML by the finite difference scheme. The shifted-Laplacian is extended to precondition the 3D Helmholtz equation, and a spectral analysis is given. The discrete preconditioned system is solved by the Bi-CGSTAB method, with a multigrid method used to invert the preconditioner approximately. Full-coarsening multigrid is employed, and a new matrix-based prolongation operator is constructed accordingly. Numerical results are presented to demonstrate the efficiency of both the new 27-point finite difference scheme with refined parameters, and the preconditioned Bi-CGSTAB method with the 3D full-coarsening multigrid.     

Fourth Order Compact Boundary Value Method for Option Pricing with Jumps

We consider pricing options in a jump-diffusion model which requires solving a partial integro-differential equation. Discretizing the spatial direction with a fourth order compact scheme leads to a linear system of ordinary differential equations. For the temporal direction, we utilize the favorable boundary value methods owing to their advantageous stability properties. In addition, the resulting large sparse system can be solved rapidly by the GMRES method with a circulant Strang-type preconditioner. Numerical results demonstrate the high order accuracy of our scheme and the efficiency of the preconditioned GMRES method.     

一种求解三维热辐射输运方程的整体预处理迭代方法及并行计算

为三维灰体热辐射输运方程的隐式离散纵标方法发展一个整体预处理迭代方法并研制并行程序.该方法采用组装线性代数方程组策略,同时求出所有离散方向上的辐射强度.借助预处理的Krylov子空间迭代法,避免复杂网格上扫描算法可能遇到的死锁问题,能够提高健壮性和计算效率.空间离散上采用一阶迎风有限体积格式.数值实验测试变形六面体网格...     

三维预处理技术初探

本文应用高阶近似LU分解法对三维椭圆型方程的正规七点差分矩阵给出了预处理阵,并对典型问题给出了预处理共轭梯度法的计算结果。文中所采用的分阶方论以及阶矩阵等概念,适用于一般的非奇异对角优势稀疏矩阵。对不同网格点数的计算结果表明,三维预处理共轭梯度法仍具有超线性的收敛速率,在高阶情形下超线性的特征尤为突出,由于非零对角线数增长过快,高阶的三维预处理方法不宜采用,零阶方法和一阶方法是值得推荐的。     

三维对流扩散方程非等距网格上的四阶紧致格式及其多重网格方法

提出了数值求解三维变系数对流扩散方程非等距网格上的四阶精度19点紧致差分格式,为了提高求解效率,采用多重网格方法求解高精度格式所形成的大型代数方程组。数值实验结果表明本文方法对于不同的网格雷诺数问题,在精确性、稳定性和减少计算工作量方面均明显优于7点中心差分格式。     

Semi-automatic sparse preconditioners for high-order finite element methods on non-uniform meshes

High-order finite elements often have a higher accuracy per degree of freedom than the classical low-order finite elements. However, in the context of implicit time-stepping methods, high-order finite elements present challenges to the construction of efficient simulations due to the high cost of inverting the denser finite element matrix. There are many cases where simulations are limited by the memory required to store the matrix and/or the algorithmic components of the linear solver. We are particularly interested in preconditioned Krylov methods for linear systems generated by discretization of elliptic partial differential equations with high-order finite elements. Using a preconditioner like Algebraic Multigrid can be costly in terms of memory due to the need to store matrix information at the various levels. We present a novel method for defining a preconditioner for systems generated by high-order finite elements that is based on a much sparser system than the original high-order finite element system. We investigate the performance for non-uniform meshes on a cube and a cubed sphere mesh, showing that the sparser preconditioner is more efficient and uses significantly less memory. Finally, we explore new methods to construct the sparse preconditioner and examine their effectiveness for non-uniform meshes. We compare results to a direct use of Algebraic Multigrid as a preconditioner and to a two-level additive Schwarz method.     

An accurate and efficient method for the incompressible Navier–Stokes equations using the projection method as a preconditioner

The projection method is a widely used fractional-step algorithm for solving the incompressible Navier–Stokes equations. Despite numerous improvements to the methodology, however, imposing physical boundary conditions with projection-based fluid solvers remains difficult, and obtaining high-order accuracy may not be possible for some choices of boundary conditions. In this work, we present an unsplit, linearly-implicit discretization of the incompressible Navier–Stokes equations on a staggered grid along with an efficient solution method for the resulting system of linear equations. Since our scheme is not a fractional-step algorithm, it is straightforward to specify general physical boundary conditions accurately; however, this capability comes at the price of having to solve the time-dependent incompressible Stokes equations at each timestep. To solve this linear system efficiently, we employ a Krylov subspace method preconditioned by the projection method. In our implementation, the subdomain solvers required by the projection preconditioner employ the conjugate gradient method with geometric multigrid preconditioning. The accuracy of the scheme is demonstrated for several problems, including forced and unforced analytic test cases and lid-driven cavity flows. These tests consider a variety of physical boundary conditions with Reynolds numbers ranging from 1 to 30000. The effectiveness of the projection preconditioner is compared to an alternative preconditioning strategy based on an approximation to the Schur complement for the time-dependent incompressible Stokes operator. The projection method is found to be a more efficient preconditioner in most cases considered in the present work.     

Efficient symmetric positive definite second-order accurate monolithic solver for fluid/solid interactions

We introduce a robust and efficient method to simulate strongly coupled (monolithic) fluid/rigid-body interactions. We take a fractional step approach, where the intermediate state variables of the fluid and of the solid are solved independently, before their interactions are enforced via a projection step. The projection step produces a symmetric positive definite linear system that can be efficiently solved using the preconditioned conjugate gradient method. In particular, we show how one can use the standard preconditioner used in standard fluid simulations to precondition the linear system associated with the projection step of our fluid/solid algorithm. Overall, the computational time to solve the projection step of our fluid/solid algorithm is similar to the time needed to solve the standard fluid-only projection step. The monolithic treatment results in a stable projection step, i.e. the kinetic energy does not increase in the projection step. Numerical results indicate that the method is second-order accurate in the L^∞-norm and demonstrate that its solutions agree quantitatively with experimental results.     

On the indefinite Helmholtz equation: Complex stretched absorbing boundary layers,iterative analysis,and preconditioning

This paper studies and analyzes a preconditioned Krylov solver for Helmholtz problems that are formulated with absorbing boundary layers based on complex coordinate stretching. The preconditioner problem is a Helmholtz problem where not only the coordinates in the absorbing layer have an imaginary part, but also the coordinates in the interior region. This results into a preconditioner problem that is invertible with a multigrid cycle. We give a numerical analysis based on the eigenvalues and evaluate the performance with several numerical experiments. The method is an alternative to the complex shifted Laplacian and it gives a comparable performance for the studied model problems.