It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the “curse of dimensionality" in some degree. In this note, we give the error estimate of hyperbolic cross (HC) approximations with all sorts of Askey polynomials. These polynomials are useful in generalized polynomial chaos (gPC) in the field of uncertainty quantification. The exponential convergences in both regular and optimized HC approximations have been shown under the condition that the random variable depends on the random inputs smoothly in some degree. Moreover, we apply gPC to numerically solve the ordinary differential equations with slightly higher dimensional random inputs. Both regular and optimized HC have been investigated with Laguerre-chaos, Charlier-chaos and Hermite-chaos in the numerical experiment. The discussion of the connection between the standard ANOVA approximation and Galerkin approximation is in the appendix.

No abstract uploaded!

No abstract uploaded!

The present paper is devoted to the theory of discontinuous Markoff processes, that is processes where the transitions between states take place either by “jumps” of some specified kind, or by other means. States are taken as point$x$in an abstract space;$phases$are points ($x, t$) in the product state×time space; sets of states are denoted by$X$, sets of phases by$S$.

No abstract uploaded!