The following pages link to NFFT (Q19637):
Displaying 50 items.
- Highly effective stable evaluation of bandlimited functions on the sphere (Q261861) (← links)
- Consistency of probability measure quantization by means of power repulsion-attraction potentials (Q301584) (← links)
- Beyond first-order finite element schemes in micromagnetics (Q348340) (← links)
- Computing the Hilbert transform using biorthogonal spline wavelets (Q357264) (← links)
- Faster fast evaluation of thin plate splines in two dimensions (Q390470) (← links)
- Compressive optical deflectometric tomography: a constrained total-variation minimization approach (Q479857) (← links)
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data (Q489772) (← links)
- A projection method on measures sets (Q515908) (← links)
- Fast summation of functions on the rotation group (Q600861) (← links)
- On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms (Q652262) (← links)
- Interpolation lattices for hyperbolic cross trigonometric polynomials (Q657653) (← links)
- Fast cross-validation in harmonic approximation (Q778015) (← links)
- Approximation properties of the double Fourier sphere method (Q831775) (← links)
- A geometric nonuniform fast Fourier transform (Q843457) (← links)
- The uselessness of the fast Gauss transform for summing Gaussian radial basis function series (Q846561) (← links)
- On the computation of the polar FFT (Q869654) (← links)
- Parameter estimation for exponential sums by approximate prony method (Q985502) (← links)
- On the computation of nonnegative quadrature weights on the sphere (Q1026469) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- A fast algorithm for nonequispaced Fourier transforms on the rotation group (Q1039276) (← links)
- A fast algorithm for filtering and wavelet decomposition on the sphere (Q1407723) (← links)
- Fast spherical Fourier algorithms. (Q1412818) (← links)
- An analysis of a butterfly algorithm (Q1667632) (← links)
- A new theoretical derivation of NFFT and its implementation on GPU (Q1690700) (← links)
- Numerical Fourier analysis (Q1755632) (← links)
- Fast convolution with radial kernels at nonequispaced knots (Q1882396) (← links)
- Efficient and accurate computation of spherical mean values at scattered center points (Q1940216) (← links)
- A geometric based preprocessing for weighted ray transforms with applications in SPECT (Q2042425) (← links)
- Continuous window functions for NFFT (Q2045089) (← links)
- Uniform error estimates for nonequispaced fast Fourier transforms (Q2073138) (← links)
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication (Q2087418) (← links)
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation (Q2113655) (← links)
- Concentration inequalities for cross-validation in scattered data approximation (Q2120815) (← links)
- Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation (Q2134542) (← links)
- A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture (Q2138700) (← links)
- Fast SGL Fourier transforms for scattered data (Q2197962) (← links)
- Signal processing approach to mesh refinement in simulations of axisymmetric droplet dynamics (Q2199785) (← links)
- Correcting the side effects of ADC filtering in MR image reconstruction (Q2203375) (← links)
- Extraction of quantifiable information from complex systems (Q2250273) (← links)
- Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies (Q2287853) (← links)
- An algorithm for total variation regularized photoacoustic imaging (Q2348696) (← links)
- A splitting approach for the magnetic Schrödinger equation (Q2406627) (← links)
- Direct inversion of the nonequispaced fast Fourier transform (Q2419062) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Fast summation of radial functions on the sphere (Q2505233) (← links)
- An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials (Q2512833) (← links)
- Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples (Q2627890) (← links)
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform (Q2659728) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
