Multidimensional Phase Recovery and Interpolative Decomposition Butterfly Factorization
arXiv:1908.09376 · doi:10.1016/j.jcp.2020.109427
Abstract
This paper focuses on the fast evaluation of the matvec for , which is the discretization of a multidimensional oscillatory integral transform with a kernel function , where is a piecewise smooth phase function with and in for or . A new framework is introduced to compute with 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 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 with an complexity once is available. Numerical results are provided to demonstrate the effectiveness of the proposed framework.
References in corpus (10)
- A Butterfly-Based Direct Integral Equation Solver Using Hierarchical LU Factorization for Analyzing Scattering from Electrically Large Conducting Objects
- Butterfly Factorization
- A HSS Matrix-Inspired Butterfly-Based Direct Solver for Analyzing Scattering from Two-dimensional Objects
- Interpolative Butterfly Factorization
- Multidimensional Butterfly Factorization
- A Unified Framework for Oscillatory Integral Transform: When to use NUFFT or Butterfly Factorization?
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
- Pseudodifferential multi-product representation of the solution operator of a parabolic equation
- Interpolative Decomposition Butterfly Factorization
- An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments