A non-conforming domain decomposition for Raviart-Thomas vector fields in three dimensions

In this paper we are concerned with a domain decomposition method with non-matching grids for Raviart-Thomas finite elements. In this method, the normal complement of the resulting approximation is not continuous across the interface. To handle such non-conformity, a new matching condition will be introduced. Such matching condition still results in a symmetric and positive definite stiffness matrix. It will be shown that the approximate solution generated by the domain decomposition possesses the optimal energy error estimate.     

Lagrangian乘子区域分解法的一类预条件子

1．引言非重叠区域分解的Lagrangian乘子法已被许多作者讨论［1今它是一类非协调区域分解法（与通常的非协调元区域分解不同），特别适合于非匹配网格的情形（即相邻子域在公共边或公共面上的结点不重合，参见14］［6］）．这种方法的一个最大优点是不要求界面变量在内交点（或内交边）上的连续性，从而界面方程易于建立，程序易于实现，而又正因为这个特点，使得界面矩阵的预条件子不能按通常的方法构造，故目前还未见到理想的预条件子（或者条件数差，或者应用上不方便）．本文在很大程度上解决了这一问题．1）工作单位：湘潭大学数学系…     

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.     

On Schwarz's domain decomposition methods for elliptic boundary value problems

Summary. We study the additive and multiplicative Schwarz domain decomposition methods for elliptic boundary value problem of order 2 r based on an appropriate spline space of smoothness . The finite element method reduces an elliptic boundary value problem to a linear system of equations. It is well known that as the number of triangles in the underlying triangulation is increased, which is indispensable for increasing the accuracy of the approximate solution, the size and condition number of the linear system increases. The Schwarz domain decomposition methods will enable us to break the linear system into several linear subsystems of smaller size. We shall show in this paper that the approximate solutions from the multiplicative Schwarz domain decomposition method converge to the exact solution of the linear system geometrically. We also show that the additive Schwarz domain decomposition method yields a preconditioner for the preconditioned conjugate gradient method. We tested these methods for the biharmonic equation with Dirichlet boundary condition over an arbitrary polygonal domain using cubic spline functions over a quadrangulation of the given domain. The computer experiments agree with our theoretical results. Received December 28, 1995 / Revised version received November 17, 1998 / Published online September 24, 1999     

Weighted matching as a generic pruning technique applied to optimization constraints

We study the application of matching theory within a constraint programming framework. In this work we describe a filtering scheme based on weighted matchings. A first benefit of our pruning technique comes from the fact that it can be applied on various optimization constraints. In a number of important cases our method achieves domain consistency in polynomial time. A key feature in our implementation is the use of decomposition theory. The paper compares some of the optimization constraints reported in the literature and shows how they can be solved with the help of the weighted matching.     

抛物问题的拉格朗日乘子区域分解法

１．引言 近年来,一类新的非重叠区域分解方法一非匹配网格区域分解法,日益引起人们的广泛兴趣,并已成为当今区域分解方法研究的热门课题。这类区域分解方法的特点是：相邻子区域在公共边（或面）上的结点可以不重合,从而能解决许多传统区域分解方法不便解决的问题（如变动网格问题）．目前主要有两类方法来处理这种区域分解的强非协调性：Ｍｏｒｔａｒ无法（见［１－２］和［９－１０］）和拉格朗日乘子法（见［５］,［８］,［１１］和［１２］）．拉格朗日乘子法比Ｍｏｒｔａｒ无法有明显的优点：（１）界面变量（即拉格朗日乘子）…     

抛物问题的拉格朗日乘子区域分解法

In this paper we consider domain decomposition methods with Lagrangian multipliers, which are applied to solving parabolic problems. We shall estimate condition numbers of the resulting interface matrices, and construct two kinds of simple preconditioners for the corresponding interface equations. It will be shown that the condition numbers of the resulting preconditioned interface matrices are almost optimal.     

杂交有限元的区域分解法

近几年来,由于并行计算机的迅速发展,求解椭圆型微分方程的区城分解法又引起了人们的重视.这一方法的基本思想是把求解区域分解成许多子区域,每个子区域上用一台计算机求解.这种方法适应并行机的需要,是用并行机解大型椭圆型偏微分方程的一     

CONSTRUCTION OF A PRECONDITIONER FOR DOMAIN DECOMPOSITION METHODS WITH POLYNOMIAL LAGRANGIAN MULTIPLIERS

