Daniel Potts

Orcid: 0000-0003-3651-4364

According to our database1, Daniel Potts authored at least 65 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Variable transformations in combination with wavelets and ANOVA for high-dimensional approximation.
Adv. Comput. Math., June, 2024

Optimal parameter choice for regularized Shannon sampling formulas.
CoRR, 2024

Operator learning based on sparse high-dimensional approximation.
CoRR, 2024

ANOVA-boosting for Random Fourier Features.
CoRR, 2024

Fast and interpretable Support Vector Classification based on the truncated ANOVA decomposition.
CoRR, 2024

2023
Fast hyperbolic wavelet regression meets ANOVA.
Numerische Mathematik, June, 2023

On the reconstruction of functions from values at subsampled quadrature points.
Math. Comput., June, 2023

Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms.
Numer. Algorithms, April, 2023

Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform.
Frontiers Appl. Math. Stat., 2023

On numerical realizations of Shannon's sampling theorem.
CoRR, 2023

ANOVA approximation with mixed tensor product basis on scattered points.
CoRR, 2023

Optimal density compensation factors for the reconstruction of the Fourier transform of bandlimited functions.
CoRR, 2023

2022
Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation.
SIAM J. Sci. Comput., February, 2022

Learning multivariate functions with low-dimensional structures using polynomial bases.
J. Comput. Appl. Math., 2022

Interpretable Transformed ANOVA Approximation on the Example of the Prevention of Forest Fires.
Frontiers Appl. Math. Stat., 2022

Nonlinear approximation in bounded orthonormal product bases.
CoRR, 2022

On regularized Shannon sampling formulas with localized sampling.
CoRR, 2022

2021
Interpretable Approximation of High-Dimensional Data.
SIAM J. Math. Data Sci., 2021

Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods.
SIAM J. Numer. Anal., 2021

Efficient multivariate approximation on the cube.
Numerische Mathematik, 2021

The uniform sparse FFT with application to PDEs with random coefficients.
CoRR, 2021

Continuous window functions for NFFT.
Adv. Comput. Math., 2021

2020
Grouped Transformations in High-Dimensional Explainable ANOVA Approximation.
CoRR, 2020

A sparse FFT approach for ODE with random coefficients.
Adv. Comput. Math., 2020

A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2020

2019
Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P<sup>2</sup>NFFT method.
J. Comput. Phys., 2019

Uniform error estimates for the NFFT.
CoRR, 2019

Learning high-dimensional additive models on the torus.
CoRR, 2019

2018
NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks.
Frontiers Appl. Math. Stat., 2018

2016
Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT.
Frontiers Appl. Math. Stat., 2016

2015
Fast Ewald summation based on NFFT with mixed periodicity.
J. Comput. Phys., 2015

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling.
J. Complex., 2015

Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form.
J. Complex., 2015

2013
Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation.
SIAM J. Sci. Comput., 2013

2012
Quadrature Errors, Discrepancies, and Their Relations to Halftoning on the Torus and the Sphere.
SIAM J. Sci. Comput., 2012

Interpolation lattices for hyperbolic cross trigonometric polynomials.
J. Complex., 2012

2011
Nonlinear Approximation by Sums of Exponentials and Translates.
SIAM J. Sci. Comput., 2011

On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms.
Numerische Mathematik, 2011

A Continuous Approach to Discrete Ordering on S<sup>2</sup>.
Multiscale Model. Simul., 2011

Quadrature Nodes Meet Stippling Dots.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

2010
Parameter estimation for exponential sums by approximate Prony method.
Signal Process., 2010

Nonequispaced Hyperbolic Cross Fast Fourier Transform.
SIAM J. Numer. Anal., 2010

2009
Using NFFT 3 - A Software Library for Various Nonequispaced Fast Fourier Transforms.
ACM Trans. Math. Softw., 2009

A fast algorithm for nonequispaced Fourier transforms on the rotation group.
Numer. Algorithms, 2009

Probabilistic spherical Marcinkiewicz-Zygmund inequalities.
J. Approx. Theory, 2009

2008
Eidolon: adapting distributed applications to their environment.
PhD thesis, 2008

Fast evaluation of quadrature formulae on the sphere.
Math. Comput., 2008

2007
Field Inhomogeneity Correction Based on Gridding Reconstruction for Magnetic Resonance Imaging.
IEEE Trans. Medical Imaging, 2007

Stability Results for Scattered Data Interpolation by Trigonometric Polynomials.
SIAM J. Sci. Comput., 2007

A Note on the Iterative MRI Reconstruction from Nonuniform k-Space Data.
Int. J. Biomed. Imaging, 2007

2006
Fast evaluation of trigonometric polynomials from hyperbolic crosses.
Numer. Algorithms, 2006

Fast Gauss transforms with complex parameters using NFFTs.
J. Num. Math., 2006

Fast Summation of Radial Functions on the Sphere.
Computing, 2006

Adapting Distributed Shared Memory Applications in Diverse Environments.
Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), 2006

2005
Fast summation based on fast trigonometric transforms at non-equispaced nodes.
Numer. Linear Algebra Appl., 2005

User-Level Device Drivers: Achieved Performance.
J. Comput. Sci. Technol., 2005

2004
Fast convolution with radial kernels at nonequispaced knots.
Numerische Mathematik, 2004

Approximation of Scattered Data by Trigonometric Polynomials on the Torus and the 2-sphere.
Adv. Comput. Math., 2004

Fast Computation of Mutual Information in a Variational Image Registration Approach.
Proceedings of the Bildverarbeitung für die Medizin 2004, Algorithmen - Systeme, 2004

2003
Fast Summation at Nonequispaced Knots by NFFT.
SIAM J. Sci. Comput., 2003

2002
Fast Iterative Methods for Sinc Systems.
SIAM J. Matrix Anal. Appl., 2002

2001
Preconditioners for Ill-Conditioned Toeplitz Systems Constructed from Positive Kernels.
SIAM J. Sci. Comput., 2001

Preconditioners for Nondefinite Hermitian Toeplitz Systems.
SIAM J. Matrix Anal. Appl., 2001

Preconditioners for non-Hermitian Toeplitz systems.
Numer. Linear Algebra Appl., 2001

1998
Fast algorithms for discrete polynomial transforms.
Math. Comput., 1998


  Loading...