...
首页> 外文期刊>SIAM Journal on Numerical Analysis >An alternative coarse space for irregular subdomains and an overlapping Schwarz algorithm for scalar elliptic problems in the plane?
【24h】

An alternative coarse space for irregular subdomains and an overlapping Schwarz algorithm for scalar elliptic problems in the plane?

机译:用于不规则子域的替代粗略空间和用于平面中标量椭圆问题的重叠Schwarz算法?

获取原文
获取原文并翻译 | 示例

摘要

In earlier work on domain decomposition methods for elliptic problems in the plane, an assumption that each subdomain is triangular or a union of a few coarse triangles has often been made. This is similar to what is required in geometric multigrid theory and is unrealistic if the subdomains are produced by a mesh partitioner. In an earlier paper, coauthored with Axel Klawonn, the authors introduced a coarse subspace for an overlapping Schwarz method with one degree of freedom for each subdomain vertex and one for each subdomain edge. A condition number bound proportional to (1+log(H/h))~ 2 (1+ H/Δ) was established assuming only that the subdomains are John domains; here H/Δ measures the relative overlap between neighboring subdomains and H/h the maximum number of elements across individual subdomains. We were also able to relate the rate of convergence to a parameter in an isoperimetric inequality for the subdomains into which the domain of the problem has been partitioned. In this paper, the dimension of the coarse subspace is decreased by using only one degree of freedom for each subdomain vertex; if all subdomains have three edges, this leads to a reduction of the dimension of the coarse subspace by approximately a factor four. In addition, the condition number bound is shown to be proportional to (1+log(H/h))(1+H/Δ) under a quite mild assumption on the relative length of adjacent subdomain edges. In this study, the subdomains are assumed to be uniform in the sense of Peter Jones. As in our earlier work, the results are insensitive to arbitrary large jumps in the coefficients of the elliptic problem across the interface between the subdomains. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties. It is also shown that the new algorithm often converges faster than the older one in spite of the fact that the dimension of the coarse space has been decreased considerably.
机译:在关于平面上椭圆问题的域分解方法的早期工作中,经常做出这样的假设:每个子域都是三角形或几个粗糙三角形的并集。这类似于几何多重网格理论中的要求,并且如果子域是由网格划分器生成的,则是不现实的。在与Axel Klawonn共同撰写的较早的论文中,作者为重叠的Schwarz方法引入了一个粗糙的子空间,其中每个子域顶点具有一个自由度,每个子域边缘具有一个自由度。仅假设子域是John域,建立与(1 + log(H / h))〜2(1 + H /Δ)成比例的条件数。在此,H /Δ衡量相邻子域之间的相对重叠,而H / h则是各个子域中元素的最大数量。对于问题所在的子域,我们还能够将收敛速度与等参不等式中的参数相关联。在本文中,通过仅对每个子域顶点使用一个自由度来减小粗糙子空间的维数;如果所有子域都具有三个边缘,则这将使粗糙子空间的尺寸减小大约四分之一。另外,在对相邻子域边缘的相对长度的相当温和的假设下,条件编号范围显示为与(1 + log(H / h))(1 + H /Δ)成比例。在这项研究中,假设子区域在Peter Jones的意义上是统一的。与我们之前的工作一样,结果对子域之间的界面上椭圆问题系数的任意大跳变都不敏感。数值结果证实了该理论并证明了该算法对各种网格分解和材料特性分布的有用性。还表明,尽管粗糙空间的尺寸已大大减小,但新算法的收敛速度通常比旧算法快。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号