UNCERTAINTY QUANTIFICATION IN HIGH-DIMENSIONAL SPACES WITH LOW-RANK TENSOR APPROXIMATIONS - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
U507.pdf (853.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01221017 , version 1 (27-10-2015)

Identifiants

  • HAL Id : hal-01221017 , version 1

Citer

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⟩

Collections

CNRS
333 Consultations
243 Téléchargements

Partager

Gmail Facebook X LinkedIn More