An almost fourth order uniformly convergent domain decomposition method for a coupled system of singularly perturbed reaction-diffusion equations

We consider a system of M(≥2) singularly perturbed equations of reaction-diffusion type coupled through the reaction term. A high order Schwarz domain decomposition method is developed to solve the system numerically. The method splits the original domain into three overlapping subdomains. On two boundary layer subdomains we use a compact fourth order difference scheme on a uniform mesh while on the interior subdomain we use a hybrid scheme on a uniform mesh. We prove that the method is almost fourth order ε-uniformly convergent. Furthermore, we prove that when ε is small, one iteration is sufficient to get almost fourth order ε-uniform convergence. Numerical experiments are performed to support the theoretical results.     

A parameter-uniform Schwarz method for a coupled system of reaction–diffusion equations

We consider an arbitrarily sized coupled system of one-dimensional reaction–diffusion problems that are singularly perturbed in nature. We describe an algorithm that uses a discrete Schwarz method on three overlapping subdomains, extending the method in [H. MacMullen, J.J.H. Miller, E. O’Riordan, G.I. Shishkin, A second-order parameter-uniform overlapping Schwarz method for reaction-diffusion problems with boundary layers, J. Comput. Appl. Math. 130 (2001) 231–244] to a coupled system. On each subdomain we use a standard finite difference operator on a uniform mesh. We prove that when appropriate subdomains are used the method produces ε-uniform results. Furthermore we improve upon the analysis of the above-mentioned reference to show that, for small ε, just one iteration is required to achieve the expected accuracy.     

无界区域上基于自然边界归化的一种重叠型区域分解法及其离散化

1．引言由于科学技术的迅猛发展，人们遇到许多大规模科学和工程计算问题．随着并行计算机的出现和应用，并行技术越来越得到人们的重视和研究．区域分解法成为并行计算和处理这类问题的主要方法之一．但是，对于无界区域上的椭圆边值问题，因进行区域分解后至少有一个区域仍为无界区域，故仅应用通常的区域分解算法求解是不够的．由于边界归化是处理无界区域问题的有效手段，通常采用边界元和有限元耦合的方法求解此类问题IZ，6。8。121．或片什适当的人工边界并在此边界上加近似边界条件，再在有限区域应用有限元方法求解【人习．近年来…     

利用自然边界归化求解平面弹性方程外边值问题的SCHWARZ算法

1引言平面弹性方程在水利土建等工程技术领域有着广泛应用．其中,孔边应力集中等问题,都是无界区域问题．我们可以通过各种实验手段研究上述问题．而随着计算机和有限元技术的迅猛发展,数值解法提供了一种研究上述问题的有效途径．对于有界区域上的平面弹性方程,我们可以直接利用有限元方法求解,对于其中的大规模问题可以利用区域分解和并行技术求解．但这些方法难以处理无界区域问题．虽然对于某些典型区域上的外问题（例如,圆孔外区域和＿些规则形状裂纹）可以针对具体情况利用复变函数论方法予以解决,但对于一般的无界区域问题广…     

Parallel split least‐squares mixed finite element method for parabolic problem

Based on overlapping domain decomposition, a new class of parallel split least‐squares (PSLS) mixed finite element methods is presented for solving parabolic problem. The algorithm is fully parallel. In the overlapping domains, the partition of unity is applied to distribute the corrections reasonably, which makes that the new method only needs one or two iteration steps to reach given accuracy at each time step while the classical Schwarz alternating methods need many iteration steps. The dependence of the convergence rate on the spacial mesh size, time increment, iteration times, and subdomains overlapping degree is analyzed. Some numerical results are reported to confirm the theoretical analysis.     

A domain decomposition preconditioner for steady groundwater flow in porous media

In this paper an algorithm is presented based on the additive Schwarz method for steady groundwater flow in a porous medium. The subproblems in the algorithm correspond to the problem on a coarse grid and some overlapping subdomains. It will be shown that the rate of convergence is independent of the mesh parameters and discontinuities of the coefficients, and depends on the overlap ratio.     

