SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Scientific Computing / Volume 14 / Issue 6

SIAM J. Sci. Comput. 14, pp. 1368-1393 (26 pages)

Fast Fourier Transforms for Nonequispaced Data

A. Dutt and V. Rokhlin

Full Text: Download PDF | Buy PDF (US$25) | View Cart
A group of algorithms is presented generalizing the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes on the interval $[ - \pi ,\pi ]$. The schemes of this paper are based on a combination of certain analytical considerations with the classical fast Fourier transform and generalize both the forward and backward FFTs. Each of the algorithms requires $O(N\cdot \log N + N\cdot \log (1/\varepsilon ))$ arithmetic operations, where $\varepsilon $ is the precision of computations and $N$ is the number of nodes. The efficiency of the approach is illustrated by several numerical examples.

© 1993 Society for Industrial and Applied Mathematics

KEYWORDS

AMS Subject Headings

65R10, 65T10, 65T20, 65Y20

PUBLICATION DATA

ISSN:

1064-8275 (print)  
1095-7197 (online)

Publisher:

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received June 17, 1992
Accepted November 19, 1992
Permalink
http://dx.doi.org/10.1137/0914081

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. Fast Fourier Transforms for Nonequispaced Data
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close