一种迭代格式的有限元并行算法*

本文提出了一种求解有限元方程的迭代格式的并行算法.该方法在线性代数方程迭代解法的基础上,引进并行运算步骤;并且运用加权残数方法,通过选择适当的权函数,推导了该并行算法的有限元基本格式.该方法在西安交通大学BLXSI-6400并行计算机上程序实现.计算结果表明它能有效地提高运算速度,减少计算时间,是一种有效的求解大型结构有限元方程的并行算法.     

半导体器件瞬态模拟的对称正定混合元方法

提出具有对称正定特性的混合元格式求解非稳态半导体器件瞬态模拟问题。提出一个最小二乘混合元方法、一个新的具有分裂和对称正定性质的混合元格式和一个解经典混合元方程的对称正定失窃工格式求解电场位势和电场强度方程;提出一个最小二乘混合元格式求解关于电子与空穴浓度的非稳态对流扩散方程,浓度函数和流函数被同时求解;采用标准的有限元方法求解热传导方程。建立了误差分析理论。     

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

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

MULTIGRID METHODS FOR THE GENERALIZED STOKES EQUATIONS BASED ON MIXED FINITE ELEMENT METHODS

1. IntroductionIn this paper, we consider the fOllowing generalized stationary Stokes equations:where fl is a bounded convex domain in R', u represents the velocity of fluid, p its pressure; Fand G are external fOrce and source terms. Note that the source…     

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     

Local and parallel finite element methods for the coupled Stokes/Darcy model

Numerical Algorithms - In this paper, based on two-grid discretizations, two kinds of local and parallel finite element methods are proposed and investigated for the coupled Stokes/Darcy model....     

Parallel algorithm combined with mixed element procedure for compressible miscible displacement problem

Based on overlapping domain decomposition, we construct a parallel mixed finite element algorithm for solving the compressible miscible displacement problem in porous media. The algorithm is fully parallel. We consider the relation between the convergence rate and discretization parameters, including the overlapping degree of the subspaces. We give the corresponding error estimate, which tells us that only two iterations are needed to reach to given accuracy at each time level. Numerical results are presented to confirm our theoretical analysis.     

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.     

A new mixed finite element method for the Stokes problem

We propose a new mixed formulation of the Stokes problem where the extra stress tensor is considered. Based on such a formulation, a mixed finite element is constructed and analyzed. This new finite element has properties analogous to the finite volume methods, namely, the local conservation of the momentum and the mass. Optimal error estimates are derived. For the numerical implementation of this finite element, a hybrid form is presented. This work is a first step towards the treatment of viscoelastic fluid flows by mixed finite element methods.     

An optimally convergent adaptive mixed finite element method

We prove convergence and optimal complexity of an adaptive mixed finite element algorithm, based on the lowest-order Raviart–Thomas finite element space. In each step of the algorithm, the local refinement is either performed using simple edge residuals or a data oscillation term, depending on an adaptive marking strategy. The inexact solution of the discrete system is controlled by an adaptive stopping criterion related to the estimator.     

New adaptive mixed finite element method (AMFEM)

The need to develop reliable and efficient adaptive algorithms using mixed finite element methods arises from various applications in fluid dynamics and computational continuum mechanics. In order to save degrees of freedom, not all but just some selected set of finite element domains are refined and hence the fundamental question of convergence requires a new mathematical argument as well as the question of optimality. We will present a new adaptive algorithm for mixed finite element methods to solve the model Poisson problem, for which optimal convergence can be proved. The a posteriori error control of mixed finite element methods dates back to Alonso (1996) Error estimators for a mixed method. and Carstensen (1997) A posteriori error estimate for the mixed finite element method. The error reduction and convergence for adaptive mixed finite element methods has already been proven by Carstensen and Hoppe (2006) Error Reduction and Convergence for an Adaptive Mixed Finite Element Method, Convergence analysis of an adaptive nonconforming finite element methods. Recently, Chen, Holst and Xu (2008) Convergence and Optimality of Adaptive Mixed Finite Element Methods. presented convergence and optimality for adaptive mixed finite element methods following arguments of Rob Stevenson for the conforming finite element method. Their algorithm reduces oscillations, before applying and a standard adaptive algorithm based on usual error estimation. The proposed algorithm does this in a natural way, by switching between the reduction of either the estimated error or oscillations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.     

