Computational aspects for constructing realizations of polynomial chaos in high dimension

  • Soize C
  • Desceliers C
  • 17


    Mendeley users who have this article in their library.
  • 16


    Citations of this article.


This paper deals with computational aspects related to the construction of realizations of polynomial chaos expansion in high dimension. The method proposed consists of (1) constructing the realizations of the multivariate monomials using a generator of independent realizations of the germs whose probability distribution is the given arbitrary measure and (2) performing an orthogonalization of the realizations of the multivariate monomials with an algorithm different from the Gram–Schmidt orthogonalization algorithm which is not stable in high dimension. A brief review of polynomial chaos expansion with arbitrary measure is given. The statistically independent realizations of multivariate monomials are introduced. The centered statistically independent realizations of orthonormal multivariate polynomials are developed. Finally, a quantification of the errors induced by the usual methods is given.

Author-supplied keywords

  • 1
  • 10
  • 100787830
  • 1137
  • 60h15
  • 60h25
  • 60h35
  • 60h40
  • 65c50
  • ams subject classifications
  • computation
  • doi
  • first introduced by
  • high dimension
  • introduction
  • pce
  • polynomial chaos expansion
  • the polynomial chaos expansion

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • C. Soize

  • C. Desceliers

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free