Direct inversion of the nonequispaced fast Fourier transform
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909639682031616 |
|---|---|
| author | Kircheis, Melanie Potts, Daniel |
| author_facet | Kircheis, Melanie Potts, Daniel |
| contents | Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider direct methods for the inversion of the NFFT. We introduce algorithms for the setting $M=N$ as well as for the underdetermined and overdetermined cases. For the setting $M=N$ a direct method of complexity $\mathcal O(N\log N)$ is presented which utilizes Lagrange interpolation and the fast summation. For the remaining cases, we use the matrix representation of the NFFT to deduce our algorithms. Thereby, we are able to compute an inverse NFFT up to a certain accuracy by dint of a modified adjoint NFFT in $\mathcal O(M\log M+N)$ arithmetic operations. Finally, we show that these approaches can also be explained by means of frame approximation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1811_05335 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Direct inversion of the nonequispaced fast Fourier transform Kircheis, Melanie Potts, Daniel Numerical Analysis 65Txx, 42C15 Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider direct methods for the inversion of the NFFT. We introduce algorithms for the setting $M=N$ as well as for the underdetermined and overdetermined cases. For the setting $M=N$ a direct method of complexity $\mathcal O(N\log N)$ is presented which utilizes Lagrange interpolation and the fast summation. For the remaining cases, we use the matrix representation of the NFFT to deduce our algorithms. Thereby, we are able to compute an inverse NFFT up to a certain accuracy by dint of a modified adjoint NFFT in $\mathcal O(M\log M+N)$ arithmetic operations. Finally, we show that these approaches can also be explained by means of frame approximation. |
| title | Direct inversion of the nonequispaced fast Fourier transform |
| topic | Numerical Analysis 65Txx, 42C15 |
| url | https://arxiv.org/abs/1811.05335 |