Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
From MaRDI portal
Publication:2989076
DOI10.1145/1555386.1555388zbMATH Open1364.65303OpenAlexW2131768055WikidataQ113310531 ScholiaQ113310531MaRDI QIDQ2989076FDOQ2989076
Authors: Jens Keiner, Stefan Kunis, Daniel Potts 
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1555386.1555388
Recommendations
Packaged methods for numerical algorithms (65Y15) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (77)
- Kernel density estimation on the rotation group and its application to crystallographic texture analysis
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform
- Approximation of high-dimensional periodic functions with Fourier-based methods
- Fast summation of functions on the rotation group
- Highly effective stable evaluation of bandlimited functions on the sphere
- Reliability of the time splitting Fourier method for singular solutions in quantum fluids
- Numerical Computation of Periodic Orbits and Isochrons for State-Dependent Delay Perturbation of an ODE in the Plane
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- Curve based approximation of measures on manifolds by discrepancy minimization
- NFLlib: NTT-Based Fast Lattice Library
- Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions
- A splitting approach for the magnetic Schrödinger equation
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- On the generation of sampling schemes for magnetic resonance imaging
- Fast global optimization on the torus, the sphere, and the rotation group
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- DFTI---a new interface for Fast Fourier Transform libraries
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- An algorithm for total variation regularized photoacoustic imaging
- Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
- Fast ewald summation based on NFFT with mixed periodicity
- Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions
- Uniform error estimates for nonequispaced fast Fourier transforms
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Interpretable approximation of high-dimensional data
- A geometric based preprocessing for weighted ray transforms with applications in SPECT
- Continuous window functions for NFFT
- On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms
- An iterative approach to monochromatic phaseless inverse scattering
- NFFT3
- An analysis of a butterfly algorithm
- NFFT based Ewald summation for electrostatic systems with charges and dipoles
- Efficient calculations of 3-D FFTs on spiral contours
- A Frame Reconstruction Algorithm with Applications to Magnetic Resonance Imaging
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel
- Fast ESPRIT algorithms based on partial singular value decompositions
- Compressive optical deflectometric tomography: a constrained total-variation minimization approach
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform
- Fast cross-validation in harmonic approximation
- An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials
- Beyond first-order finite element schemes in micromagnetics
- Non-uniform FFT for the finite element computation of the micromagnetic scalar potential
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples
- INFFTM: fast evaluation of 3d Fourier series in MATLAB with an application to quantum vortex reconnections
- Direct inversion of the nonequispaced fast Fourier transform
- Steerable principal components for space-frequency localized images
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
- Fast SGL Fourier transforms for scattered data
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- A projection method on measures sets
- Total variation-based reconstruction and phase retrieval for diffraction tomography
- Signal processing approach to mesh refinement in simulations of axisymmetric droplet dynamics
- Correcting the side effects of ADC filtering in MR image reconstruction
- The type 3 nonuniform FFT and its applications
- ANOVA approximation with mixed tensor product basis on scattered points
- Motion detection in diffraction tomography by common circle methods
- The discrete Fourier transform for golden angle linogram sampling
- Computing Weak Distance between the 2-Sphere and Its Nonsmooth Approximations
- BlackNUFFT: modular customizable black box hybrid parallelization of type 3 NUFFT in 3D
- Embracing off-the-grid samples
- Phase retrieval and phaseless inverse scattering with background information
- Unbalanced optimal transport and maximum mean discrepancies: interconnections and rapid evaluation
- Diffraction tomography, Fourier reconstruction, and full waveform inversion
- Factorization of the translation kernel for fast rigid image alignment
- NIFT<scp>y</scp> 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters
- Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
- Numerical reparametrization of periodic planar curves via curvature interpolation
- Efficient algorithms for computing multidimensional integral fractional Laplacians via spherical means
- Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold
- Fast algorithms and efficient GPU implementations for the Radon transform and the back-projection operator represented as convolution operators
- Fast kernel summation in high dimensions via slicing and Fourier transforms
- Spherical harmonics-based pseudo-spectral method for quantitative analysis of symmetry breaking in wrinkling of shells with soft cores
- How exponentially ill-conditioned are contiguous submatrices of the Fourier matrix?
Uses Software
This page was built for publication: Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989076)
