D. Potts

发表

On the computation of the polar FFT

M. Fenn, Stefan Kunis, D. Potts, 2007 .

Error Estimates for the ESPRIT Algorithm

D. Potts, M. Tasche, 2017 .

Parameter estimation for nonincreasing exponential sums by Prony-like methods

D. Potts, M. Tasche, 2013 .

Sampling Sets and Quadrature Formulae on the Rotation Group

D. Potts, M. Gräf, 2009 .

A sparse Prony FFT

Stefan Kunis, D. Potts, S. Heider, 2013 .

Preconditioners for non‐Hermitian Toeplitz systems

R. Chan, G. Steidl, D. Potts, 2001 .

Circulant Preconditioners for Indefinite Toeplitz Systems

M. Ng, D. Potts, 2001 .

Fast spherical Fourier algorithms

Stefan Kunis, D. Potts, 2003 .

Parameter estimation for multivariate exponential sums

D. Potts, M. Tasche, 2011 .

Fast ESPRIT algorithms based on partial singular value decompositions

Daniel Potts, Manfred Tasche, D. Potts, 2015 .

High-Dimensional FFT

G. Plonka, G. Steidl, D. Potts, 2018 .

Sparse high-dimensional FFT based on rank-1 lattice sampling

D. Potts, Toni Volkmer, 2016 .

Approximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling

D. Potts, L. Kämmerer, Toni Volkmer, 2013 .

Multidimensional Fourier Methods

G. Plonka, G. Steidl, D. Potts, 2018 .

Numerical stability of nonequispaced fast Fourier transforms

Daniel Potts, Manfred Tasche, D. Potts, 2008 .

Fast Fourier Transforms

G. Plonka, G. Steidl, D. Potts, 2018 .

Optimal trigonometrie preeonditioners for nonsymmetrie Toeplitz systems

G. Steidl, D. Potts, 2022 .

Scattered Data Approximation on the Bisphere and Application to Texture Analysis

D. Potts, F. Filbir, 2010 .

NFFT 3.3-Tutorial

Stefan Kunis, D. Potts, J. Keiner, 2019 .

Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions

Stefan Kunis, D. Potts, L. Kämmerer, 2014 .

Fast Spherical Fourier Transforms and Applications

D. Potts, Jürgen Prestin, J. Keiner, 2005 .

NFFT 2 . 0 May 4 , 2005

Stefan Kunis, D. Potts, 2005 .

Fast, exact and stable reconstruction of multivariate algebraic polynomials in Chebyshev form

D. Potts, Toni Volkmer, 2015 .

Fast and exact reconstruction of arbitrary multivariate algebraic polynomials in Chebyshev form

D. Potts, Toni Volkmer, 2015, 2015 International Conference on Sampling Theory and Applications (SampTA).

Numerical Applications of DFT

G. Plonka, G. Steidl, D. Potts, 2018 .

Preconditioning of Hermitian block-Toeplitz-Toeplitz-block matrices by level-1 preconditioners

G. Steidl, D. Potts, 2001 .

Trigonometric Preconditioners for Block Toeplitz Systems

Gabriele Steidl, Daniel Potts, Manfred Tasche, 1997 .

Calculation of 3D Space-Charge Fields of Bunches of Charged Particles by Fast Summation

D. Potts, U. Rienen, G. Poplau, 2006 .

Numerical stability of fast trigonometric transforms: a worst case study

G. Steidl, D. Potts, M. Tasche, 2003 .

Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms

D. Potts, M. Tasche, M. Kircheis, 2021, Numerical Algorithms.

Fourier extension and sampling on the sphere

D. Potts, Niel Van Buggenhout, Niel Van Buggenhout, 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).

An SVD in Spherical Surface Wave Tomography

D. Potts, R. Hielscher, M. Quellmalz, 2017, 1706.05284.

Uniform error estimates for the NFFT

D. Potts, M. Tasche, 2019, ArXiv.

