October 16 - 17, 2010
We review representation results of the random solutions by so-called "generalized polynomial chaos" (gpc) expansions in countably many variables. We present recent mathematical results on regularity of such solutions as well as computational approaches for the adaptive numerical Galerkin and Collocation approximations of the infinite dimensional parametric, deterministic solution. A key principle are new sparsity estimates of gpc expansions of the parametric solution. We present such estimates for elliptic, parabolic and hyperbolic problems with random coefficients, as well as eigenvalue problems.
We compare the possible convergence rates with the best convergence results on Monte Carlo Finite Element Methods (MCFEM) and on MLMCFEM.
Functions and their
epigraphs, convexity and semicontinuity.
Set convergence and epigraphical limits. Variational geometry,
and subdifferential calculus.
Definition and properties of random sets,
selections. The distribution function
(∼ Choquet capacity) of a random set and convergence in
distribution. The expectation
of a random set and the law of large numbers for random sets.
Average Approximations) of random sets. Application to
stochastic variational inequalities
and related variational problems.
Decomposable spaces. Fatou’s
lemma for random set and random lsc functions. Interchange of
minimization and (conditional)
expectation. Subdifferentiation of expectation functionals.
and application to financial valuation.
of random lsc (lower semicontinuous)
functions and calculus. Stochastic processes with lsc paths.
expectation functionals. Almost sure convergence and
convergence in distribution (epigraphical
sense). The Ergodic Theorem for random lsc functions and its
sampled variational problems, approximation, statistical
estimation and homogenization.