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.     

A NONOVERLAPPING DOMAIN DECOMPOSITION METHOD FOR EXTERIOR 3-D PROBLEM

1. IntroductionIn recent y6ars, the elliptic boUndaly value problems ill unbounded domains have dlawnmore and more attention. TO solve an equation in an unbounded domain numerically, a basicidea is to licit the computation to a bounded domain by introducing an artWial boundary.Based on this idea, many numerical methods, such as the coupling of BEM and FEM, the FEMwith boundary conditions at atilicial boundary) the coupled finite-~ie elemellt ndhodthe DDM(domain decomposition method)(cf.,…     

SCHWARZ DOMAIN DECOMPOSITION ALGORITHMS FOR BOUNDARY ELEMENT METHOD

In this paper, we introduce two Schwarz type domain decomposition algorithms for solving boundary element equations, which decompose the original problem defined on global boundary surface into several ones defined on sub-domains so that they may be solved ileratively or parallelly. The convergence of these methods are also proved.     

ON THE OPTIMAL CONVERGENCE RATE OF A ROBIN-ROBIN DOMAIN DECOMPOSITION METHOD

In this work, we solve a long-standing open problem： Is it true that the convergence rate of the Lions＇ Robin-Robin nonoverlapping domain decomposition （DD） method can be constant, independent of the mesh size h？ We closed this old problem with a positive answer. Our theory is also verified by numerical tests.     

THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS

At recent, Hourgat et gave a domain decomposition algorithm for elliptic problems which can be implemented in parallel. Many numerical experiments have illustrated its efficiency. In the present paper, we apply this algorithm to solve the discrete parabolic problems, analyse its convergence and show that its convergence rale is about (1 - 2p + σp2 ) which is nearly optimal and independent of the parameter τ, where σ τ O((1 +H )(1 + ln(H / h))2 ). 0 < p < 1 / σ,τ,h,H are the time step size, finite element parameter and subdomain diameter, respectively.     

DOMAIN DECOMPOSITION METHODS WITH NONMATCHING GRIDS FOR THE UNILATERAL PROBLEM

1. IntroductionDomain decomposition methods (DDMs) with nonmatching grids, which have been deveLoped in recent years3 are a quite new class of nonconforming DDMs. As this kind of DDMscan be aPplied to solving many practical problems which can't be handled…     

A PARALLEL ITERATIVE DOMAIN DECOMPOSITION ALGORITHM FOR ELLIPTIC PROBLEMS

1.IntroductionNolloverlappillgdomaindecolllpositionnletllodshavereceivedalotofattentionlenlsilllldallowefficielltparallelisnl.F'Orarecentdevelopmelltofthesemethods,werefertot…     

解椭圆变分不等式问题的区域分裂与异步并行算法

本文给出了两类解椭圆变分不等式问题的区域分裂异步并行算法，证明了解在Ｈ＾１－模意义下的收敛性，并给出离散格式及算例。     

关于并行迭代区域分解算法的松弛因子

1引言考虑二阶椭圆型Dirichlet边值问题的弱形式,求u∈H_0~1(Ω)使得a(u,v)=(f,v),(?) v∈H_0~1(Ω),(1)其中Ω是平面多角形区域,f∈L~2(Ω),(f,v)=∫_Ωfvdx,a(u,v)=∫_Ω(sum from i,j=1 to 2 a_(ij)(?)u/(?)x_i(?)等 a_0uv)dx,其中[a_(ij)]在Ω上对称一致正定,a_(ij)在Ω上分片连续有界,a_0≥0．由Lax-Milgram引理,问题(1)在H_0~1(Ω)中有唯一解．     

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

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

DOMAIN DECOMPOSITION PRECONDITIONERS FOR SECOND-ORDER HYPERBOLIC EQUATIONS ON L-SHAPED REGIONS

Linear systems arising from implicit time discretizations and finite difference space discretizations of second-order hyperbolic equations on L-shaped region are considered. We analyse the use of domain deocmposilion preconditioner.s for the solution of linear systems via the preconditioned conjugate gradient method. For the constant-coefficient second-order hyperbolic equaions with initial and Dirichlet boundary conditions,we prove that the conditionnumber of the preconditioned interface system is bounded by 2+x2 2+0.46x2 where x is the quo-tient between the lime and space steps. Such condition number produces a convergence rale that is independent of gridsize and aspect ratios. The results could be extended to parabolic equations.     

多孔介质可混溶流动问题的混合元与区域分裂特征差分格式

1 引 言 用区域分裂方法求微分方程的数值解,是近年来计算数学领域的—个新方法。这种方法通过分裂区域来减少所处理问题的规模,并实现并行计算,因此,特别适用于大范围的工程技术问题和数学物理问题。本文用这种方法处理平面可混溶不可压缩流动问题其中J=[0.T].u为Darcy速度,p为压力,c为浓度,k为渗透率,μ（c)为流体粘性,c为注入井给定浓度,q为外界源汇项,q~+=max{q,0}.φ为孔隙度。D为扩散矩阵,本文D与u无关。即仅考虑分子扩散,边条件可取为第一或第二类边条件。本文考虑第一类初边值问题     