Overlapping Schwarz methods on unstructured meshes using non-matching coarse grids

Summary. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures that constitute the whole domain, so the substructures can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved, and neither the coarse mesh nor the fine mesh need be quasi-uniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate as the usual two level overlapping domain decomposition methods on structured meshes. The condition number of the preconditioned system depends only on the (possibly small) overlap of the substructures and the size of the coarse grid, but is independent of the sizes of the subdomains. Received March 23, 1994 / Revised version received June 2, 1995     

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     

无界区域上基于自然边界归化的双调和方程的一种重叠型区域分解法

1．引言双调和方程边值问题的一个力学背景是薄板弯曲问题．对于有界区域上的双调和方程，可以直接利用协调元和非协调元求解18，10］．我们考虑双调和方程Dirichlet外边值问题其中0是充分光滑闭曲线ro之外的无界区域，naro关于0的单位外法向量．引理1．且卜］．若。0EH’／‘（几），gEH‘／‘（fo），则问题（1．1）在W0z（fi）中有唯一解·这里由迹定理，可找到一个具有紧支集的函数识。。，g）E护（炉）满足可。0；g）【F。＝。0和则问题（1．1）等价于如下齐次边值问题其中f—一面‘B有紧支集．边值问题（工．2）又可转化为变分问…     

Two-level Additive Schwarz Preconditioners for Nonconforming Finite Element Methods

Two-level additive Schwarz preconditioners are developed for the nonconforming P1 finite element approximation of scalar second-order symmetric positive definite elliptic boundary value problems, the Morley finite element approximation of the biharmonic equation, and the divergence-free nonconforming P1 finite element approximation of the stationary Stokes equations. The condition numbers of the preconditioned systems are shown to be bounded independent of mesh sizes and the number of subdomains in the case of generous overlap.

     

Overlapping Schwarz Waveform Relaxation for the Heat Equation in N Dimensions

We analyze overlapping Schwarz waveform relaxation for the heat equation in n spatial dimensions. We prove linear convergence of the algorithm on unbounded time intervals and superlinear convergence on bounded time intervals. In both cases the convergence rates are shown to depend on the size of the overlap. The linear convergence result depends also on the number of subdomains because it is limited by the classical steady state result of overlapping Schwarz for elliptic problems. However the superlinear convergence result is independent of the number of subdomains. Thus overlapping Schwarz waveform relaxation does not need a coarse space for robust convergence independent of the number of subdomains, if the algorithm is in the superlinear convergence regime. Numerical experiments confirm our analysis. We also briefly describe how our results can be extended to more general parabolic problems.     

Optimal defect corrections on composite nonmatching finite-element meshes

Ahmed-Salah Chibi ^{In this paper, we analyse the ‘defect-correction’technique on a general smooth region, via composite finite-elementmeshes (a Cartesian mesh and a polar mesh) on two overlappingsubdomains (a rectangle and an annulus). Boundary interpolatorymappings of higher degree are used, in the Schwarz method, topass from one mesh to another. An explicit relation is givenbetween the degree of these mappings and the number of optimalcorrections to be computed. Optimal convergence results forthe discrete bilinear basic solution, in higher-order discreteSobolev norms, are obtained on the subdomains. Because the successof the defect-correction technique is based on the uniformityof the discretization and the regularity of the exact solution,the defects are computed on the subdomains in the same way asfor the basic solution. Optimal O(h2) improvement per correctionis obtained. Numerical results are presented to support thetheory.}     

Schwarz methods with local refinement for the p-version finite element method

