Rapid Computation of the Discrete Fourier Transform

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 1996 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Scientific Computing, volume 17, pages 913-919 (issn: 1064-8275, eissn: 1095-7197,

Copyright policy )Funded by:NSF | Mathematical Sciences: Po...

Authors: Chris Anderson; Marie Dillon Dahleh;

doi: 10.1137/0917059

Rapid Computation of the Discrete Fourier Transform

- Summary
- Subjects
- Metrics

Abstract

This paper gives fast algorithms for the forward and inverse Fourier transform for an arbitrary number of nonequispaced points. Its computational procedure consists of a combination of the standard fast Fourier transform and approximation using local Taylor series expansions. The forward transform for nonequispaced points is computed as the solution of a linear system involving the inverse Fourier transform.

Related Organizations

Fellowships
United States

Keywords

discrete Fourier transform, fast algorithms, local Taylor series expansions, inverse Fourier transform, nonequispaced points, fast Fourier transform, Numerical methods for discrete and fast Fourier transforms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	46
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average