外问题涡团法的收敛性

本文考虑欧拉方程初边值外问题涡团法的格式，其中泊松方程用等参有限元求解，这种方法被认为可以节省计算量．同时对半离散和全离散的格式都得到了丰满的误差估计．     

两个带变时间步的两重网格算法的稳定性分析

对用于求解非线性发展方程的两个带变时间步的两重网格算法，对空间变量用有限元离散，对时间变量分别用一阶精度Euler显式和二阶精度半隐式差分格式离散，然后构造两重网格算法，通过深入的稳定性分析，得出本文的算法优于标准全离散有限元算法。     

抛物方程初边值问题连续有限元的超收敛性

研究了一类一维抛物方程初边值问题的连续有限元方法.在空间上进行任意m次有限元半离散,在时间方向上进行二次连续有限元后,获得了一个稳定的全离散计算格式.利用单元分析法校正技术的新思想进行理论分析,连续有限元解在剖分网格节点上具有超收敛性.     

粘性Cahn-Hilliard方程的时间双层网格混合有限元方法

主要针对在求解粘性Cahn-Hilliard方程时非线性项引起的时间耗时问题,提出了时间双层网格混合有限元方法.在空间上采用混合有限元方法进行离散,时间上采用Crank-Nicolson格式.首先在时间粗网格上,通过非线性牛顿迭代方法求解非线性混合有限元系统.其次基于初始迭代数值解和拉格朗日插值公式在时间细网格上求解线性混合有限元系统,然后证明了该方法的稳定性和误差估计,并通过数值算例对理论部分进行验证.结果表明,理论与数值算例相一致.     

基于抛物线插值的Allen-Cahn方程时间两重网格有限元算法

本文运用抛物线插值的时间两重网格(TT-M)有限元(FE)算法求解非线性Allen-Cahn方程.首先,对非线性Allen-Cahn方程,在空间和时间上分别采用有限元方法以及二阶θ格式进行离散.其次,使用抛物线插值的时间两重网格有限元算法求解Allen-Cahn方程.同时,在粗细时间步长上,对数值解进行了稳定性分析和误差估计.最后,通过数值实验验证方法的有效性.     

四阶强阻尼波动方程的混合控制体积法

本文利用混合控制体积方法在三角网格剖分下求解四阶强阻尼波动方程.通过使用最低阶Raviart-Thomas混合有限元空间和引入迁移算子把解函数空间映射成试探函数空间,构造了半离散和全离散的混合控制体积格式,得到了最优阶误差估计.     

Stokes方程的投影／方向分裂谱方法

我们提出和分析了一种求解Stokes方程的数值方法．新方法基于空间上的Legendre谱离散,时间上则采用投影／方向分裂格式．更确切地说,时间离散的出发点是旋度形式的压力校正投影法,在此基础上进一步应用方向分裂法,把速度和压力方程分裂为一系列一维的椭圆型子问题．然后生成的这些一维子问题用Legendre谱方法进行空间离散．另外,我们证明了全离散格式的稳定性．一些数值实验验证了收敛性和方法的有效性．     

抛物型方程在变动区域中的Galarkin有限元法及其对Stefan问题的应用

文中叙述了具变系数抛物型方程在变动区域中的有限元半离散格式和全离散θ格式,给出了误差界和稳定性结果,并应用于求解Stefan问题。     

重叠型非匹配网格抛物型方程的有限元法及收敛性分析

基于单位分解技术,本文介绍了重叠型非匹配网格抛物型方程初边值问题的有限元方法,分别给出了半离散有限元、全离散有限元格式和收敛性分析的结果,并给出了数值例子.     

粒子输运方程的子网格平衡格式的稳定性和收敛性

本文研究四边形网格上求解粒子输运方程的有限体积格式,其中角方向变量采用离散纵标(Sn)方法,空间离散采用子网格平衡(SCB)格式.利用能量估计方法,证明了在正交网格上该格式的稳定性和离散解的收敛性.数值实验结果验证了格式的稳定性和离散解的收敛性.     

Two-Grid Finite Element Method with Crank-Nicolson Fully Discrete Scheme for the Time-Dependent Schrödinger Equation

In this paper, we study the Crank-Nicolson Galerkin finite element method and construct a two-grid algorithm for the general two-dimensional time-dependent Schrödinger equation. Firstly, we analyze the superconvergence error estimate of the finite element solution in $H^1$ norm by use of the elliptic projection operator. Secondly, we propose a fully discrete two-grid finite element algorithm with Crank-Nicolson scheme in time. With this method, the solution of the Schrödinger equation on a fine grid is reduced to the solution of original problem on a much coarser grid together with the solution of two Poisson equations on the fine grid. Finally, we also derive error estimates of the two-grid finite element solution with the exact solution in $H^1$ norm. It is shown that the solution of two-grid algorithm can achieve asymptotically optimal accuracy as long as mesh sizes satisfy $H = \mathcal{O}(h^{\frac{1}{2}})$.     

Two-Grid Algorithm of $H^{1}$-Galerkin Mixed Finite Element Methods for Semilinear Parabolic Integro-Differential Equations

In this paper, we present a two-grid discretization scheme for semilinear parabolic integro-differential equations by $H^{1}$-Galerkin mixed finite element methods. We use the lowest order Raviart-Thomas mixed finite elements and continuous linear finite element for spatial discretization, and backward Euler scheme for temporal discretization. Firstly, a priori error estimates and some superclose properties are derived. Secondly, a two-grid scheme is presented and its convergence is discussed. In the proposed two-grid scheme, the solution of the nonlinear system on a fine grid is reduced to the solution of the nonlinear system on a much coarser grid and the solution of two symmetric and positive definite linear algebraic equations on the fine grid and the resulting solution still maintains optimal accuracy. Finally, a numerical experiment is implemented to verify theoretical results of the proposed scheme. The theoretical and numerical results show that the two-grid method achieves the same convergence property as the one-grid method with the choice $h=H^2$.     

