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

傅里叶积分算子快速计算的蝴蝶算法

A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators

Applied and Computational Mathematics, Caltech(加州理工学院应用与计算数学);Department of Mathematics, Stanford University(斯坦福大学数学系);Department of Mathematics, University of Texas, Austin(德克萨斯大学奥斯汀分校数学系)

Emmanuel Candes, Laurent Demanet, Lexing Ying

AI总结:

针对傅里叶积分算子的快速计算问题,提出一种基于蝴蝶算法框架、复杂度接近最优的O(N² log N)算法,通过利用核函数在满足几何条件的子集上的近似低秩性实现高效计算。

摘要:

本文关注一般形式 $\int_{\R^d} e^{2\pi i \Phi(x,k)} f(k) d k$ 的傅里叶积分算子的快速计算,其中 $k$ 是频率变量,$\Phi(x,k)$ 是满足标准齐次性条件的相位函数,$f$ 是给定输入。这类基本计算与波动方程数值解问题相关,并频繁出现在反射地震学、曲线层析成像等应用中。在二维情况下,当输入和输出在 $N \times N$ 笛卡尔网格上采样时,直接计算需要 $O(N^4)$ 次操作,通常代价过高。本文提出一种新颖算法,运行时间为 $O(N^2 \log N)$,即具有近最优的计算复杂度,其整体结构遵循蝴蝶算法 [Michielssen and Boag, IEEE Trans Antennas Propagat 44 (1996), 1086-1093]。该算法背后的数学洞察在于将核函数 $e^{2\pi i \Phi(x,k)}$ 限制到时间和频率域的子集上。每当这些子集满足简单的几何条件时,限制后的核函数具有近似低秩性;我们提出使用一种特殊的插值方案来构造这种低秩近似,该方案预因子振荡分量,插值剩余的非振荡部分,最后重新调制结果。该方案的一个副产品是整个算法在内存需求方面非常高效。数值结果展示了该算法的性能并说明了其经验性质。

英文摘要:

This paper is concerned with the fast computation of Fourier integral operators of the general form $\int_{\R^d} e^{2\piıΦ(x,k)} f(k) d k$, where $k$ is a frequency variable, $Φ(x,k)$ is a phase function obeying a standard homogeneity condition, and $f$ is a given input. This is of interest for such fundamental computations are connected with the problem of finding numerical solutions to wave equations, and also frequently arise in many applications including reflection seismology, curvilinear tomography and others. In two dimensions, when the input and output are sampled on $N \times N$ Cartesian grids, a direct evaluation requires $O(N^4)$ operations, which is often times prohibitively expensive. This paper introduces a novel algorithm running in $O(N^2 \log N)$ time, i. e. with near-optimal computational complexity, and whose overall structure follows that of the butterfly algorithm [Michielssen and Boag, IEEE Trans Antennas Propagat 44 (1996), 1086-1093]. Underlying this algorithm is a mathematical insight concerning the restriction of the kernel $e^{2\piıΦ(x,k)}$ to subsets of the time and frequency domains. Whenever these subsets obey a simple geometric condition, the restricted kernel has approximately low-rank; we propose constructing such low-rank approximations using a special interpolation scheme, which prefactors the oscillatory component, interpolates the remaining nonoscillatory part and, lastly, remodulates the outcome. A byproduct of this scheme is that the whole algorithm is highly efficient in terms of memory requirement. Numerical results demonstrate the performance and illustrate the empirical properties of this algorithm.

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

↑