NFFT3
From MaRDI portal
Software:24662
No author found.
Related Items (72)
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 ⋮ A Stable and Accurate Butterfly Sparse Fourier Transform ⋮ 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 ⋮ Reconstructing Multivariate Trigonometric Polynomials by Sampling Along Generated Sets ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Efficient and accurate computation of spherical mean values at scattered center points ⋮ 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 ⋮ DCA++: a software framework to solve correlated electron problems with modern quantum cluster methods ⋮ 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 ⋮ Parameter estimation for multivariate exponential sums ⋮ 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 ⋮ A New Algorithm for the Nonequispaced Fast Fourier Transform on the Rotation Group ⋮ Quadrature Errors, Discrepancies, and Their Relations to Halftoning on the Torus and the Sphere ⋮ Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods ⋮ An iterative approach to monochromatic phaseless inverse scattering ⋮ Numerical inversion of the Funk transform on the rotation group ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Nonequispaced Hyperbolic Cross Fast Fourier Transform ⋮ 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 ⋮ Curve based approximation of measures on manifolds by discrepancy minimization ⋮ Nonlinear Approximation by Sums of Exponentials and Translates ⋮ 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 ⋮ Effective Discretization of Direct Reconstruction Schemes For Photoacoustic Imaging In Spherical Geometries ⋮ Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication ⋮ Nonuniform Fourier Transforms for Rigid-Body and Multidimensional Rotational Correlations ⋮ Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation ⋮ A Frame Theoretic Approach to the Nonuniform Fast Fourier Transform ⋮ Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions ⋮ 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 ⋮ ϵ-subgradient algorithms for bilevel convex optimization ⋮ Algorithm 1018: FaVeST—Fast Vector Spherical Harmonic Transforms ⋮ 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
This page was built for software: NFFT3
