Multidimensional Phase Recovery and Interpolative Decomposition Butterfly Factorization

08/25/2019 ∙ by Ze Chen, et al. ∙ 0

This paper focuses on the fast evaluation of the matvec g=Kf for K∈C^N× N, which is the discretization of a multidimensional oscillatory integral transform g(x) = ∫ K(x,ξ) f(ξ)dξ with a kernel function K(x,ξ)=e^2πıΦ(x,ξ), where Φ(x,ξ) is a piecewise smooth phase function with x and ξ in R^d for d=2 or 3. A new framework is introduced to compute Kf with O(N N) time and memory complexity in the case that only indirect access to the phase function Φ is available. This framework consists of two main steps: 1) an O(N N) algorithm for recovering the multidimensional phase function Φ from indirect access is proposed; 2) a multidimensional interpolative decomposition butterfly factorization (MIDBF) is designed to evaluate the matvec Kf with an O(N N) complexity once Φ is available. Numerical results are provided to demonstrate the effectiveness of the proposed framework.



There are no comments yet.


page 12

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.