基于非等距网格高阶紧致差分格式的多重网格算法研究

本文结合非等距网格高精度紧致差分格式的优越性与多重网格方法的快速收敛性,求解二维对流扩散方程。研究结果表明,对于处理物理量在不同的空间方向呈现不同的性态特征或不同变化规律的物理问题时,用非等距网格离散的四阶紧致格式的多重网格算法和二阶中心差分格式的多重网格算法都比等距网格离散得高效。同时,在非等距网格下下,部分半粗化多重网格算法比完全粗化多重网格算法具有更高的计算效率。针对不同的松弛算子对误差残量的磨光效果比较研究表明,线松弛算子是最高效的。而且,非等距网格离散的高精度紧致格式的多重网格算法对于对流扩散问题中大网格雷诺数情形也是收敛的。     

广义平均值差分格式在对流—扩散方程中的应用

§1.引言 从逼近的角度看,微分方程的各种数值方法均可认为是对解函数的某种方式的逼近。当解具有大梯度时,线性逼近的效果往往不好。一般的克服办法是细分网格或采用高阶多项式插值。本文考虑从非线性逼近的角度处理微分方程大梯度问题。前几年孙家昶导出广义平均值以及一类半线性数值微分公式,并且运用这种工具解常微分方程的初边值问题,取得良好效果。本文在此基础上对于对流—扩散方程用广义平均值构造了一种自适应的差分格式,使之具有根据解的局部性态选择格式的特点,并分析了格式的截断误差和所引入参数的选取,以及格式的稳定性和保单调性条件。对于一维及二维问题的一     

TVD格式求解对流扩散方程的最优限制器研究

为探究不同通量限制器应用于TVD(Total Variation Diminishing)格式求解对流扩散方程时的适用性,基于3种典型的TVD格式与10种常用的通量限制器,分别求解了线性对流扩散方程、非线性对流扩散方程、拟线性对流扩散方程。数值结果表明,相比于MUSCL(Monotonic Upstream-centered Scheme for Conservation Laws)和MTVDLF(Modified TVDLF)格式,采用TVDLF(TVD Lax-Friedrichs)格式时,计算结果出现了较为严重的数值耗散;对MUSCL和MTVDLF格式进行具体分析发现,关于阶跃型纯对流问题,Superbee限制器的误差最小,Minmod误差最大。关于高斯型对流扩散问题,Minmod误差最大,Woodward误差最小。而关于阶跃型对流扩散问题及Burgers方程,限制器的类型对实验结果影响并不明显。     

三维对流扩散方程的稀疏存储及预条件迭代

基于四阶紧致格式对三维对流扩散方程进行离散,并给出所得到的离散线性方程组的块三角稀疏矩阵形式。以带双阈值的不完全因子化LU分解[(ILUT(τ,s))]作为预条件子,分别用FGMRES、BICGSTAB和TFQMR作为迭代加速器,对离散线性方程组进行求解验证了格式精度并比较了不同迭代法的CPU时间和迭代步。此外,通过比较传统迭代法和预条件迭代法的计算效率,表明预条件迭代法不仅能够保证格式的四阶精度,还能极大地提高收敛效率。     

一维非定常对流扩散方程的高阶组合紧致迎风格式

通过将对流项采用四五阶组合迎风紧致格式离散,扩散项采用四阶对称紧致格式离散之后,对得到的半离散格式在时间方向采用四阶龙格库塔方法求解,从而得到了一种求解非定常对流扩散方程问题的高精度组合紧致有限差分格式,其收敛阶为O(h~4+τ~4).经Fourier精度分析和数值验证,证实了格式的良好性能.三个数值算例包括线性常系数问题,矩形波问题和非线性问题,数值结果表明:该格式具有很高的分辨率,且适用于对高雷诺数问题的数值模拟.     

时间分数阶四阶扩散方程的显-隐和隐-显差分格式

时间分数阶四阶扩散方程是一类重要的发展型偏微分方程,其数值解的研究有重要的科学意义和工程实际价值.本文针对时间分数阶四阶扩散方程,研究一类显-隐(E-I)差分格式和隐-显(I-E)差分格式解法,该方法基于经典隐式和经典显式格式相结合构造而成,分析E-I和I-E两种差分格式解的存在唯一性、稳定性和收敛性.理论分析和数值试验结果证实本文E-I差分格式和I-E差分格式无条件稳定,具有空间2阶精度,时间2-α阶精度.在计算精度一致的要求下,E-I和I-E差分格式较经典隐式差分格式具有省时性,其计算时间相比古典隐格式减少约70%,研究表明本文格式求解时间分数阶四阶扩散方程是有效的.     

传输扩散方程的差分格式

本文对传输扩散方程构造了两个带单参数的两层半显差分格式,证明了格式的绝对稳定性,对于初边值问题,计算是显式的。     

二维带分数阶Laplacian算子的对流扩散方程的格子Boltzmann模型研究

带有分数阶Laplacian算子的对流扩散方程常被用来刻画自然界与社会系统中的反常扩散现象.本文提出了一种新的格子Boltzmann模型,用于求解二维带分数阶Laplacian算子的对流扩散方程.首先,基于分数阶Laplacian算子的Fourier变换和Gauss型求积公式,得到控制方程的近似方程.然后,将速度空间、时间和空间进行离散,并构造合适的平衡态分布函数和离散作用力,建立有效的格子Boltzmann-BGK模型.通过Chapman-Enskog分析,可由建立的格子Boltzmann-BGK模型恢复出宏观方程,从而证明了模型的有效性.最后,将模型应用于求解带有解析解的数值算例和Allen-Cahn方程,数值结果进一步验证了模型的正确性和有效性.     

大尺度图像编辑的泊松方程并行多重网格求解算法

随着获取设备的发展,大尺度、高分辫率数字图像已逐步进入人们的生活,大尺度图像的梯度域编辑显得更为重要,求解大规模未知数的泊松方程是大尺度图像梯度域编辑的关键。传统多重网格算法的迭代、约束和插值操作单独进行,内存和外存间通讯量大,算法效率低,为此提出了一种面向大尺度图像梯度域编辑的并行多重网格求解泊松方程的算法。该算法利用多重网格的迭代、约束和插值过程的内存数据访问局部性和更新相关性,构造滑动工作窗口,使迭代、约束和插值操作并行运行,提高了多重网格算法求解泊松方程的计算效率。全景图拼接实验表明,所提算法的运行效率高于超松弛迭代、高斯塞德尔迭代和传统多重网格算法。     

Cahn-Hilliard方程多重网格求解器收敛性分析

Cahn-Hilliard(CH)方程是相场模型中的一个基本的非线性方程,通常使用数值方法进行分析。在对CH方程进行数值离散后会得到一个非线性的方程组,全逼近格式(Full Approximation Storage, FAS)是求解这类非线性方程组的一个高效多重网格迭代格式。目前众多的求解CH方程主要关注数值格式的收敛性,而没有论证求解器的可靠性。文中给出了求解CH方程离散得到的非线性方程组的多重网格算法的收敛性证明,从理论上保证了计算过程的可靠性。针对CH方程的时间二阶全离散差分数值格式,利用快速子空间下降(Fast Subspace Descent, FASD)框架给出其FAS格式多重网格求解器的收敛常数估计。为了完成这一目标,首先将原本的差分问题转化为完全等价的有限元问题,再论证有限元问题来自一个凸泛函能量形式的极小化,然后验证能量形式及空间分解满足FASD框架假设,最终得到原多重网格算法的收敛系数估计。结果显示,在非线性情形下,CH方程中的参数ε对网格尺度添加了限制,太小的参数会导致数值计算过程不收敛。最后通过数值实验验证了收敛系数与方程参数及网格尺度的依赖关系。     

A 15-point high-order compact scheme with multigrid computation for solving 3D convection diffusion equations

We propose a method with sixth-order accuracy to solve the three-dimensional (3D) convection diffusion equation. We first use a 15-point fourth-order compact discretization scheme to obtain fourth-order solutions on both fine and coarse grids using the multigrid method. Then an iterative mesh refinement technique combined with Richardson extrapolation is used to approximate the sixth-order accurate solution on the fine grid. Numerical results are presented for a variety of test cases to demonstrate the efficiency and accuracy of the proposed method, compared with the standard fourth-order compact scheme.     

An EXCMG accelerated multiscale multigrid computation for 3D Poisson equation

Multiscale multigrid (MSMG) method is an effective computational framework for efficiently computing high accuracy solutions for elliptic partial differential equations. In the current MSMG method, compared to the CPU cost on computing sixth-order solutions by applying extrapolation and other techniques on two fourth-order solutions from different scales grids, much more CPU time is spent on computing fourth-order solutions themselves on coarse and fine grids, particularly for high-dimensional problems. Here we propose to embed extrapolation cascadic multigrid (EXCMG) method into the MSMG framework to accelerate the whole process. Numerical results on 3D Poisson equations show that the new EXCMG–MSMG method is more efficient than the existing MSMG method and the EXCMG method for sixth-order solution computation.     

Optimal injection operator and high order schemes for multigrid solution of 3D poisson equation

We present a multigrid solution of the three dimensional Poisson equation with a fourth order 19-point compact finite difference scheme. Using a red–black ordering of the grid points and some geometric considerations, we derive an optimal scaled injection operator for the multigrid algorithm. Numerical computations show that this operator yields not only the smallest overall CPU time, but also the best convergence rate compared to other more traditional projection operators. In addition, we present a family of 19-point compact schemes and numerically show that each one has a different optimal scaled injection operator.     

A stencil of the finite-difference method for the 2D convection diffusion equation and its new iterative scheme

The paper gives the numerical stencil for the two-dimensional convection diffusion equation and the technique of elimination, and builds up the new iterative scheme to solve the implicit difference equation. The scheme's convergence and its higher rate of convergence than the Jacobi iteration are proved. And the numerical example indicates that the new scheme has the same parallelism and a higher rate of convergence than the Jacobi iteration.     

求解二维对流扩散方程的投影迭代法

鉴于目前流行的求解大型稀疏代数方程组的投影迭代法中,为提高迭代效率,在迭代前通常需要对稀疏矩阵进行预处理,改善迭代矩阵的条件数,从而减少迭代次数,这使得发展稀疏矩阵的存储技术变得尤为关键。基于二维对流扩散方程的四阶紧致差分格式,将其转化为代数方程组,得到其三对角块形式的系数矩阵,利用稀疏矩阵存储技术和预条件迭代法进行求解,并与传统的中心差分格式所得数值解进行比较,充分说明了方法的高效性和可靠性。     

A high-order compact scheme for the one-dimensional Helmholtz equation with a discontinuous coefficient

In this paper, based on the idea of the immersed interface method, a fourth-order compact finite difference scheme is proposed for solving one-dimensional Helmholtz equation with discontinuous coefficient, jump conditions are given at the interface. The Dirichlet boundary condition and the Neumann boundary condition are considered. The Neumann boundary condition is treated with a fourth-order scheme. Numerical experiments are included to confirm the accuracy and efficiency of the proposed method.     

Partial semi-coarsening multigrid method based on the HOC scheme on nonuniform grids for the convection–diffusion problems

A partial semi-coarsening multigrid method based on the high-order compact (HOC) difference scheme on nonuniform grids is developed to solve the 2D convection–diffusion problems with boundary or internal layers. The significance of this study is that the multigrid method allows different number of grid points along different coordinate directions on nonuniform grids. Numerical experiments on some convection–diffusion problems with boundary or internal layers are conducted. They demonstrate that the partial semi-coarsening multigrid method combined with the HOC scheme on nonuniform grids, without losing the high-order accuracy, is very efficient and effective to decrease the computational cost by reducing the number of grid points along the direction which does not contain boundary or internal layers.     

A new unconditionally stable ADI compact scheme for the two-space-dimensional linear hyperbolic equation

We formulate a new alternating direction implicit compact scheme of O(τ²+h ⁴) for the linear hyperbolic equation u _tt +2α u _t +β² u=u _xx +u _yy +f(x, y, t), 0<x, y<1, 0<t≤T, subject to appropriate initial and Dirichlet boundary conditions, where α>0 and β≥0 are real numbers. In this article, we show the method is unconditionally stable by the Von Neumann method. At last, numerical demonstrations are given to illustrate our result.