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.

     

Local and parallel finite element algorithm for stationary incompressible magnetohydrodynamics

This article presents a local and parallel finite element method for the stationary incompressible magnetohydrodynamics problem. The key idea of this algorithm comes from the two‐grid discretization technique. Specifically, we solve the nonlinear system on a global coarse mesh, and then solve a series of linear problems on several subdomains in parallel. Furthermore, local a priori estimates are obtained on a general shape regular grid. The efficiency of the algorithm is also illustrated by some numerical experiments.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1513–1539, 2017     

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

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

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 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.     

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 stokes problem

Based on two-grid discretizations, some local and parallel finite element algorithms for the Stokes problem are proposed and analyzed in this paper. These algorithms are motivated by the observation that for a solution to the Stokes problem, 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. One technical tool for the analysis is some local a priori estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids. Y. He was partially subsidized by the NSF of China 10671154 and the National Basic Research Program under the grant 2005CB321703; A. Zhou was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic Research Program under the grant 2005CB321704; J. Li was partially supported by the NSF of China under the grant 10701001. J. Xu was partially supported by Alexander von Humboldt Research Award for Senior US Scientists, NSF DMS-0609727 and NSFC-10528102.     

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-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$.     

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.     

Multiscale finite element discretizations based on local defect correction for the biharmonic eigenvalue problem of plate buckling

In this paper, we study the multiscale finite element discretizations about the biharmonic eigenvalue problem of plate buckling. On the basis of the work of Dai and Zhou (SIAM J. Numer. Anal. 46[1] [2008] 295‐324), we establish a three‐scale scheme, a multiscale discretization scheme, and the associated parallel version based on local defect correction. We first prove a local priori error estimate of finite element approximations, then give the error estimates of multiscale discretization schemes. Theoretical analysis and numerical experiments indicate that our schemes are suitable and efficient for eigenfunctions with local low smoothness.     

基于二重网格的定常Navier-Stokes方程的局部和并行有限元算法

对二维定常的不可压缩的Navier-Stokes方程的局部和并行算法进行了研究．给出的算法是多重网格和区域分解相结合的算法,它是基于两个有限元空间:粗网格上的函数空间和子区域的细网格上的函数空间．局部算法是在粗网格上求一个非线性问题,然后在细网格上求一个线性问题,并舍掉内部边界附近的误差相对较大的解．最后,基于局部算法,通过有重叠的区域分解而构造了并行算法,并且做了算法的误差分析,得到了比标准有限元方法更好的误差估计,也对算法做了数值试验,数值结果通过比较验证了本算法的高效性和合理性．     

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.     

ERROR ESTIMATES FOR TWO-SCALE COMPOSITE FINITE ELEMENT APPROXIMATIONS OF NONLINEAR PARABOLIC EQUATIONS

We study spatially semidiscrete and fully discrete two-scale composite finite element method for approximations of the nonlinear parabolic equations with homogeneous Dirich-let boundary conditions in a convex polygonal domain in the plane.This new class of finite elements,which is called composite finite elements,was first introduced by Hackbusch and Sauter[Numer.Math.,75(1997),pp.447-472]for the approximation of partial differential equations on domains with complicated geometry.The aim of this paper is to introduce an efficient numerical method which gives a lower dimensional approach for solving par-tial differential equations by domain discretization method.The composite finite element method introduces two-scale grid for discretization of the domain,the coarse-scale and the fine-scale grid with the degrees of freedom lies on the coarse-scale grid only.While the fine-scale grid is used to resolve the Dirichlet boundary condition,the dimension of the finite element space depends only on the coarse-scale grid.As a consequence,the resulting linear system will have a fewer number of unknowns.A continuous,piecewise linear composite finite element space is employed for the space discretization whereas the time discretization is based on both the backward Euler and the Crank-Nicolson methods.We have derived the error estimates in the L∞(L2)-norm for both semidiscrete and fully discrete schemes.Moreover,numerical simulations show that the proposed method is an efficient method to provide a good approximate solution.     

A parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem

In this paper, based on a two-grid method and a recent local and parallel finite element method, a parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem is proposed and analyzed. This method ensures that all the local subproblems on the fine grid can be solved in parallel. Optimal error bounds of the approximate solution are obtained. Finally, numerical experiments are presented to demonstrate the accuracy and effectiveness of the proposed method.     

Three-scale finite element eigenvalue discretizations

Some three-scale finite element discretization schemes are proposed and analyzed in this paper for a class of elliptic eigenvalue problems on tensor product domains. With these schemes, the solution of an eigenvalue problem on a fine grid may be reduced to the solutions of eigenvalue problems on a relatively coarse grid and some partially mesoscopic grids, together with the solutions of linear algebraic systems on a globally mesoscopic grid and several partially fine grids. It is shown theoretically and numerically that this type of discretization schemes not only significantly reduce the number of degrees of freedom but also produce very accurate approximations. AMS subject classification (2000)  65N15, 65N25, 65N30, 65N50     

Two grid finite element discretization method for semi‐linear hyperbolic integro‐differential equations

In this paper, we will investigate a two grid finite element discretization method for the semi‐linear hyperbolic integro‐differential equations by piecewise continuous finite element method. In order to deal with the semi‐linearity of the model, we use the two grid technique and derive that once the coarse and fine mesh sizes H, h satisfy the relation h = H² for the two‐step two grid discretization method, the two grid method achieves the same convergence accuracy as the ordinary finite element method. Both theoretical analysis and numerical experiments are given to verify the results.     

Discontinuous Galerkin finite element method for a nonlinear boundary value problem

In this paper, we investigate the a priori and a posteriori error estimates for the discontinuous Galerkin finite element approximation to a regularization version of the variational inequality of the second kind. We show the optimal error estimates in the DG-norm （stronger than the H1 norm） and the L2 norm, respectively. Furthermore, some residual-based a posteriori error estimators are established which provide global upper bounds and local lower bounds on the discretization error. These a posteriori analysis results can be applied to develop the adaptive DG methods.     

非定常的热传导-对流问题的非线性Galerkin混合元法(Ⅱ):向后一步的Euler全离散化格式

1．引言本文的工作主要是讨论非定常的热传导一对流问题的向后一步的Euler全离散化的非线性Galerkin混合元解的存在性及其误差估计．该工作是对山中的同一问题研究的第二部分．在第一部分［1］，我们已经讨论了此问题的半离散化的情形．由于所研究的目标都是非定常的热传导一对流问题，其背景是相同的，在此将不重复了，请参考［1］．本文的安排如下，52先回顾非定常的热传导一对流问题的混合元解的经典性质．53回顾半离散化的非线性Galerkin混合元解的性质，并导出后续讨论需要的一些关于时间导数的估计．54讨论向后一步的Euler全离散化…     

On a parallel multilevel solver for linear elasticity problems

In this paper an application of the additive multilevel iteration method to parallel solving of large‐scale linear elasticity problems is considered. The results are derived in the framework of the hierarchical basis finite element discretization defined on a tensor product of one‐dimensional grid and a sequence of nested triangulations . The algorithm was tested on a number of model problems, arising from bridge foundation modeling. Parallel performance of the solver is reported for Cray T3E‐600 and Sun ES/4000 computer systems. Copyright © 1999 John Wiley & Sons, Ltd.