Name
Abstract | ||
|---|---|---|
For any triple of positive integers (m,N,q), the matrix F(m,N,q), called the (m,N,q)-regular Fourier matrix, is defined. The regular Fourier matrices F(m,N,q) are then applied to set up new algorithms for nonuniform fast Fourier transforms. Numerical results show that the accuracies obtained by our algorithms are much better than previously reported results with the same computation complexity. The algorithms require $O(N\cdot\log_2N)$ arithmetic operations, where N is the number of data points. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1137/S1064827597325712 | Siam Journal on Scientific Computing |
Keywords | Field | DocType |
nonuniform fast Fourier transform,unequally spaced data,interpolations,trigonometric series,FFT,approximation theory | Integer,Trigonometric series,Matrix (mathematics),Mathematical analysis,Interpolation,Approximation theory,Fourier transform,Fast Fourier transform,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
21 | 1 | 1064-8275 |
Citations | PageRank | References |
27 | 4.92 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nhu Nguyen | 1 | 29 | 5.65 |
| Qing-Huo Liu | 2 | 288 | 53.70 |