Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
From MaRDI portal
Publication:2989076
DOI10.1145/1555386.1555388zbMath1364.65303OpenAlexW2131768055WikidataQ113310531 ScholiaQ113310531MaRDI QIDQ2989076
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
Numerical methods for discrete and fast Fourier transforms (65T50) Packaged methods for numerical algorithms (65Y15)
Related Items (65)
An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions ⋮ Total Variation-Based Reconstruction and Phase Retrieval for Diffraction Tomography ⋮ Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation ⋮ Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples ⋮ Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions ⋮ Automated parameter tuning based on RMS errors for nonequispaced FFTs ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators ⋮ Beyond first-order finite element schemes in micromagnetics ⋮ Non-uniform FFT for the finite element computation of the micromagnetic scalar potential ⋮ An analysis of a butterfly algorithm ⋮ Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Fast summation of functions on the rotation group ⋮ A splitting approach for the magnetic Schrödinger equation ⋮ Numerical Reparametrization of Periodic Planar Curves Via Curvature Interpolation ⋮ NFFT based Ewald summation for electrostatic systems with charges and dipoles ⋮ Kernel density estimation on the rotation group and its application to crystallographic texture analysis ⋮ INFFTM: fast evaluation of 3d Fourier series in MATLAB with an application to quantum vortex reconnections ⋮ Embracing off-the-grid samples ⋮ Direct inversion of the nonequispaced fast Fourier transform ⋮ A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees ⋮ Fast Global Optimization on the Torus, the Sphere, and the Rotation Group ⋮ NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform ⋮ Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold ⋮ Motion detection in diffraction tomography by common circle methods ⋮ Computing Weak Distance between the 2-Sphere and Its Nonsmooth Approximations ⋮ Reliability of the time splitting Fourier method for singular solutions in quantum fluids ⋮ Fast SGL Fourier transforms for scattered data ⋮ Signal processing approach to mesh refinement in simulations of axisymmetric droplet dynamics ⋮ Efficient calculations of 3-D FFTs on spiral contours ⋮ Correcting the side effects of ADC filtering in MR image reconstruction ⋮ A Frame Reconstruction Algorithm with Applications to Magnetic Resonance Imaging ⋮ Efficient Algorithms for Computing Multidimensional Integral Fractional Laplacians via Spherical Means ⋮ On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms ⋮ Interpolation lattices for hyperbolic cross trigonometric polynomials ⋮ Fast ESPRIT algorithms based on partial singular value decompositions ⋮ Compressive optical deflectometric tomography: a constrained total-variation minimization approach ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods ⋮ An iterative approach to monochromatic phaseless inverse scattering ⋮ A projection method on measures sets ⋮ Numerical Computation of Periodic Orbits and Isochrons for State-Dependent Delay Perturbation of an ODE in the Plane ⋮ A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids ⋮ Fast ewald summation based on NFFT with mixed periodicity ⋮ An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials ⋮ Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies ⋮ Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products ⋮ A geometric based preprocessing for weighted ray transforms with applications in SPECT ⋮ Continuous window functions for NFFT ⋮ Factorization of the translation kernel for fast rigid image alignment ⋮ The discrete Fourier transform for golden angle linogram sampling ⋮ NFFT3 ⋮ Curve based approximation of measures on manifolds by discrepancy minimization ⋮ Uniform error estimates for nonequispaced fast Fourier transforms ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Fast cross-validation in harmonic approximation ⋮ Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication ⋮ Interpretable Approximation of High-Dimensional Data ⋮ An algorithm for total variation regularized photoacoustic imaging ⋮ Steerable Principal Components for Space-Frequency Localized Images ⋮ On the Generation of Sampling Schemes for Magnetic Resonance Imaging ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix? ⋮ Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation ⋮ Highly effective stable evaluation of bandlimited functions on the sphere
Uses Software
This page was built for publication: Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
