UNCERTAINTY QUANTIFICATION IN HIGH-DIMENSIONAL SPACES WITH LOW-RANK TENSOR APPROXIMATIONS

Abstract : Polynomial chaos expansions have proven powerful for emulating responses of computational models with random input in a wide range of applications. However, they suffer from the curse of dimensionality, meaning the exponential growth of the number of unknown coefficients with the input dimension. By exploiting the tensor product form of the polynomial basis, low-rank approximations drastically reduce the number of unknown coefficients, thus providing a promising tool for effectively dealing with high-dimensional problems. In this paper, first, we investigate the construction of low-rank approximations with greedy approaches, where the coefficients along each dimension are sequentially updated and the rank of the decomposition is progressively increased. Furthermore, we demonstrate the efficiency of the approach in different applications, also in comparison with state-of-art methods of polynomial chaos expansions.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01221017
Contributor : Katerina Konakli <>
Submitted on : Tuesday, October 27, 2015 - 11:48:18 AM
Last modification on : Tuesday, March 5, 2019 - 9:30:11 AM
Document(s) archivé(s) le : Thursday, January 28, 2016 - 10:41:11 AM

File

U507.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01221017, version 1

Collections

Citation

Katerina Konakli, Bruno Sudret. UNCERTAINTY QUANTIFICATION IN HIGH-DIMENSIONAL SPACES WITH LOW-RANK TENSOR APPROXIMATIONS. 1st International Conference on Uncertainty Quantification in Computational Sciences and Engineering, May 2015, Crete Island, Greece. ⟨hal-01221017⟩

Share

Metrics

Record views

193

Files downloads

141