A combined mixed finite element ADI scheme for solving Richards' equation with mixed derivatives on irregular grids

We propose and analyze an efficient numerical method for solving semilinear parabolic problems with mixed derivative terms on non-rectangular domains. The spatial semidiscretization process is based on an expanded mixed finite element scheme which, combined with suitable quadrature rules, is converted into a cell-centered finite difference scheme. This choice preserves the asymptotic accuracy and local conservation of mass of the method, while substantially reducing the computational cost of the totally discrete scheme. To obtain it, an alternating direction implicit scheme is used for the integration in time. The resulting numerical algorithm involves sets of uncoupled tridiagonal systems which can be solved in parallel. We set out some theoretical results of unconditional convergence (of second order in space and first order in time) for our method. Finally, a numerical experiment is shown in order to illustrate the theoretical results.     

Local and parallel finite element algorithm based on the partition of unity method for the incompressible MHD flow

Based on the partition of unity method (PUM), a local and parallel finite element method is designed and analyzed for solving the stationary incompressible magnetohydrodynamics (MHD). The key idea of the proposed algorithm is to first solve the nonlinear system on a coarse mesh, divide the globally fine grid correction into a series of locally linearized residual problems on some subdomains derived by a class of partition of unity, then compute the local subproblems in parallel, and obtain the globally continuous finite element solution by assembling all local solutions together by the partition of unity functions. The main feature of the new method is that the partition of unity provide a flexible and controllable framework for the domain decomposition. Finally, the efficiency of our theoretical analysis is tested by numerical experiments.     

A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid (http: //lsec. cc. ac. cn/phg/J, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the bisectioning refinement procedure.AMS subject classifications: 65Y05, 65N50     

Two-level stabilized nonconforming finite element method for the Stokes equations

In this article, we present a new two-level stabilized nonconforming finite elements method for the two dimensional Stokes problem. This method is based on a local Gauss integration technique and the mixed nonconforming finite element of the NCP ₁ — P ₁ pair (nonconforming linear element for the velocity, conforming linear element for the pressure). The two-level stabilized finite element method involves solving a small stabilized Stokes problem on a coarse mesh with mesh size H and a large stabilized Stokes problem on a fine mesh size h = H/3. Numerical results are presented to show the convergence performance of this combined algorithm.     

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.

     

Parallel implementation of the p‐version of the finite element method for elliptic equations on a shared‐memory architecture

An implementation of the p‐version of the finite element method for solving two‐dimensional linear elliptic problems on a shared‐memory parallel computer is analyzed. The idea is to partition the problem among the available processors and perform computations corresponding to different elements in parallel. The parallelization is based on a domain decomposition technique using the Lagrange multipliers. The numerical experiments carried out on the Sequent system indicate very high performance of the mixed finite element algorithm in terms of attained speedups. This revised version was published online in August 2006 with corrections to the Cover Date.     

A PARALLEL ITERATIVE DOMAIN DECOMPOSITION ALGORITHM FOR ELLIPTIC PROBLEMS

1.IntroductionNolloverlappillgdomaindecolllpositionnletllodshavereceivedalotofattentionlenlsilllldallowefficielltparallelisnl.F'Orarecentdevelopmelltofthesemethods,werefertot…     

Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems,part I: Algorithms and numerical results

Summary We describe sequential and parallel algorithms based on the Schwarz alternating method for the solution of mixed finite element discretizations of elliptic problems using the Raviart-Thomas finite element spaces. These lead to symmetric indefinite linear systems and the algorithms have some similarities with the traditional block Gauss-Seidel or block Jacobi methods with overlapping blocks. The indefiniteness requires special treatment. The sub-blocks used in the algorithm correspond to problems on a coarse grid and some overlapping subdomains and is based on a similar partition used in an algorithm of Dryja and Widlund for standard elliptic problems. If there is sufficient overlap between the subdomains, the algorithm converges with a rate independent of the mesh size, the number of subdomains and discontinuities of the coefficients. Extensions of the above algorithms to the case of local grid refinement is also described. Convergence theory for these algorithms will be presented in a subsequent paper.This work was supported in part by the National Science Foundation under Grant NSF-CCR-8903003, while the author was a graduate student at New York University, and in part by the Army Research Office under Grant DAAL 03-91-G-0150, while the author was a Visiting Assistant Researcher at UCLA