On the fast Fourier transform of functions with singularities (Q1907304)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 846193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the fast Fourier transform of functions with singularities |
scientific article; zbMATH DE number 846193 |
Statements
On the fast Fourier transform of functions with singularities (English)
0 references
20 February 1996
0 references
This paper gives a fast algorithm for the Fourier transform of functions with singularities. In particular, this paper contracts an algorithm for the fast Fourier transform on unequally spaced samples and tests its performance. The number of operations required in this algorithm is \(O(N \log N + N_p (- \log \xi))\) in one dimension, and \(O(N^2 \log N + N_p (- \log \xi)^2)\) in two dimension, where \(N\) is the number of computed frequencies, \(N_p\) is the number of nodes, and \(\xi\) is the precision of computation.
0 references
multiplicative complexity
0 references
fast algorithm
0 references
functions with singularities
0 references
fast Fourier transform
0 references
performance
0 references
0.8307422399520874
0 references
0.8289337754249573
0 references
0.8060117959976196
0 references
0.8052985668182373
0 references
