.png){kind=icon}
返回
SPARSE FOURIER TRANSFORM VIA BUTTERFLY ALGORITHM
.png){kind=icon}
OA
AI
DOI：10.1137/08071291X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a fast algorithm for computing sparse Fourier transforms with spatial and Fourier data supported on curves or surfaces. This problem appears naturally in several important applications of wave scattering, digital signal processing, and reflection seismology. The main idea of the algorithm is that the interaction between a frequency region and a spatial region is approximately low rank if the product of their widths are bounded by the maximum frequency. Based on this property, we can approximate the interaction between these two boxes accurately and compactly using a small number of equivalent sources. The overall structure of the algorithm follows the butterfly algorithm. The computation is further accelerated by exploiting the tensor-product property of the Fourier kernel in two and three dimensions. The proposed algorithm is accurate and has the optimal complexity. We present numerical results in both two and three dimensions.
Keyword:
Fourier transform
butterfly algorithm
multiscale methods
far field pattern
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Synthesis of Modified TiO₂ Nanocomposite using Fe₃O₄ and Nickel as Photocatalyst in Reduction of Silver Ions采用Fe₃O₄和镍作为光催化剂，在银离子还原过程中合成改性TiO₂纳米复合材料OAAI
OAAI分享收藏
查看更多内容