非定常对流扩散方程的局部和并行有限元算法

对基于两重网格的非定常对流扩散方程的局部和并行有限元算法进行了研究.算法的理论依据是两重网格的思想,解的低频分量可以用一个整体的粗网格空间来逼近,高频分量可以用局部和并行的细网格空间来逼近.因此,这种局部和并行算法仅仅涉及一个粗网格上的整体逼近和细网格上的局部校正.得到了算法的误差估计,一些数值例子验证了算法的有效性.     

不可压缩流动的并行数值方法

不可压缩流动的数值模拟是计算流体力学的重要组成部分. 基于有限元离散方法, 本文设计了不可压缩Navier-Stokes (N-S)方程支配流的若干并行数值算法. 这些并行算法可归为两大类: 一类是基于两重网格离散方法, 首先在粗网格上求解非线性的N-S方程, 然后在细网格的子区域上并行求解线性化的残差方程, 以校正粗网格的解; 另一类是基于新型完全重叠型区域分解技巧, 每台处理器用一局部加密的全局多尺度网格计算所负责子区域的局部有限元解. 这些并行算法实现简单, 通信需求少, 具有良好的并行性能, 能获得与标准有限元方法相同收敛阶的有限元解. 理论分析和数值试验验证了并行算法的高效性     

Navier-Stokes方程的一种并行两水平有限元方法

基于区域分解技巧,提出了一种求解定常Navier-Stokes方程的并行两水平有限元方法．该方法首先在一粗网格上求解Navier-Stokes方程,然后在细网格的子区域上并行求解粗网格解的残差方程,以校正粗网格解．该方法实现简单,通信需求少．使用有限元局部误差估计,推导了并行方法所得近似解的误差界,同时通过数值算例,验证了其高效性．     

Navier-Stokes方程流函数形式两重网格算法的误差分析

对定常Navier-Stokes方程流函数形式两重网格有限元算法进行了误差分析。此方法包括在粗网格上求解一个非线性问题，在细网格上求解一个线性问题，然后再在粗网格上求解一个线性校正问题。分析了包括校正项和不包括校正项两种方法的误差，得出对于任意固定的Beynolds数，能达到最优逼近阶。     

定常Navier-Stokes方程的一种高效稳定有限元方法

提出了二维定常Navier-Stokes(N-S)方程的一种两层稳定有限元方法.该方法基于局部高斯积分技术,通过不满足inf-sup条件的低次等阶有限元对N-S方程进行有限元求解.该方法在粗网格上解定常N-S方程,在细网格上只需解一个Stokes方程.误差分析和数值试验都表明:两层稳定有限元方法与直接在细网格上采用的传统有限元方法得到的解具有同阶的收敛性,但两层稳定有限元方法节省了大量的工作时间.     

非定常不可压Navier-Stokes方程两重网格方法的稳定性和L2误差估计

讨论了二维非定常不可压Navier-Stokes方程的两重网格方法．此方法包括在粗网格上求解一个非线性问题,在细网格上求解一个Stokes问题．采用一种新的全离散(时间离散用Crank-Nicolson格式,空间离散用混合有限元方法)格式数值求解N-S方程．证明了该全离散格式的稳定性．给出了L2误差估计．对比标准有限元方法,在保持同样精度的前提下,TGM能节省大量的计算量．     

服从OldroydB型微分模型的粘弹性流体问题的数值解法

本文对服从OldroydB型微分模型的粘弹性流体问题给出了一种数值逼近算法．该算法对压力方程采用标准混合有限元方法,对速度方程采用并行非重叠区域分解方法和特征线法．这种并行算法在子区域上用Galerkin方法,通过积分平均方法显式地给出内边界的数值流．在本文最后还给出了该算法的最优L^2。一误差估计．     

加罚Navier—Stokes方程的最佳非线性Galerkin算法

该文提出了求解二维加罚Navier-Stokes方程的最佳非线性Galerkin算法．这个算法在于在粗网格有限元空间上求解一非线性子问题，在细网格增量有限元空间Wh上求解一线性子问题．如果线性有限元被使用及，则该算法具有和有限元Galerkin算法同阶的收敛速度．然而该文提出的算法可以节省可观的计算时间．     

定常Stokes方程一种基于完全区域分解的有限元并行算法

基于完全区域分解技巧,提出了一种求解定常Stokes方程的有限元并行算法．该算法中,所有子问题都是定义在整个求解区域上,但绝大部分自由度来自其所负责的子区域,从而使得算法稍加修改现有的串行程序即可实现相应的并行计算,实现简单,通信需求少．数值结果验证了算法的高效性．     

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

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

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

LOCAL AND PARALLEL FINITE ELEMENT ALGORITHMS FOR THE NAVIER-STOKES PROBLEM

