A Unified Framework for Oscillatory Integral Transform: When to use NUFFT or Butterfly Factorization?
Haizhao Yang

TL;DR
This paper introduces a unified framework for efficiently computing oscillatory integral transforms using NUFFT or butterfly factorization, with a method to choose the optimal approach and recover unknown functions.
Contribution
It presents a novel $O(N ext{log}N)$ algorithm for recovering amplitude and phase functions from indirect data, and develops a stable low-rank butterfly factorization for fast evaluation.
Findings
Framework achieves $O(N ext{log}N)$ complexity in evaluation.
New low-rank matrix recovery algorithm for phase and amplitude functions.
Numerical results confirm the effectiveness of the unified approach.
Abstract
This paper concerns the fast evaluation of the matvec for , which is the discretization of the oscillatory integral transform with a kernel function , where is a smooth amplitude function, and is a piecewise smooth phase function with discontinuous points in and . A unified framework is proposed to compute with time and memory complexity via the non-uniform fast Fourier transform (NUFFT) or the butterfly factorization (BF), together with an fast algorithm to determine whether NUFFT or BF is more suitable. This framework works for two cases: 1) explicit formulas for the amplitude and phase functions are known, 2) only indirect access of the amplitude and phase functions are available. Especially in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
