NFFT3

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 44 articles , 1 standard article )

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

1 2 3 next

  1. Adcock, Ben; Gataric, Milana; Hansen, Anders C.: Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples (2017)
  2. Caliari, M.; Ostermann, A.; Piazzola, C.: A splitting approach for the magnetic Schrödinger equation (2017)
  3. Chauffert, Nicolas; Ciuciu, Philippe; Kahn, Jonas; Weiss, Pierre: A projection method on measures sets (2017)
  4. Helou, Elias S.; Simões, Lucas E.A.: $\epsilon$-subgradient algorithms for bilevel convex optimization (2017)
  5. Hofmann, Michael; Nestler, Franziska; Pippig, Michael: NFFT based Ewald summation for electrostatic systems with charges and dipoles (2017)
  6. 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
  7. Landa, Boris; Shkolnisky, Yoel: Steerable principal components for space-frequency localized images (2017)
  8. Adcock, Ben; Platte, Rodrigo B.: A mapped polynomial method for high-accuracy approximations on arbitrary grids (2016)
  9. 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)
  10. Boyer, Claire; Chauffert, Nicolas; Ciuciu, Philippe; Kahn, Jonas; Weiss, Pierre: On the generation of sampling schemes for magnetic resonance imaging (2016)
  11. Domínguez, V.; Ganesh, M.: Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions (2016)
  12. Ivanov, Kamen G.; Petrushev, Pencho P.: Highly effective stable evaluation of bandlimited functions on the sphere (2016)
  13. Nestler, Franziska: Automated parameter tuning based on RMS errors for nonequispaced FFTs (2016)
  14. Nestler, Franziska: An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions (2016)
  15. Potts, Daniel; Volkmer, Toni: Sparse high-dimensional FFT based on rank-1 lattice sampling (2016)
  16. Dong, Yiqiu; Görner, Torsten; Kunis, Stefan: An algorithm for total variation regularized photoacoustic imaging (2015)
  17. Erb, Wolfgang; Mathias, Sonja: An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials (2015)
  18. Gräf, Manuel; Hielscher, Ralf: Fast global optimization on the torus, the sphere, and the rotation group (2015)
  19. Nestler, Franziska; Pippig, Michael; Potts, Daniel: Fast ewald summation based on NFFT with mixed periodicity (2015)
  20. Potts, Daniel; Tasche, Manfred: Fast ESPRIT algorithms based on partial singular value decompositions (2015)

1 2 3 next