Based on two-grid discretizations, in this paper, some new local and parallel finiteelement algorithms are proposed and analyzed for the stationary incompressible Navier-Stokes problem. These algorithms are motivated by the observation that for a solutionto the Navier-Stokes problem, low frequency components can be approximated well by arelatively coarse grid and high frequency components can be computed on a fine grid bysome local and parallel procedure. One major technical tool for the analysis is some locala priori error estimates that are also obtained in this paper for the finite element solutionson general shape-regular grids.     

Parallel solution of elasticity problems using overlapping aggregations

The finite element (FE) solution of geotechnical elasticity problems leads to the solution of a large system of linear equations. For solving the system, we use the preconditioned conjugate gradient (PCG) method with two-level additive Schwarz preconditioner. The preconditioning is realised in parallel. A coarse space is usually constructed using an aggregation technique. If the finite element spaces for coarse and fine problems on structural grids are fully compatible, relations between elements of matrices of the coarse and fine problems can be derived. By generalization of these formulae, we obtain an overlapping aggregation technique for the construction of a coarse space with smoothed basis functions. The numerical tests are presented at the end of the paper.     

Two-grid stabilized algorithms for the steady Navier–Stokes equations with damping

This paper presents and studies three two-grid stabilized quadratic equal-order finite element algorithms based on two local Gauss integrations for the steady Navier–Stokes equations with damping. In these algorithms, we first solve a stabilized nonlinear problem on a coarse grid, and then pass the coarse grid solution to a fine grid and solve a stabilized linear problem. Using some nonlinear analysis techniques, we analyze stability of the algorithms and derive optimal order error estimates of the approximate solutions. Theoretical and numerical results show that, when the algorithmic parameters are chosen appropriately, the accuracy of the approximate solutions computed by our two-grid stabilized algorithms is comparable to that of solving a fully stabilized nonlinear problem on the same fine grid; however, our two-grid algorithms save a large amount of CPU time than the one-grid stabilized algorithm.     

Two-level multiscale finite element methods for the steady navier-stokes problem

In this article, on the basis of two-level discretizations and multiscale finite element method, two kinds of finite element algorithms for steady Navier-Stokes problem are presented and discussed. The main technique is first to use a standard finite element discretization on a coarse mesh to approximate low frequencies, then to apply the simple and Newton scheme to linearize discretizations on a fine grid. At this process, multiscale finite element method as a stabilized method deals with the lowest equal-order finite element pairs not satisfying the inf-sup condition. Under the uniqueness condition, error analyses for both algorithms are given. Numerical results are reported to demonstrate the effectiveness of the simple and Newton scheme.     

TWO-LEVEL MULTISCALE FINITE ELEMENT METHODS FOR THE STEADY NAVIER-STOKES PROBLEM

In this article, on the basis of two-level discretizations and multiscale finite element method, two kinds of finite element algorithms for steady Navier-Stokes problem are presented and discussed. The main technique is first to use a standard finite element discretization on a coarse mesh to approximate low frequencies, then to apply the simple and Newton scheme to linearize discretizations on a fine grid. At this process, multiscale finite element method as a stabilized method deals with the lowest equal-order finite element pairs not satisfying the inf-sup condition. Under the uniqueness condition, error analyses for both algorithms are given. Numerical results are reported to demonstrate the effectiveness of the simple and Newton scheme.     

Local and parallel finite element algorithms based on two-grid discretizations for the transient Stokes equations

Based on two-grid discretizations, some local and parallel finite element algorithms for the d-dimensional (d = 2,3) transient Stokes equations are proposed and analyzed. Both semi- and fully discrete schemes are considered. With backward Euler scheme for the temporal discretization, the basic idea of the fully discrete finite element algorithms is to approximate the generalized Stokes equations using a coarse grid on the entire domain, then correct the resulted residue using a finer grid on overlapped subdomains by some local and parallel procedures at each time step. By the technical tool of local a priori estimate for the fully discrete finite element solution, errors of the corresponding solutions from these algorithms are estimated. Some numerical results are also given which show that the algorithms are highly efficient.     

Local and Parallel Finite Element Algorithms Based on Two-Grid Discretizations for Nonlinear Problems

In this paper, some local and parallel discretizations and adaptive finite element algorithms are proposed and analyzed for nonlinear elliptic boundary value problems in both two and three dimensions. The main technique is to use a standard finite element discretization on a coarse grid to approximate low frequencies and then to apply some linearized discretization on a fine grid to correct the resulted residual (which contains mostly high frequencies) by some local/parallel procedures. The theoretical tools for analyzing these methods are some local a priori and a posteriori error estimates for finite element solutions on general shape-regular grids that are also obtained in this paper.     

Local and parallel finite element algorithms based on two-grid discretizations

A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. The theoretical tools for analyzing these methods are some local a priori and a posteriori estimates that are also obtained in this paper for finite element solutions on general shape-regular grids. Some numerical experiments are also presented to support the theory.