Navigation

Springe zum Hauptinhalt
Universitätsbibliothek
Universitätsbibliographie

Ergebnis der Datenbankabfrage

Nr. Titel Autor Jahr
1 A sparse FFT approach for ODE with random coefficients Bochmann, Maximilian et al. 2020
2 Continuous window functions for NFFT Potts, Daniel et al. 2020
3 Fast cross-validation in harmonic approximation Bartel, Felix et al. 2020
4 Grouped Transformations in High-Dimensional Explainable ANOVA Approximation Potts, Daniel et al. 2020
5 High-dimensional sparse FFT based on sampling along multiple rank-1 lattices Kämmerer, Lutz* et al. 2020
6 Reconstructing Functions on the Sphere from Circular Means Quellmalz, Michael 2020
7 Transformed Rank-1 Lattices for high-dimensional approximation Nasdala, Robert et al. 2020
8 A sparse FFT approach for ODE with random coefficients Potts, Daniel et al. 2019
9 Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P2NFFT method Potts, Daniel et al. 2019
10 Direct inversion of the nonequispaced fast Fourier transform Potts, Daniel* et al. 2019
11 Efficient multivariate approximation on the cube Potts, Daniel et al. 2019
12 Fast Cross-validation in Harmonic Approximation Potts, Daniel et al. 2019
13 Learning high-dimensional additive models on the torus Potts, Daniel et al. 2019
14 Learning multivariate functions with low-dimensional structures using polynomials bases Potts, Daniel et al. 2019
15 Numerical Fourier Analysis Potts, Daniel et al. 2019
16 Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P2NFFT method Potts, Daniel et al. 2018
17 An SVD in Spherical Surface Wave Tomography Potts, Daniel et al. 2018
18 Direct inversion of the nonequispaced fast Fourier transform Potts, Daniel et al. 2018
19 Efficient Computation of Electrostatic Interactions in Particle Systems Based on Nonequispaced Fast Fourier Transforms Nestler, Franziska 2018
20 NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks Potts, Daniel et al. 2018
Aktuelle Seite:
Anzahl der Ergebnisseiten: 5
Anzahl der Dokumente: 92

Presseartikel

Soziale Medien

Verbinde dich mit uns: