Mathematical properties of polynomial dimensional decomposition

From MaRDI portal
Publication:3176246

DOI10.1137/16M1109382zbMATH Open1488.62002arXiv1804.01647OpenAlexW2963113961MaRDI QIDQ3176246FDOQ3176246


Authors: Sharif Rahman Edit this on Wikidata


Publication date: 19 July 2018

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Abstract: Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This study constructs dimension-wise and orthogonal splitting of polynomial spaces, proves completeness of polynomial orthogonal basis for prescribed assumptions, and demonstrates mean-square convergence to the correct limit -- all associated with PDD. A second-moment error analysis reveals that PDD cannot commit larger error than polynomial chaos expansion (PCE) for the appropriately chosen truncation parameters. From the comparison of computational efforts, required to estimate with the same precision the variance of an output function involving exponentially attenuating expansion coefficients, the PDD approximation can be markedly more efficient than the PCE approximation.


Full work available at URL: https://arxiv.org/abs/1804.01647




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: Mathematical properties of polynomial dimensional decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176246)