Stability Results for Scattered Data Interpolation by Trigonometric Polynomials

Stefan Kunis, D. Potts, 2007, SIAM J. Sci. Comput..

Variable Transformations in combination with Wavelets and ANOVA for high-dimensional approximation

D. Potts, Laura Lippert, 2022, ArXiv.

Stability Results for Scattered Data Interpolation by Trigonometric Polynomials

Stefan Kunis, D. Potts, 2007, SIAM J. Sci. Comput..

The uniform sparse FFT with application to PDEs with random coefficients

D. Potts, L. Kämmerer, Fabian Taubert, 2021, Sampling Theory, Signal Processing, and Data Analysis.

On the reconstruction of functions from values at subsampled quadrature points

D. Potts, Felix Bartel, L. Kämmerer, 2022, 2208.13597.

PRECONDITIONERS FOR NONDEFINITE HERMITIAN

R. Chan, G. Steidl, D. Potts, 2000 .

On regularized Shannon sampling formulas with localized sampling

D. Potts, M. Tasche, M. Kircheis, 2022, Sampling Theory, Signal Processing, and Data Analysis.

Learning high-dimensional functions on the torus.

D. Potts, Michael Schmischke, 2020 .

Fast Fourier Transforms for Nonequispaced Data

Gabriele Steidl, Daniel Potts, Manfred Tasche, 2018 .

Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms

Stefan Kunis, Daniel Potts, Jens Keiner, 2009, TOMS.

Field Inhomogeneity Correction Based on Gridding Reconstruction for Magnetic Resonance Imaging

Tobias Knopp, Daniel Potts, Holger Eggers, 2007, IEEE Transactions on Medical Imaging.

Fast Fourier Transforms for Nonequispaced Data: A Tutorial

Gabriele Steidl, Daniel Potts, Manfred Tasche, 2001 .

NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks pdf

Martin Stoll, Toni Volkmer, Daniel Potts, 2018, Front. Appl. Math. Stat..

Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P2NFFT method

Daniel Potts, Christian Holm, Michael Pippig, 2018, J. Comput. Phys..

Quadrature Errors, Discrepancies, and Their Relations to Halftoning on the Torus and the Sphere

Gabriele Steidl, Manuel Gräf, Daniel Potts, 2012, SIAM J. Sci. Comput..

Efficient Reconstruction of Functions on the Sphere from Scattered Data

Stefan Kunis, Daniel Potts, Jens Keiner, 2007 .

Approximation of Scattered Data by Trigonometric Polynomials on the Torus and the 2-sphere

Daniel Potts, D. Potts, 2004, Adv. Comput. Math..

A fast algorithm for filtering and wavelet decomposition on the sphere.

Daniel Potts, B Martin, D. Potts, 2003 .

On the computation of nonnegative quadrature weights on the sphere

Stefan Kunis, Manuel Gräf, Daniel Potts, 2009 .

Interpolation lattices for hyperbolic cross trigonometric polynomials

Lutz Kämmerer, Stefan Kunis, Daniel Potts, 2012, J. Complex..

Fast evaluation of trigonometric polynomials from hyperbolic crosses

Stefan Kunis, Daniel Potts, Markus Fenn, 2006, Numerical Algorithms.

Reconstruction of sparse Legendre and Gegenbauer expansions

D. Potts, M. Tasche, 2016 .

Parameter estimation for exponential sums by approximate Prony method

Daniel Potts, Manfred Tasche, D. Potts, 2010, Signal Process..

A fast algorithm for nonequispaced Fourier transforms on the rotation group

Daniel Potts, Jürgen Prestin, Antje Vollrath, 2009, Numerical Algorithms.

Fast evaluation of quadrature formulae on the sphere

Daniel Potts, Jens Keiner, D. Potts, 2008, Math. Comput..

Direct inversion of the nonequispaced fast Fourier transform

Daniel Potts, Melanie Kircheis, D. Potts, 2018, Linear Algebra and its Applications.

Fast algorithms for discrete polynomial transforms

