arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.4291math.NAcs.NA

亥姆霍兹方程的扫描预条件子:移动完美匹配层

Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers

University of Texas, Austin(德克萨斯大学奥斯汀分校)

Björn Engquist, Lexing Ying

AI总结:

提出一种基于移动完美匹配层近似Schur补矩阵的扫描预条件子,用于高效求解变系数亥姆霍兹方程,具有线性应用成本且迭代次数与未知数或频率无关。

摘要:

本文介绍了一种新的扫描预条件子,用于二维和三维变系数亥姆霍兹方程的迭代求解。该算法遵循从吸收层或边界条件开始逐层消去未知数来构造近似$LDL^t$分解的一般结构。本文的核心思想是使用在域内部引入的移动完美匹配层(PML)来近似分解中的Schur补矩阵。应用每个Schur补矩阵等价于在二维情况下求解一个具有带状LU分解的准一维问题,在三维情况下求解一个具有多波前方法的准二维问题。所得的预条件子具有线性应用成本,且预条件迭代求解器的收敛迭代次数与未知数或频率基本无关。文中给出了二维和三维的数值结果,以证明该新预条件子的效率。

英文摘要:

This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate $LDL^t$ factorization by eliminating the unknowns layer by layer starting from an absorbing layer or boundary condition. The central idea of this paper is to approximate the Schur complement matrices of the factorization using moving perfectly matched layers (PMLs) introduced in the interior of the domain. Applying each Schur complement matrix is equivalent to solving a quasi-1D problem with a banded LU factorization in the 2D case and to solving a quasi-2D problem with a multifrontal method in the 3D case. The resulting preconditioner has linear application cost and the preconditioned iterative solver converges in a number of iterations that is essentially indefinite of the number of unknowns or the frequency. Numerical results are presented in both two and three dimensions to demonstrate the efficiency of this new preconditioner.

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

↑