Using NFFT3 - a software library for various nonequispaced fast Fourier transforms. NFFT 3 is a software library that implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides a survey on the mathematical concepts behind the NFFT and its variants, as well as a general guideline for using the library. Numerical examples for a number of applications are given.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 53 articles , 1 standard article )

Showing results 1 to 20 of 53.
Sorted by year (citations)

1 2 3 next

  1. Averseng, Martin: Fast discrete convolution in (\mathbbR^2) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies (2020)
  2. Bartel, Felix; Hielscher, Ralf; Potts, Daniel: Fast cross-validation in harmonic approximation (2020)
  3. Rangan, Aaditya; Spivak, Marina; Andén, Joakim; Barnett, Alex: Factorization of the translation kernel for fast rigid image alignment (2020)
  4. Agaltsov, A. D.; Hohage, T.; Novikov, R. G.: An iterative approach to monochromatic phaseless inverse scattering (2019)
  5. Barnett, Alexander H.; Magland, Jeremy; af Klinteberg, Ludvig: A parallel nonuniform fast Fourier transform library based on an “exponential of semicircle” kernel (2019)
  6. Kircheis, Melanie; Potts, Daniel: Direct inversion of the nonequispaced fast Fourier transform (2019)
  7. Merhi, Sami; Zhang, Ruochuan; Iwen, Mark A.; Christlieb, Andrew: A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (2019)
  8. Adcock, Ben; Gataric, Milana; Hansen, Anders C.: Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples (2017)
  9. Benedetto, John J.; Nava-Tudela, Alfredo; Powell, Alexander M.; Wang, Yang: A frame reconstruction algorithm with applications to magnetic resonance imaging (2017)
  10. Börm, S.; Börst, C.; Melenk, J. M.: An analysis of a butterfly algorithm (2017)
  11. Caliari, M.; Ostermann, A.; Piazzola, C.: A splitting approach for the magnetic Schrödinger equation (2017)
  12. Chauffert, Nicolas; Ciuciu, Philippe; Kahn, Jonas; Weiss, Pierre: A projection method on measures sets (2017)
  13. Helou, Elias S.; Simões, Lucas E. A.: (\epsilon)-subgradient algorithms for bilevel convex optimization (2017)
  14. Hofmann, Michael; Nestler, Franziska; Pippig, Michael: NFFT based Ewald summation for electrostatic systems with charges and dipoles (2017)
  15. Jyh-Miin Lin: Python Non-Uniform Fast Fourier Transform (PyNUFFT): multi-dimensional non-Cartesian image reconstruction package for heterogeneous platforms and applications to MRI (2017) arXiv
  16. Landa, Boris; Shkolnisky, Yoel: Steerable principal components for space-frequency localized images (2017)
  17. Adcock, Ben; Platte, Rodrigo B.: A mapped polynomial method for high-accuracy approximations on arbitrary grids (2016)
  18. Andersson, Fredrik; Carlsson, Marcus; Nikitin, Viktor V.: Fast algorithms and efficient GPU implementations for the Radon transform and the back-projection operator represented as convolution operators (2016)
  19. Boyer, Claire; Chauffert, Nicolas; Ciuciu, Philippe; Kahn, Jonas; Weiss, Pierre: On the generation of sampling schemes for magnetic resonance imaging (2016)
  20. Domínguez, V.; Ganesh, M.: Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions (2016)

1 2 3 next