Fast Approximate Fourier Transforms for Irregularly Spaced Data

Authors:
Antony F. Ware
Affiliations:
-
Venue:
SIAM Review
Year:
1998

Citing 0
Cited 8

A generalized Graeffe's iteration for evaluating polynomials and rational functions

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Fast spherical Fourier algorithms

Journal of Computational and Applied Mathematics
A Double-Exponential Fast Gauss Transform Algorithm for Pricing Discrete Path-Dependent Options

Operations Research
Numerical solution of two asset jump diffusion models for option valuation

Applied Numerical Mathematics
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms

ACM Transactions on Mathematical Software (TOMS)
Efficient Calculations of 3-D FFTs on Spiral Contours

Journal of Scientific Computing
A Fast Algorithm for Fourier Continuation

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.03

Visualization

Abstract

Several algorithms for efficiently evaluating trigonometric polynomials at irregularly spaced points are presented and analyzed. The algorithms can be viewed as approximate generalizations of the fast Fourier transform (FFT), and they are compared with regard to their accuracy and their computational efficiency.