Gabriele Steidl, Daniel Potts, Manfred Tasche, 1998, Math. Comput..

Fourier Reconstruction of Functions from their Nonstandard Sampled Radon Transform

Gabriele Steidl, Daniel Potts, G. Steidl, 2002 .

Numerical Fourier Analysis

Gabriele Steidl, Daniel Potts, Manfred Tasche, 2019, Fundamentals of Numerical Mathematics for Physicists and Engineers.

On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms

Manuel Gräf, Daniel Potts, D. Potts, 2011, Numerische Mathematik.

Collocation–quadrature methods and fast summation for Cauchy singular integral equations with fixed singularities

D. Potts, P. Junghanns, R. Kaiser, 2016 .

Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform

D. Potts, M. Kircheis, 2023, Frontiers in Applied Mathematics and Statistics.

NFFT 3 . 0-Tutorial

Stefan Kunis, Daniel Potts, Jens Keiner, 2006 .

Time and memory requirements of the Nonequispaced FFT

Stefan Kunis, Daniel Potts, Stefan Kunis, 2006 .

Prony Method for Reconstruction of Structured Functions

Gabriele Steidl, Daniel Potts, Manfred Tasche, 2018 .

NFFT error pdf

Daniel Potts, Manfred Tasche, D. Potts, 2019 .

Fast Ewald summation based on NFFT with mixed periodicity

Daniel Potts, Michael Pippig, Franziska Nestler, 2015, J. Comput. Phys..

Nonequispaced Hyperbolic Cross Fast Fourier Transform

Michael Döhler, Stefan Kunis, Daniel Potts, 2010, SIAM J. Numer. Anal..

Fast convolution with radial kernels at nonequispaced knots

Gabriele Steidl, Daniel Potts, Arthur Nieslony, 2004, Numerische Mathematik.

Spherical Wavelets with an Application in Preferred Crystallographic Orientation

Daniel Potts, Helmut Schaeben, Jürgen Prestin, 2001 .

A Note on the Iterative MRI Reconstruction from Nonuniform k-Space Data

Stefan Kunis, Tobias Knopp, Daniel Potts, 2007, Int. J. Biomed. Imaging.

A new linogram algorithm for computerized tomography

Gabriele Steidl, Daniel Potts, G. Steidl, 2001 .

Adapting distributed shared memory applications in diverse environments

Ihor Kuz, Daniel Potts, D. Potts, 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

Eidolon: Adapting distributed applications to their environment

Daniel Potts, D. Potts, 2008 .

Fast Iterative Methods for Sinc Systems

Michael K. Ng, Daniel Potts, M. Ng, 2002, SIAM J. Matrix Anal. Appl..

Preconditioners for Ill-Conditioned Toeplitz Matrices

Gabriele Steidl, Daniel Potts, G. Steidl, 1999 .

Fast hyperbolic wavelet regression meets ANOVA pdf

Daniel Potts, Tino Ullrich, Laura Lippert, 2021, Numerische Mathematik.

On the reconstruction of functions from values at subsampled quadrature points

D. Potts, Felix Bartel, L. Kämmerer, 2022, Math. Comput..

Nonlinear approximation in bounded orthonormal product bases

D. Potts, L. Kämmerer, Fabian Taubert, 2022, Sampling Theory, Signal Processing, and Data Analysis.

High-dimensional sparse FFT based on sampling along multiple rank-1 lattices

Toni Volkmer, Daniel Potts, Lutz Kammerer, 2017, Applied and Computational Harmonic Analysis.

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

Lutz Kämmerer, Toni Volkmer, Daniel Potts, 2015, J. Complex..

Fast algorithms for discrete polynomial transforms on arbitrary grids

Daniel Potts, D. Potts, 2003 .

Interpretable Approximation of High-Dimensional Data

Daniel Potts, Michael Schmischke, D. Potts, 2021, SIAM J. Math. Data Sci..

Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods

