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

多维问题非标准形式的快速自适应算法

Fast Adaptive Algorithms in the Non-Standard Form for Multidimensional Problems

University of Colorado, Boulder(科罗拉多大学博尔德分校)

Gregory Beylkin, Vani Cheruvu, Fernando Pérez

AI总结:

提出一种快速自适应多分辨率算法,用于一至三维中具有径向对称核的积分算子,通过分离表示实现高效计算,并以泊松和薛定谔方程为例展示算法性能。

摘要:

我们提出了一种快速、自适应的多分辨率算法,用于在维度一、二、三中应用具有广泛径向对称核类的积分算子。该算法通过使用核的分离表示来提高效率。我们讨论了算子类 $(-Δ+μ^{2}I)^{-α}$,其中 $μ\geq0$ 且 $0<α<3/2$,并展示了该算法在三维泊松和薛定谔方程中的应用。同一算法可用于所有具有径向对称核且近似为高斯加权和的算子,通过重用单一实现使其适用于多个领域。该快速算法以合理的成本提供可控的精度,与快速多极方法(FMM)相当。它与FMM的不同之处在于用于表示核的近似类型,并且具有易于扩展到更高维度的优势。

英文摘要:

We present a fast, adaptive multiresolution algorithm for applying integral operators with a wide class of radially symmetric kernels in dimensions one, two and three. This algorithm is made efficient by the use of separated representations of the kernel. We discuss operators of the class $(-Δ+μ^{2}I)^{-α}$, where $μ\geq0$ and $0<α<3/2$, and illustrate the algorithm for the Poisson and Schrödinger equations in dimension three. The same algorithm may be used for all operators with radially symmetric kernels approximated as a weighted sum of Gaussians, making it applicable across multiple fields by reusing a single implementation. This fast algorithm provides controllable accuracy at a reasonable cost, comparable to that of the Fast Multipole Method (FMM). It differs from the FMM by the type of approximation used to represent kernels and has an advantage of being easily extendable to higher dimensions.

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

↑