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

Helmholtz方程的扫掠预条件子:分层矩阵表示

Sweeping Preconditioner for the Helmholtz Equation: Hierarchical Matrix Representation

Department of Mathematics and ICES, University of Texas, Austin(德克萨斯大学奥斯汀分校数学系与计算与应用工程研究所)

Björn Engquist, Lexing Ying

AI总结:

提出一种基于分层矩阵表示的扫掠预条件子,用于高效迭代求解变系数Helmholtz方程,包括高频问题,在二维和三维中均表现出线性复杂度和极快的收敛性。

摘要:

本文介绍了扫掠预条件子,该预条件子对于变系数Helmholtz方程(包括甚高频问题)的迭代求解非常高效。这种新方法的第一个核心思想是通过从吸收层或边界条件开始,逐层扫掠域来构建离散化Helmholtz方程的近似分解。基于这种特定的分解顺序,该方法的第二个核心思想是在分层矩阵框架中表示中间矩阵。在二维情况下,预条件子的构建和应用均具有线性复杂度。使用所得预条件子的GMRES求解器在极少的迭代次数内收敛,且迭代次数基本与未知量个数无关。该方法也成功推广到三维情况。提供了二维和三维的数值结果,以证明这种新方法的效率。

英文摘要:

The paper introduces the sweeping preconditioner, which is highly efficient for iterative solutions of the variable coefficient Helmholtz equation including very high frequency problems. The first central idea of this novel approach is to construct an approximate factorization of the discretized Helmholtz equation by sweeping the domain layer by layer, starting from an absorbing layer or boundary condition. Given this specific order of factorization, the second central idea of this approach is to represent the intermediate matrices in the hierarchical matrix framework. In two dimensions, both the construction and the application of the preconditioners are of linear complexity. The GMRES solver with the resulting preconditioner converges in an amazingly small number of iterations, which is essentially independent of the number of unknowns. This approach is also extended to the three dimensional case with some success. Numerical results are provided in both two and three dimensions to demonstrate the efficiency of this new approach.

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

↑