arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.4285math.APcs.NAmath.NA
收藏

狄利克雷-诺依曼和诺依曼-诺依曼波动松弛法用于波动方程

Dirichlet-Neumann and Neumann-Neumann Waveform Relaxation for the Wave Equation

University of Geneva(日内瓦大学)

Martin J. Gander, Felix Kwok, Bankim C. Mandal

AI总结:

本文提出波动方程时空领域分解中的狄利克雷-诺依曼和诺依曼-诺依曼算法的波动松弛变体,通过非重叠空间分解和接口条件子域求解,证明在有限时间内有限步数收敛,并通过数值结果展示算法性能及与经典和优化Schwarz波动松弛方法的对比。

摘要:

本文提出波动方程时空领域分解中的狄利克雷-诺依曼和诺依曼-诺依曼算法的波动松弛变体,通过非重叠空间分解和接口条件子域求解,证明在有限时间内有限步数收敛,并通过数值结果展示算法性能及与经典和优化Schwarz波动松弛方法的对比。

英文摘要:

We present a Waveform Relaxation (WR) version of the Dirichlet-Neumann and Neumann-Neumann algorithms for the wave equation in space time. Each method is based on a non-overlapping spatial domain decomposition, and the iteration involves subdomain solves in space time with corresponding interface condition, followed by a correction step. Using a Laplace transform argument, for a particular relaxation parameter, we prove convergence of both algorithms in a finite number of steps for finite time intervals. The number of steps depends on the size of the subdomains and the time window length on which the algorithms are employed. We illustrate the performance of the algorithms with numerical results, and also show a comparison with classical and optimized Schwarz WR methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