Summary. In some applications, the accuracy of the numerical solution of an elliptic problem needs to be increased only in certain parts of the domain. In this paper, local refinement is introduced for an overlapping additive Schwarz algorithm for the $-version finite element method. Both uniform and variable degree refinements are considered. The resulting algorithm is highly parallel and scalable. In two and three dimensions, we prove an optimal bound for the condition number of the iteration operator under certain hypotheses on the refinement region. This bound is independent of the degree $, the number of subdomains $ and the mesh size $. In the general two dimensional case, we prove an almost optimal bound with polylogarithmic growth in $. Received February 20, 1993 / Revised version received January 20, 1994     

A two-level additive Schwarz preconditioner for nonconforming plate elements

Summary. A two-level additive Schwarz preconditioner is developed for the systems resulting from the discretizations of the plate bending problem by the Morley finite element, the Fraeijs de Veubeke finite element, the Zienkiewicz finite element and the Adini finite element. The condition numbers of the preconditioned systems are shown to be bounded independent of mesh sizes and the number of subdomains in the case of a generous overlap. Received February 1, 1994 / Revised version received October 24, 1994     

THE MORTAR ELEMENT METHOD FOR A NONLINEAR BIHARMONIC EQUATION

The mortar element method is a new domain decomposition method（DDM） with nonoverlapping subdomains. It can handle the situation where the mesh on different subdomains need not align across interfaces, and the matching of discretizations on adjacent subdomains is only enforced weakly. But until now there has been very little work for nonlinear PDEs. In this paper, we will present a mortar-type Morley element method for a nonlinear biharmonic equation which is related to the well-known Navier-Stokes equation. Optimal energy and H^1-norm estimates are obtained under a reasonable elliptic regularity assumption.     

Splitting a Concave Domain to Convex Subdomains

1.IntroductionTurninglargescaleproblemtosmallscalesubproblemsandregularizingirregularproblemaretwomainsubjectsofdomaindecomposition.Inregularization,regularizingirregularregionisoffirstimportance.Irregularityoftenmeansconcavity,forexample,L-shaped,T--shapedandC-shapeddomainsareirregulardomains.Inthispaperswewillstudydomaindecompositionmethodforellipticproblemsdefinedonirregularregion.SchwarzalternatingInethodisthebasisofalmostalldomaindecompositionmethoddeveloped.Othermethodsarevariationsof…     

The Neumann-Dirichlet domain decomposition method with inexact solvers on the subdomains

Summary We consider the Neumann-Dirichlet domain decomposition method for the solution of linear elliptic boundary value problems. We study the following question. Suppose that the auxiliary problems on the subdomains are not solved exactly, but only with a fixed, mesh size independent accuracy. Does the speed of convergence remain mesh size independently bounded? We show that the answer is no in general, but that mesh size independent convergence can be obtained if the accuracy requirement on the subsolvers becomes increasingly severe as the mesh size tends to zero.     

Additive Schwarz Method for Mortar Discretization of Elliptic Problems with <Emphasis Type="Italic">P</Emphasis><Subscript>1</Subscript> Nonconforming Finite Elements

An additive Schwarz preconditioner for nonconforming mortar finite element discretization of a second order elliptic problem in two dimensions with arbitrary large jumps of the discontinuous coefficients in subdomains is described. An almost optimal estimate of the condition number of the preconditioned problem is proved. The number of preconditioned conjugate gradient iterations is independent of jumps of the coefficients and is proportional to (1+log(H/h)), where H,h are mesh sizes. AMS subject classification (2000) 65N55, 65N30, 65N22     

A two-level additive Schwarz preconditioner for the stationary Stokes equations

We consider the stationary Stokes equations on a polygonal domain whose boundary has more than one component, i.e., flow with obstacles. A two-level additive Schwarz preconditioner is developed for the divergence-free nonconforming P1 finite element. The condition number of the preconditioned system is shown to be bounded independent of mesh sizes and the number of subdomains in the case of generous overlap.This work was supported in part by the National Science Foundation under Grant Nos. DMS-92-09332 and DMS-94-96275.     

An overlapping domain decomposition preconditioner for a class of discontinuous Galerkin approximations of advection-diffusion problems

We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.