A Fast Method for the Numerical Evaluation of Continuous Fourier and Laplace Transforms

The fast Fourier transform (FFT) is often used to compute numerical approximations to continuous Fourier and Laplace transforms. However, a straightforward application of the FFT to these problems often requires a large FFT to be performed, even though most of the input data to this FFT may be zero...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on scientific computing 1994-09, Vol.15 (5), p.1105-1110
Hauptverfasser: Bailey, David H., Swarztrauber, Paul N.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The fast Fourier transform (FFT) is often used to compute numerical approximations to continuous Fourier and Laplace transforms. However, a straightforward application of the FFT to these problems often requires a large FFT to be performed, even though most of the input data to this FFT may be zero and only a small fraction of the output data may be of interest. In this note, the "fractional Fourier transform," previously developed by the authors, is applied to this problem with a substantial savings in computation.
ISSN:1064-8275
1095-7197
DOI:10.1137/0915067