Computing Statistical Moments Via Tensorization of Polynomial Chaos Expansions
SIAM/ASA Journal on Uncertainty Quantification · 30.06.2024 · 12 (2) · 289-308
DOI: 10.1137/23m155428x ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM/ASA Journal on Uncertainty Quantification, online erschienen am 15.04.2024. Verfasst von Rafael Ballester-Ripoll. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 29 Literaturangaben.
Abstract (Originalsprache)
We present an algorithm for estimating higher-order statistical moments of multidimensional functions expressed as polynomial chaos expansions (PCE). The algorithm starts by decomposing the PCE into a low-rank tensor network using a combination of tensor-train and Tucker decompositions. It then efficiently calculates the desired moments in the compressed tensor domain, leveraging the highly linear structure of the network. Using three benchmark engineering functions, we demonstrate that our approach offers substantial speed improvements over alternative algorithms while maintaining a minimal and adjustable approximation error. Additionally, our method can calculate moments even when the input variable distribution is altered, incurring only a small additional computational cost and without requiring retraining of the regressor.
Zitieren
APA
Ballester-Ripoll, R. (2024). Computing Statistical Moments Via Tensorization of Polynomial Chaos Expansions. SIAM/ASA Journal on Uncertainty Quantification, 12(2), 289-308. https://doi.org/10.1137/23m155428x
Vancouver
Ballester-Ripoll R. Computing Statistical Moments Via Tensorization of Polynomial Chaos Expansions. SIAM/ASA Journal on Uncertainty Quantification. 2024;12(2):289-308. doi:10.1137/23m155428x
BibTeX
@article{BallesterRipoll2024,
author = {Ballester-Ripoll, Rafael},
title = {Computing Statistical Moments Via Tensorization of Polynomial Chaos Expansions},
journal = {SIAM/ASA Journal on Uncertainty Quantification},
year = {2024},
volume = {12},
number = {2},
pages = {289--308},
doi = {10.1137/23m155428x}
}
EUVIMED