Efficient calculation of uncertainty quantification

We consider Uncertainty Quantification (UQ) by expanding the solution in so-called generalized Polynomial Chaos expansions. In these expansions the solution is decomposed into a series with orthogonal polynomials in which the parameter dependency becomes an argument of the orthogonal polynomial basis functions. The time and space dependency remains in the coefficients. In UQ two main approaches are in use: Stochastic Collocation (SC) and Stochastic Galerkin (SG). Practice shows that in many cases SC is more efficient for similar accuracy as obtained by SG. In SC the coefficients in the expansion are approximated by quadrature and thus lead to a large series of deterministic simulations for several parameters. We consider strategies to efficiently perform this sequence of deterministic simulations within SC.