...
首页> 外文期刊>Numerische Mathematik >Convergence of parallel overlapping domain decomposition methods for the Helmholtz equation
【24h】

Convergence of parallel overlapping domain decomposition methods for the Helmholtz equation

机译:亥姆霍兹方程平行重叠域分解方法的收敛性

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

摘要

We analyse parallel overlapping Schwarz domain decomposition methods for the Helmholtz equation, where the exchange of information between subdomains is achieved using first-order absorbing (impedance) transmission conditions, together with a partition of unity. We provide a novel analysis of this method at the PDE level (without discretization). First, we formulate the method as a fixed point iteration, and show (in dimensions 1, 2, 3) that it is well-defined in a tensor product of appropriate local function spaces, each with L2 impedance boundary data. We then obtain a bound on the norm of the fixed point operator in terms of the local norms of certain impedance-to-impedance maps arising from local interactions between subdomains. These bounds provide conditions under which (some power of) the fixed point operator is a contraction. In 2-d, for rectangular domains and strip-wise domain decompositions (with each subdomain only overlapping its immediate neighbours), we present two techniques for verifying the assumptions on the impedance-to-impedance maps that ensure power contractivity of the fixed point operator. The first is through semiclassical analysis, which gives rigorous estimates valid as the frequency tends to infinity. At least for a model case with two subdomains, these results verify the required assumptions for sufficiently large overlap. For more realistic domain decompositions, we directly compute the norms of the impedance-to-impedance maps by solving certain canonical (local) eigenvalue problems. We give numerical experiments that illustrate the theory. These also show that the iterative method remains convergent and/or provides a good preconditioner in cases not covered by the theory, including for general domain decompositions, such as those obtained via automatic graph-partitioning software.
机译:我们分析了亥姆霍兹方程的平行重叠施瓦茨域分解方法,其中子域之间的信息交换是使用一阶吸收(阻抗)传输条件以及单位划分来实现的。我们在偏微分方程水平(无离散化)对该方法进行了新的分析。首先,我们将该方法表述为定点迭代,并证明(在维度 1、2、3 中)它在适当局部函数空间的张量乘积中定义良好,每个张量积都有 L2 阻抗边界数据。然后,我们根据子域之间的局部相互作用产生的某些阻抗-阻抗映射的局部范数,获得了定点算子范数的边界。这些边界提供了条件,在该条件下,定点算子的(一定幂)是收缩。在二维中,对于矩形域和逐条域分解(每个子域仅与其近邻重叠),我们提出了两种技术来验证阻抗-阻抗图上的假设,以确保定点算子的功率收缩性。第一种是通过半经典分析,当频率趋于无穷大时,它给出了有效的严格估计。至少对于具有两个子域的模型案例,这些结果验证了足够大的重叠所需的假设。对于更现实的域分解,我们通过求解某些规范(局部)特征值问题来直接计算阻抗到阻抗映射的范数。我们给出了数值实验来说明该理论。这些还表明,迭代方法在理论未涵盖的情况下保持收敛和/或提供了良好的预条件器,包括对于一般的域分解,例如通过自动图分区软件获得的分解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号