A multiscale butterfly algorithm for multidimensional fourier integral operators
Repository Usage Stats
© 2015 Society for Industrial and Applied Mathematics.This paper presents an efficient multiscale butterfly algorithm for computing Fourier integral operators (FIOs) of the form (Lf)(x) =∫ <inf>ℝ d</inf>a(x, ξ)e2πiΦ(x,ξ)f(ξ)dξ, where Φ(x, ξ) is a phase function, a(x, ξ) is an amplitude function, and f(x) is a given input. The frequency domain is hierarchically decomposed into a union of Cartesian coronas. The integral kernel a(x, ξ)e2πiΦ(x,ξ)in each corona satisfies a special low-rank property that enables the application of a butterfly algorithm on the Cartesian phase-space grid. This leads to an algorithm with quasi-linear operation complexity and linear memory complexity. Different from previous butterfly methods for the FIOs, this new approach is simple and reduces the computational cost by avoiding extra coordinate transformations. Numerical examples in two and three dimensions are provided to demonstrate the practical advantages of the new algorithm.
Published Version (Please cite this version)10.1137/140997658
Publication InfoLi, Y; Yang, H; & Ying, L (2015). A multiscale butterfly algorithm for multidimensional fourier integral operators. Multiscale Modeling and Simulation, 13(2). pp. 614-631. 10.1137/140997658. Retrieved from https://hdl.handle.net/10161/11655.
This is constructed from limited available data and may be imprecise. To cite this article, please review & use the official citation provided by the journal.
More InfoShow full item record
Phillip Griffiths Assistant Research Professor
This author no longer has a Scholars@Duke profile, so the information shown here reflects their Duke status at the time this item was deposited.
Instructor* of Mathematics
Alphabetical list of authors with Scholars@Duke profiles.