Springe zum Hauptinhalt
Universitätsbibliothek
Universitätsbibliographie
Universitätsbibliothek 

Ergebnis der Datenbankabfrage

Nr. Titel Autor Jahr
1 Computation of the Fourier transform for a continuous integrable function via NFFT Potts, Daniel* et al. 2026
2 How well do fast discrete trigonometric transforms work for parametric numerical integration? Potts, Daniel et al. 2026
3 Some remarks on regularized Shannon sampling formulas Potts, Daniel et al. 2025
4 On numerical realizations of Shannon's sampling theorem Potts, Daniel et al. 2024
5 Optimal parameter choice for regularized Shannon sampling formulas Potts, Daniel et al. 2024
6 Some remarks on regularized Shannon sampling formulas Kircheis, Melanie* et al. 2024
7 Numerical Fourier Analysis Potts, Daniel et al. 2023
8 On numercal realizations of Shannon's sampling theorem Potts, Daniel et al. 2023
9 Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms Potts, Daniel* et al. 2022
10 On regularized Shannon sampling formulas with localized sampling Potts, Daniel et al. 2022
11 Continuous window functions for NFFT Potts, Daniel* et al. 2021
12 Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms Potts, Daniel et al. 2021
13 Uniform error estimates for nonequispaced fast Fourier transforms Potts, Daniel* et al. 2021
14 Continuous window functions for NFFT Potts, Daniel et al. 2020
15 Numerical Fourier Analysis Potts, Daniel et al. 2019
16 Error estimates for the ESPRIT algorithm Potts, Daniel* et al. 2017
17 Efficient spectral estimation by MUSIC and ESPRIT with application to sparse FFT Potts, Daniel* et al. 2016
18 Reconstruction of sparse Legendre and Gegenbauer expansions Potts, Daniel* et al. 2016
19 Efficient spectral estimation by MUSIC and ESPRIT with application to sparse FFT Potts, Daniel et al. 2015
20 Error estimates for the ESPRIT algorithm Potts, Daniel et al. 2015
Aktuelle Seite:
Anzahl der Ergebnisseiten: 2
Anzahl der Dokumente: 35

Soziale Medien

Verbinde dich mit uns: