Uncertainty quantification of high-dimensional complex systems by multiplicative polynomial dimensional decompositions


  • Professor.

Correspondence to: Sharif Rahman, Department of Mechanical and Industrial Engineering, The University of Iowa, Iowa City, Iowa 52242, USA.



The central theme of this paper is multiplicative polynomial dimensional decomposition (PDD) methods for solving high-dimensional stochastic problems. When a stochastic response is dominantly of multiplicative nature, the standard PDD approximation, predicated on additive function decomposition, may not provide sufficiently accurate probabilistic solutions of a complex system. To circumvent this problem, two multiplicative versions of PDD, referred to as factorized PDD and logarithmic PDD, were developed. Both versions involve a hierarchical, multiplicative decomposition of a multivariate function, a broad range of orthonormal polynomial bases for Fourier-polynomial expansions of component functions, and a dimension-reduction or sampling technique for estimating the expansion coefficients. Three numerical problems involving mathematical functions or uncertain dynamic systems were solved to corroborate how and when a multiplicative PDD is more efficient or accurate than the additive PDD. The results show that indeed, both the factorized and logarithmic PDD approximations can effectively exploit the hidden multiplicative structure of a stochastic response when it exists. Since a multiplicative PDD recycles the same component functions of the additive PDD, no additional cost is incurred. Finally, the random eigensolutions of a sport utility vehicle comprising 40 random variables were evaluated, demonstrating the ability of the new methods to solve industrial-scale problems. Copyright © 2013 John Wiley & Sons, Ltd.