部分傅里叶变换的快速计算
Fast Computation of Partial Fourier Transforms
AI总结:
针对一维和二维部分傅里叶变换,提出基于多尺度分解的快速算法,分别达到O(N log^2 N)和O(N^2 log^2 N)的复杂度,并应用于反射地震学中的波外推。
摘要:
我们介绍了一维和二维部分傅里叶变换的两种高效算法。我们的研究源于反射地震学中的波外推过程。在这两种算法中,主要思想是以多尺度方式将求和域分解为更简单的分量。然后对每个分量应用现有的快速算法以获得最优复杂度。一维算法是精确的,需要$O(N\log^2 N)$步。我们的二维解决方案是一种近似但精确的算法,需要$O(N^2 \log^2 N)$步。在这两种情况下,复杂度相对于自由度几乎是线性的。我们提供了几个测试示例的数值结果。
英文摘要:
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal complexity. The algorithm in 1D is exact and takes $O(N\log^2 N)$ steps. Our solution in 2D is an approximate but accurate algorithm that takes $O(N^2 \log^2 N)$ steps. In both cases, the complexities are almost linear in terms of the degree of freedom. We provide numerical results on several test examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。