The following pages link to Daniel Potts (Q244861):
Displayed 50 items.
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← links)
- Parameter estimation for nonincreasing exponential sums by Prony-like methods (Q389569) (← links)
- Fast ESPRIT algorithms based on partial singular value decompositions (Q477709) (← links)
- Scattered data approximation on the bisphere and application to texture analysis (Q600863) (← 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 ewald summation based on NFFT with mixed periodicity (Q729086) (← links)
- Fast cross-validation in harmonic approximation (Q778015) (← links)
- Probability against condition number and sampling of multivariate trigonometric random polynomials (Q836668) (← links)
- On the computation of the polar FFT (Q869654) (← links)
- Numerical stability of nonequispaced fast Fourier transforms (Q955087) (← links)
- Parameter estimation for exponential sums by approximate prony method (Q985502) (← links)
- Probabilistic spherical Marcinkiewicz-Zygmund inequalities (Q1019162) (← links)
- On the computation of nonnegative quadrature weights on the sphere (Q1026469) (← links)
- A fast algorithm for nonequispaced Fourier transforms on the rotation group (Q1039276) (← links)
- Fast and stable algorithms for discrete spherical Fourier transforms (Q1307221) (← links)
- Preconditioners for ill-conditioned Toeplitz matrices (Q1307244) (← links)
- A fast algorithm for filtering and wavelet decomposition on the sphere (Q1407723) (← links)
- Fast spherical Fourier algorithms. (Q1412818) (← links)
- Approximation of scattered data by trigonometric polynomials on the torus and the 2-sphere (Q1431330) (← links)
- Fourier reconstruction of functions from their nonstandard sampled Radon transform (Q1565953) (← links)
- Numerical Fourier analysis (Q1755632) (← links)
- Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems (Q1808958) (← links)
- Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677) (← links)
- Fast convolution with radial kernels at nonequispaced knots (Q1882396) (← links)
- Efficient multivariate approximation on the cube (Q1996231) (← links)
- Continuous window functions for NFFT (Q2045089) (← links)
- Uniform error estimates for nonequispaced fast Fourier transforms (Q2073138) (← links)
- The uniform sparse FFT with application to PDEs with random coefficients (Q2098298) (← links)
- On regularized Shannon sampling formulas with localized sampling (Q2098300) (← links)
- A sparse FFT approach for ODE with random coefficients (Q2216613) (← links)
- Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method (Q2221397) (← links)
- Transformed rank-1 lattices for high-dimensional approximation (Q2303354) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form (Q2347961) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (Q2349094) (← links)
- Efficient reconstruction of functions on the sphere from scattered data (Q2384707) (← links)
- Direct inversion of the nonequispaced fast Fourier transform (Q2419062) (← links)
- Sparse polynomial interpolation in Chebyshev bases (Q2437332) (← links)
- Parameter estimation for multivariate exponential sums (Q2450046) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Fast summation of radial functions on the sphere (Q2505233) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms (Q2691905) (← links)
- Preconditioners for Nondefinite Hermitian Toeplitz Systems (Q2706281) (← links)
- Preconditioners for Ill-Conditioned Toeplitz Systems Constructed from Positive Kernels (Q2706464) (← links)
- A new linogram algorithm for computerized tomography (Q2748869) (← links)
- (Q2784764) (← links)
- Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation (Q2855673) (← links)