D. Potts, Michael Schmischke, 2019, SIAM J. Numer. Anal..

Multivariate sparse FFT based on rank-1 Chebyshev lattice sampling

Toni Volkmer, Daniel Potts, D. Potts, 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).

Uniform error estimates for nonequispaced fast Fourier transforms

Daniel Potts, Manfred Tasche, D. Potts, 2019, Sampling Theory, Signal Processing, and Data Analysis.

Fast and stable algorithms for discrete spherical Fourier transforms

Gabriele Steidl, Daniel Potts, Manfred Tasche, 1998 .

Fast Summation at Nonequispaced Knots by NFFT

Gabriele Steidl, Daniel Potts, G. Steidl, 2003, SIAM J. Sci. Comput..

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

Lutz Kämmerer, Toni Volkmer, Daniel Potts, 2015, J. Complex..

On numerical realizations of Shannon's sampling theorem

D. Potts, M. Tasche, M. Kircheis, 2023, ArXiv.

Nonequispaced Fast Fourier Transform Boost for the Sinkhorn Algorithm

D. Potts, A. Pichler, Rajmadan Lakshmanan, 2022, ETNA - Electronic Transactions on Numerical Analysis.

Fast Summation of Radial Functions on the Sphere

Stefan Kunis, Daniel Potts, Jens Keiner, 2006, Computing.

A Continuous Approach to Discrete Ordering on S2

Axel Voigt, Thomas Witkowski, Manuel Gräf, 2011, Multiscale Model. Simul..

Probabilistic spherical Marcinkiewicz-Zygmund inequalities

Stefan Kunis, Daniel Potts, Albrecht Böttcher, 2009, J. Approx. Theory.

Sparse polynomial interpolation in Chebyshev bases

Daniel Potts, Manfred Tasche, D. Potts, 2014 .

Nonlinear Approximation by Sums of Exponentials and Translates

Daniel Potts, Manfred Tasche, Thomas Peter, 2011, SIAM J. Sci. Comput..

Nonlinear approximation by sums of nonincreasing exponentials

Daniel Potts, Manfred Tasche, D. Potts, 2011 .

Fast Gauss transforms with complex parameters using NFFTs

Gabriele Steidl, Stefan Kunis, Daniel Potts, 2006, J. Num. Math..

Learning multivariate functions with low-dimensional structures using polynomial bases

D. Potts, Michael Schmischke, 2019, J. Comput. Appl. Math..

A Fast Fourier Algorithm on the Rotation Group

D. Potts, Jürgen Prestin, A. Vollrath, 2007 .

Fast cross-validation in harmonic approximation

Daniel Potts, Ralf Hielscher, Felix Bartel, 2019, Applied and Computational Harmonic Analysis.

The Radon transform on SO(3): a Fourier slice theorem and numerical inversion

M Schmalz, Daniel Potts, Helmut Schaeben, 2008 .

A fast algorithm for spherical filtering on arbitrary grids

Daniel Potts, Martin Bohme, D. Potts, 2003, SPIE Optics + Photonics.

Accuracy of Spike-Train Fourier Reconstruction for Near-Colliding Nodes 13

George Labahn, Annie A. M. Cuyt, Wen-shin Lee, 2015 .

A sparse FFT approach for ODE with random coefficients

D. Potts, L. Kämmerer, M. Bochmann, 2019, Advances in Computational Mathematics.

Comparison of scalable fast methods for long-range interactions.

Michael Hofmann, Godehard Sutmann, Matthias Bolten, 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation

Daniel Potts, Michael Pippig, D. Potts, 2013, SIAM J. Sci. Comput..

Preconditioners for Ill-Conditioned Toeplitz Systems Constructed from Positive Kernels

Gabriele Steidl, Daniel Potts, G. Steidl, 2000, SIAM J. Sci. Comput..

User-Level Device Drivers: Achieved Performance

Gernot Heiser, Kevin Elphinstone, Stefan Götz, 2005, Journal of Computer Science and Technology.