NFFT
From MaRDI portal
Software:19637
swMATH7610MaRDI QIDQ19637FDOQ19637
Author name not available (Why is that?)
Cited In (85)
- Fast convolution with radial kernels at nonequispaced knots
- The Radon transform on SO(3): a Fourier slice theorem and numerical inversion
- Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
- Fast summation of functions on the rotation group
- Highly effective stable evaluation of bandlimited functions on the sphere
- A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture
- Approximation properties of the double Fourier sphere method
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation
- Combined Complex Ridgelet Shrinkage and Total Variation Minimization
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- A splitting approach for the magnetic Schrödinger equation
- Fast Summation at Nonequispaced Knots by NFFT
- Fast summation based on fast trigonometric transforms at non‐equispaced nodes
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- 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 spherical Fourier algorithms.
- Fourier reconstruction for diffraction tomography of an object rotated into arbitrary orientations
- A geometric nonuniform fast Fourier transform
- On the computation of the polar FFT
- A fast method for nonlinear three-dimensional free-surface waves
- Consistency of probability measure quantization by means of power repulsion-attraction potentials
- The uselessness of the fast Gauss transform for summing Gaussian radial basis function series
- A Nonuniform Fast Fourier Transform Based on Low Rank Approximation
- Parameter estimation for exponential sums by approximate prony method
- Uniform error estimates for nonequispaced fast Fourier transforms
- A geometric based preprocessing for weighted ray transforms with applications in SPECT
- Continuous window functions for NFFT
- Fast Gauss transforms with complex parameters using NFFTs
- 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
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel
- Compressive optical deflectometric tomography: a constrained total-variation minimization approach
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- 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
- Beyond first-order finite element schemes in micromagnetics
- Title not available (Why is that?)
- 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
- A new theoretical derivation of NFFT and its implementation on GPU
- Computing the Hilbert transform using biorthogonal spline wavelets
- Iterated Approximate Moving Least Squares Approximation
- On the computation of nonnegative quadrature weights on the sphere
- An SVD in Spherical Surface Wave Tomography
- Direct inversion of the nonequispaced fast Fourier transform
- Fast summation of radial functions on the sphere
- Nonlinear Approximation by Sums of Exponentials and Translates
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
- Extraction of quantifiable information from complex systems
- A stable and accurate butterfly sparse Fourier transform
- On the Generation of Sampling Schemes for Magnetic Resonance Imaging
- Numerical Fourier analysis
- A fast algorithm for filtering and wavelet decomposition on the sphere
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- A Fast Algorithm for Spherical Grid Rotations and Its Application to Singular Quadrature
- A projection method on measures sets
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
- Faster fast evaluation of thin plate splines in two dimensions
- 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
- Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation
- Title not available (Why is that?)
- Concentration inequalities for cross-validation in scattered data approximation
- An algorithm for total variation regularized photoacoustic imaging
- Factorization of the translation kernel for fast rigid image alignment
- Steerable Principal Components for Space-Frequency Localized Images
- Collocation-quadrature methods and fast summation for Cauchy singular integral equations with fixed singularities
- How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?
- A Frame Reconstruction Algorithm with Applications to Magnetic Resonance Imaging
- An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials
- Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- Fast SGL Fourier transforms for scattered data
- Signal processing approach to mesh refinement in simulations of axisymmetric droplet dynamics
- Correcting the side effects of ADC filtering in MR image reconstruction
This page was built for software: NFFT