1. IntroductionIn recent years the non-overlapping domain decomposition methods (DDMs) with nonmatching grids have attracted particular attention of computional eXPerts and engineers (see[1]--[9]). This kind of DDM allows non--coincidence of nodal points at common edges (or commonfaces) of two neighbouring subdomains. Thus it can be applied to solving the problems ofchanging meshes (for example, the multi-body contact problems in solid mechanics an'd therelative motion problems in oil explo…     

依赖时间的Lagrange乘子区域分解法的显式格式

１．引言 近年来,一类新的区域分解法－非匹配网格区域分解法,日益引起人们的广泛兴趣．这类区域分解法的特点是：相邻子区域在公共边（或面）上的结点可以不重合,从而可方便地处理匹配网格区域分解法难以处理的问题：变动网格问题（例如石油勘探中的地层错动问题）和最优网格设计问题（即根据解的性质和实际问题的要求在不同子区域上采用不同的单元类型,不同的网格尺寸和不同阶的逼近多项式）． 在这类区域分解的算法设计中面临着两个困难：界面上非协调性的处理（与通常的协调元不同）和界面上积分的有效计算．现有算法中较引人注目的…     

Studies of an interface relaxation domain decomposition technique using finite elements on a parallel computer

Studies are presented for an interface relaxation domain decomposition technique using finite elements on an iPSC/2 D5 Hypercube Concurrent computer. The general type of problem to be solved is one governed by a partial differential equation. The application of the approach, however, will be extended to a free boundary value problem by appropriate modification of the numerical scheme. Using the domain decomposition technique, the computation domain is subdivided into several subdomains. In addition, on the interfaces between two adjacent subdomains are imposed a continuity condition on one side and an equilibrium condition on the other side. Successive overrelaxation iterative processes are then carried out in all subdomains with a relaxation process imposed on the interfaces. With this domain decomposition technique, the problem can be solved parallelly until convergence is reached both in the interiors and on the interfaces of all subdomains. Moreover, the formulation includes a simple domain decomposer that automatically divides a finite element mesh into a list of subdomains to guarantee load balancing. Furthermore, it is shown, through numerical experiments performed on an example problem of free surface seepage through a porous dam, how the values of the relaxation parameters, the choice of imposed boundary conditions, and the number of subdomains (i.e., the number of processors used) affect the solution convergence in this parallel computing environment. © 1993 John Wiley & Sons, Inc.     

Suitable iterative methods for solving the linear system arising in the three fields domain decomposition method

There are two approaches for applying substructuring preconditioner for the linear system corresponding to the discrete Steklov–Poincaré operator arising in the three fields domain decomposition method for elliptic problems. One of them is to apply the preconditioner in a common way, i.e. using an iterative method such as preconditioned conjugate gradient method [S. Bertoluzza, Substructuring preconditioners for the three fields domain decomposition method, I.A.N.-C.N.R, 2000] and the other one is to apply iterative methods like for instance bi-conjugate gradient method, conjugate gradient square and etc. which are efficient for nonsymmetric systems (the preconditioned system will be nonsymmetric). In this paper, second approach will be followed and extensive numerical tests will be presented which imply that the considered iterative methods are efficient.     

A fractional splitting algorithm for nonoverlapping domain decomposition for parabolic problem

In this article we study the convergence of the nonoverlapping domain decomposition for solving large linear system arising from semi‐discretization of two‐dimensional initial value problem with homogeneous boundary conditions and solved by implicit time stepping using first and two alternatives of second‐order FS‐methods. The interface values along the artificial boundary condition line are found using explicit forward Euler's method for the first‐order FS‐method, and for the second‐order FS‐method to use extrapolation procedure for each spatial variable individually. The solution by the nonoverlapping domain decomposition with FS‐method is applicable to problems that requires the solution on nonuniform meshes for each spatial variable, which will enable us to use different time‐stepping over different subdomains and with the possibility of extension to three‐dimensional problem. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 609–624, 2002     

Non-Conforming Domain Decomposition with Hybrid Method

We present a non-conforming domain decomposition technique for solving elliptic problems with the finite element method. Functions in the finite element space associated with this method may be discontinuous on the boundary of subdomains. The sizes of the finite meshes, the kinds of elements and the kinds of interpolation functions may be different in different subdomains. So, this method is more convenient and more efficient than the conforming domain decomposition method. We prove that the solution obtained by this method has the same convergence rate as by the conforming method, and both the condition number and the order of the capacitance matrix are much lower than those in the conforming case.     

Analytical and numerical solutions of a one-dimensional fractional-in-space diffusion equation in a composite medium

In this paper a one-dimensional space fractional diffusion equation in a composite medium consisting of two layers in contact is studied both analytically and numerically. Since domain decomposition is the only approach available to solve this problem, we at first investigate analytical and numerical strategies for a composite medium with the same fractal dimension in each layer to ascertain which domain decomposition approach is the most accurate and consistent with a global solution methodology, which is available in this case. We utilise a matrix representation of the fractional-in-space operator to generate a system of linear ODEs with the matrix raised to the same fractional exponent. We show that the global and domain decomposition numerical strategies for this problem produce simulation results that are in good agreement with their analytic counterparts and conclude that the domain decomposition that imposes the Neumann condition at the interface produces the most consistent results. Finally, we carry this finding to study the composite problem with different fractal dimensions, where we again favourably compare analytic and numerical solutions. The resulting method can be naturally extended to space fractional diffusion in a composite medium consisting of more than two layers.     

Schwarz methods of neumann-neumann type for three-dimensional elliptic finite element problems

Several domain decomposition methods of Neumann-Neumann type are considered for solving the large linear systems of algebraic equations that arise from discretizations of elliptic problems by finite elements. We will only consider problems in three dimensions. Several new variants of the basic algorithm are introduced in a Schwarz method framework that provides tools which have already proven very useful in the design and analysis of other domain decomposition and multi-level methods. The Neumann-Neumann algorithms have several advantages over other domain decomposition methods. The subregions, which define the subproblems, only share the boundary degrees of freedom with their neighbors. The subregions can also be of quite arbitrary shape and many of the major components of the preconditioner can be constructed from subprograms available in standard finite element program libraries. In its original form, however, the algorithm lacks a mechanism for global transportation of information and its performance therefore suffers when the number of subregions increases. In the new variants of the algorithms, considered in this paper, the preconditioners include global components, of low rank, to overcome this difficulty. Bounds are established for the condition number of the iteration operator, which are independent of the number of subregions, and depend only polylogarithmically on the number of degrees of freedom of individual local subproblems. Results are also given for problems with arbitrarily large jumps in the coefficients across the interfaces separating the subregions. ©1995 John Wiley & Sons, Inc.     

A hybrid DQ/LMQRBF-DQ approach for numerical solution of Poisson-type and Burger’s equations in irregular domain

Differential quadrature (DQ) is an efficient and accurate numerical method for solving partial differential equations (PDEs). However, it can only be used in regular domains in its conventional form. Local multiquadric radial basis function-based differential quadrature (LMQRBF-DQ) is a mesh free method being applicable to irregular geometry and allowing simple imposition of any complex boundary condition. Implementation of the latter numerical scheme imposes high computational cost due to the necessity of numerous matrix inversions. It also suffers from sensitivity to shape parameter(s). This paper presents a new method through coupling the conventional DQ and LMQRBF-DQ to solve PDEs. For this purpose, the computational domain is divided into a few rectangular shapes and some irregular shapes. In such a domain decomposition process, a high percentage of the computational domain will be covered by regular shapes thus taking advantage of conventional DQM eliminating the need to implement Local RBF-DQ over the entire domain but only on a portion of it. By this method, we have the advantages of DQ like simplicity, high accuracy, and low computational cost and the advantages of LMQRBF-DQ like mesh free and Dirac’s delta function properties. We demonstrate the effectiveness of the proposed methodology using Poisson and Burgers’ equations.     

Near-field and far-field approximations by the Adomian and asymptotic decomposition methods

The Adomian decomposition method and the asymptotic decomposition method give the near-field approximate solution and far-field approximate solution, respectively, for linear and nonlinear differential equations. The Padé approximants give solution continuation of series solutions, but the continuation is usually effective only on some finite domain, and it can not always give the asymptotic behavior as the independent variables approach infinity. We investigate the global approximate solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from the asymptotic decomposition method for linear and nonlinear differential equations. For several examples we find that there exists an overlap between the near-field approximation and the far-field approximation, so we can match them to obtain a global approximate solution. For other nonlinear examples where the series solution from the Adomian decomposition method has a finite convergent domain, we can match the Padé approximant of the near-field approximation with the far-field approximation to obtain a global approximate solution representing the true, entire solution over an infinite domain.     

A PARALLEL NONOVERLAPPING DOMAIN DECOMPOSITION METHOD FOR STOKES PROBLEMS

A nonoverlapping domain decomposition iterative procedure is developed and analyzed for generalized Stokes problems and their finite element approximate problems in R^N（N=2,3）. The method is based on a mixed-type consistency condition with two parameters as a transmission condition together with a derivative-free transmission data updating technique on the artificial interfaces. The method can be applied to a general multi-subdomain decomposition and implemented on parallel machines with local simple communications naturally.     

On the numerical solution of singular two‐point boundary value problems: A domain decomposition homotopy perturbation approach

This paper reports a modified homotopy perturbation algorithm, called the domain decomposition homotopy perturbation method (DDHPM), for solving two‐point singular boundary value problems arising in science and engineering. The essence of the approach is to split the domain of the problem into a number of nonoverlapping subdomains. In each subdomain, a method based on a combination of HPM and integral equation formalism is implemented. The boundary condition at the right endpoint of each inner subdomain is established before deriving an iterative scheme for the components of the solution series. The accuracy and efficiency of the DDHPM are demonstrated by 4 examples (2 nonlinear and 2 linear). In comparison with the traditional HPM, the proposed domain decomposition HPM is highly accurate.