| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6928526 | Journal of Computational Physics | 2018 | 45 Pages |
Abstract
We introduce an efficient algorithm for evaluating the Fourier transform of piecewise-polynomial data on d-dimensional simplices in D-dimensional Euclidean space RD. It generalizes butterfly algorithms for pointwise (d=0) nonuniform fast Fourier transforms, with new dimensional recurrences for exponential-polynomial moments. Error analysis and numerical comparisons with direct evaluation validate the efficiency and accuracy of the algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
John Strain,