Hochschulschrift
Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Chemnitz, Technische Universität Chemnitz, Dissertation, 2017
- Keyword
-
Multivariate Approximation
Schnelle Fourier-Transformation
Multivariate Approximation
Schnelle Fourier-Transformation
Diskrete Fourier-Transformation
DCT
- Event
-
Veröffentlichung
- (where)
-
Chemnitz
- (who)
-
Universitätsbibliothek Chemnitz
- (when)
-
2017
- Event
-
Veröffentlichung
- (where)
-
Chemnitz
- (who)
-
Universitätsverlag der Technischen Universität Chemnitz
- (when)
-
2017
- Creator
-
Volkmer, Toni
- Contributor
- URN
-
urn:nbn:de:bsz:ch1-qucosa-222820
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:49 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
- Volkmer, Toni
- Potts, Daniel
- Plonka-Hoch, Gerlind
- Pflüger, Dirk
- Universitätsbibliothek Chemnitz
- Universitätsverlag der Technischen Universität Chemnitz
Time of origin
- 2017
Other Objects (12)
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Deterministic Sparse FFT Algorithms
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Multivariate Chebyshev polynomials and FFT-like algorithms
A sparse FFT approach for ODE with random coefficients
Inference for high-dimensional sparse econometric models
Transformed sparse grids for high-dimensional models
The uniform sparse FFT with application to PDEs with random coefficients
Sparse High-dimensional Approximation from Highly Noisy Data
Spatially adaptive sparse grids for high-dimensional problems
The rank of sparse random matrices
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Deterministic Sparse FFT Algorithms
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Multivariate Chebyshev polynomials and FFT-like algorithms
A sparse FFT approach for ODE with random coefficients
Inference for high-dimensional sparse econometric models
Transformed sparse grids for high-dimensional models
The uniform sparse FFT with application to PDEs with random coefficients
Sparse High-dimensional Approximation from Highly Noisy Data
Spatially adaptive sparse grids for high-dimensional problems
The rank of sparse random matrices
Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling
Deterministic Sparse FFT Algorithms
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
Multivariate Chebyshev polynomials and FFT-like algorithms
A sparse FFT approach for ODE with random coefficients
Inference for high-dimensional sparse econometric models
Transformed sparse grids for high-dimensional models
The uniform sparse FFT with application to PDEs with random coefficients
Sparse High-dimensional Approximation from Highly Noisy Data
Spatially adaptive sparse grids for high-dimensional problems