A Fast and Stable Algorithm for Linear Parabolic Partial Differential Equations

In the paper, a two-grid finite element scheme is discussed for distributed optimal control governed by elliptic equations. With this new scheme, the solution of the elliptic optimal control problem on a fine grid is reduced to the solution of the elliptic optimal control problem on a much coarser grid and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy. Finally, numerical experiments are carried out to confirm the considered theory.     

Numerical performance of parallel group explicit solvers for the solution of fourth order elliptic equations

Many applications in applied mathematics and engineering involve numerical solutions of partial differential equations (PDEs). Various discretisation procedures such as the finite difference method result in a problem of solving large, sparse systems of linear equations. In this paper, a group iterative numerical scheme based on the rotated (skewed) five-point finite difference discretisation is proposed for the solution of a fourth order elliptic PDE which represents physical situations in fluid mechanics and elasticity. The rotated approximation formulas lead to schemes with lower computational complexities compared to the centred approximation formulas since the iterative procedure need only involve nodes on half of the total grid points in the solution domain. We describe the development of the parallel group iterative scheme on a cluster of distributed memory parallel computer using Message-Passing Interface (MPI) programming environment. A comparative study with another group iterative scheme derived from the centred difference formula is also presented. A detailed performance analysis of the parallel implementations of both group methods will be reported and discussed.     

一类非线性对流扩散方程两重网格特征有限元方法及误差估计

主要研究了一类非线性对流扩散方程的全离散特征有限元方法的两重网格算法及其误差估计.首先在网格步长为H的粗网格上计算一个较小的非线性问题,然后利用一阶牛顿迭代和粗网格解将网格步长为h的细网格上的非线性问题转化为线性问题求解.由于非线性问题的求解仅在粗网格上进行,该两重网格算法可以节省大量的计算工作量,同时具有较高的精度,证明了该两重网格算法L~2模先验误差估计结果为O(△t+h~2+H~(4-d/2)),其中d为空间维数.     

Simulation of planar ionization wave front propagation on an unstructured adaptive grid

The paper deals with the numerical solution of a basic 2D model of the propagation of an ionization wave. The system of equations describing this propagation consists of a coupled set of reaction–diffusion-convection equations and a Poissons equation. The transport equations are solved by a finite volume method on an unstructured triangular adaptive grid. The upwind scheme and the diamond scheme are used for the discretization of the convection and diffusion fluxes, respectively. The Poisson equation is also discretized by the diamond scheme. Numerical results are presented. We deal in more detail with numerical tests of the grid adaptation technique and its influence on the numerical results. An original behavior is observed. The grid refinement is not sufficient to obtain accurate results for this particular phenomenon. Using a second order scheme for convection is necessary.     

A two-grid discretization scheme for eigenvalue problems

A two-grid discretization scheme is proposed for solving eigenvalue problems, including both partial differential equations and integral equations. With this new scheme, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a much coarser grid, and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy.

     

Nonlinear Galerkin methods and mixed finite elements: two-grid algorithms for the Navier-Stokes equations

Summary. A nonlinear Galerkin method using mixed finite elements is presented for the two-dimensional incompressible Navier-Stokes equations. The scheme is based on two finite element spaces and for the approximation of the velocity, defined respectively on one coarse grid with grid size and one fine grid with grid size and one finite element space for the approximation of the pressure. Nonlinearity and time dependence are both treated on the coarse space. We prove that the difference between the new nonlinear Galerkin method and the standard Galerkin solution is of the order of $H^2$, both in velocity ( and pressure norm). We also discuss a penalized version of our algorithm which enjoys similar properties. Received October 5, 1993 / Revised version received November 29, 1993     

Two‐Grid method for nonlinear parabolic equations by expanded mixed finite element methods

In this article, we develop a two‐grid algorithm for nonlinear reaction diffusion equation (with nonlinear compressibility coefficient) discretized by expanded mixed finite element method. The key point is to use two‐grid scheme to linearize the nonlinear term in the equations. The main procedure of the algorithm is solving a small‐scaled nonlinear equations on the coarse grid and dealing with a linearized system on the fine space using the Newton iteration with the coarse grid solution. Error estimation to the expanded mixed finite element solution is analyzed in detail. We also show that two‐grid solution achieves the same accuracy as long as the mesh sizes satisfy H = O(h^1/2). Two numerical experiments are given to verify the effectiveness of the algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A parallel two-level finite element variational multiscale method for the Navier–Stokes equations

A combination method of two-grid discretization approach with a recent finite element variational multiscale algorithm for simulation of the incompressible Navier–Stokes equations is proposed and analyzed. The method consists of a global small-scale nonlinear Navier–Stokes problem on a coarse grid and local linearized residual problems in overlapped fine grid subdomains, where the numerical form of the Navier–Stokes equations on the coarse grid is stabilized by a stabilization term based on two local Gauss integrations at element level and defined by the difference between a consistent and an under-integrated matrix involving the gradient of velocity. By the technical tool of local a priori estimate for the finite element solution, error bounds of the discrete solution are estimated. Algorithmic parameter scalings are derived. Numerical tests are also given to verify the theoretical predictions and demonstrate the effectiveness of the method.