GLOBAL SUPERCONVERGENCES OF THE DOMAIN DECOMPOSITION METHODS WITH NONMATCHING GRIDS

1. IlltroductionA nonconforming domain decomposition method with Lagrangian multipliers was proposedin [13]. The basic idea of this method is to deal with the nonconforming of nonmatching gridsby illtroducing the Lagrangian multipliers on interfaces of subdomains and its advalltages arethat it allows not only the incompatibility of the internal variables on the interface betweensubdomains, but also the discolltinuity of the boundary variables on the common venices ofsubdomains. Thus one can c…     

Navier—Stokes方程区域分解法的收敛性

０引言区域分解方法是近年来迅速发展的偏微分方程数值方法．区域分解方法及其收敛性的研究大多是在线性偏微分方程下得到的,对于非线性问题,经典的技巧在收敛性证明时遇到了困难．流体计算是一个较为复杂的非线性问题,数值模拟过程中因节点多．网格复杂,所以计算量很大．由于区域分解方法不但可以缩小求解规模,进行并行计算,而且可以在不同区域选取不同离散方法和模型,因此对Ｎ－Ｓ方程区域分解方法的研究会有较高的实用价值,也可以对其它非线性问题数值方法研究提供新的途径．本文首先给出了Ｎ－Ｓ方程的最优控制方法以及一些重要…     

无界区域Stokes问题非重叠型区域分解算法及其收敛性

本文研究无界区域Stokes方程外问题的利用有限元法和自然边界归化的非蕈叠型区域分解算法,此方法对无界区域Stokes问题非常有效.给出连续和离散情形的D-N算法及其收敛性分析,得到算法收敛的充要条件及充分条件,并得到最优的松弛因子和压缩因子,最后给出数值算例予以验证.     

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

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

一类各向异性外问题的重叠型区域分解算法

本文以椭圆外调和问题的自然边界归化为基础,提出了求解各向异性常系数椭圆方程的一种重叠型区域分解算法,并分析了算法的收敛性及收敛速度．理论分析及数值实验表明,该方法对于求解各向异性外问题非常有效．     

A NON-OVERLAPPING DOMAIN DECOMPOSITION ALGORITHM BASED ON THE NATURAL BOUNDARY REDUCTION FOR WAVE EQUATIONS IN AN UNBOUNDED DOMAIN

In this paper, a new domain decomposition method based on the natural boundary reduction, which solves wave problems over an unbounded domain, is suggestted. An circular artificial boundary is introduced. The original unbounded domain is divided into two subdomains, an internal bounded region and external unbounded region outside the artificial boundary. A Dirichlet-Neumann(D-N) alternating iteration algorithm is constructed. We prove that the algorithm is equavilent to preconditional Richardson iteration method. Numerical studies are performed by finite element method. The numerical results show that the convergence rate of the discrete D-N iteration is independent of the finite element mesh size.     

Helmholtz问题的Robin型区域分解法

Helmholtz问题的数值模拟在科学工程计算领域有着广泛的应用,快速高效求解Helmholtz方程离散代数系统一直是科学计算的重要研究方向.本文简要回顾了Helmholtz方程的区域分解型求解器的发展历程,重点介绍了我们提出的Robin型区域分解算法,同时比较了各类算法的优劣和特点.近年来Helmholtz方程的求解效率有了极大的提升,然而仍有一些本质困难尚待突破,如何高效求解Helmholtz方程,仍是具有挑战意义的研究课题.