NFFT3

swMATH12736MaRDI QIDQ24662FDOQ24662

Author name not available (Why is that?)

Described by source

• Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms

Cited In (72)

• Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation
• Efficient Algorithms for Computing Multidimensional Integral Fractional Laplacians via Spherical Means
• Numerical Computation of Periodic Orbits and Isochrons for State-Dependent Delay Perturbation of an ODE in the Plane
• Effective Discretization of Direct Reconstruction Schemes For Photoacoustic Imaging In Spherical Geometries
• Factorization of the translation kernel for fast rigid image alignment
• Fast Global Optimization on the Torus, the Sphere, and the Rotation Group
• How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?
• Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators
• DCA++: a software framework to solve correlated electron problems with modern quantum cluster methods
• Numerical inversion of the Funk transform on the rotation group
• Kernel density estimation on the rotation group and its application to crystallographic texture analysis
• Fast summation of functions on the rotation group
• Highly effective stable evaluation of bandlimited functions on the sphere
• Reconstructing Multivariate Trigonometric Polynomials by Sampling Along Generated Sets
• Interpretable Approximation of High-Dimensional Data
• Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
• Curve based approximation of measures on manifolds by discrepancy minimization
• Nonuniform Fourier transforms for rigid-body and multidimensional rotational correlations
• Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation
• 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
• A New Algorithm for the Nonequispaced Fast Fourier Transform on the Rotation Group
• 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
• Quadrature Errors, Discrepancies, and Their Relations to Halftoning on the Torus and the Sphere
• 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
• Summability methods for the inversion of the spherical mean operator
• Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions
• Algorithm 1018: FaVeST—Fast Vector Spherical Harmonic Transforms
• Steerable Principal Components for Space-Frequency Localized Images
• Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions
• Uniform error estimates for nonequispaced fast Fourier transforms
• Sparse high-dimensional FFT based on rank-1 lattice sampling
• A geometric based preprocessing for weighted ray transforms with applications in SPECT
• Total Variation-Based Reconstruction and Phase Retrieval for Diffraction Tomography
• 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
• 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
• A Frame Theoretic Approach to the Nonuniform Fast Fourier Transform
• Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods
• Efficient and accurate computation of spherical mean values at scattered center points
• 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
• 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
• Direct inversion of the nonequispaced fast Fourier transform
• Nonlinear Approximation by Sums of Exponentials and Translates
• Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
• ϵ-subgradient algorithms for bilevel convex optimization
• A stable and accurate butterfly sparse Fourier transform
• On the Generation of Sampling Schemes for Magnetic Resonance Imaging
• 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
• Parameter estimation for multivariate exponential sums
• Signal processing approach to mesh refinement in simulations of axisymmetric droplet dynamics
• Correcting the side effects of ADC filtering in MR image reconstruction
• A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids

This page was built for software: NFFT3