Fast Fourier Transforms for Nonequispaced Data II

Abstract

A group of algorithms is presented generalizing the Fast Fourier Transform to the case of noninteger frequencies and non equispaced nodes on the interval -PI,PI. The schemes of this paper are based on a combination of the classical Fast Fourier Transform with a version of the Fast Multipole Method, and generalize both the forward and backward FFTs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1993
Accession Number
ADA268383

Entities

People

  • A. Dutt
  • Vladimir Rokhlin

Organizations

  • Yale University

Tags

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Arithmetic
  • Chebyshev Approximations
  • Chebyshev Polynomials
  • Complex Numbers
  • Computations
  • Differential Equations
  • Discrete Fourier Transforms
  • Equations
  • Fast Fourier Transforms
  • Fourier Analysis
  • Fourier Series
  • Numbers
  • Polynomials
  • Real Numbers
  • Sequences

Readers

  • Approximation Theory.