- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Göttingen, Georg-August Universität, Dissertation, 2016
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Göttingen
- (who)
-
Niedersächsische Staats- und Universitätsbibliothek Göttingen
- (when)
-
2016
- Creator
- Contributor
- Handle
-
11858/00-1735-0000-002B-7C10-0
- URN
-
urn:nbn:de:gbv:7-11858/00-1735-0000-002B-7C10-0-2
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:44 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Wannenwetsch, Katrin Ulrike
- Plonka-Hoch, Gerlind
- Potts, Daniel
- Niedersächsische Staats- und Universitätsbibliothek Göttingen
Time of origin
- 2016
Other Objects (12)
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling
A sparse FFT approach for ODE with random coefficients
Multivariate Chebyshev polynomials and FFT-like algorithms
Fehler in der signalabhängigen FFT : (FFT= Fast Fourier Transform)
The uniform sparse FFT with application to PDEs with random coefficients
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Message passing algorithms for investigating invariants of sparse random graphs
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling
A sparse FFT approach for ODE with random coefficients
Multivariate Chebyshev polynomials and FFT-like algorithms
Fehler in der signalabhängigen FFT : (FFT= Fast Fourier Transform)
The uniform sparse FFT with application to PDEs with random coefficients
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Message passing algorithms for investigating invariants of sparse random graphs
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling
A sparse FFT approach for ODE with random coefficients
Multivariate Chebyshev polynomials and FFT-like algorithms
Fehler in der signalabhängigen FFT : (FFT= Fast Fourier Transform)
The uniform sparse FFT with application to PDEs with random coefficients
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions