A spectral-based numerical method for Kolmogorov equations in Hilbert spaces

We propose a numerical solution for the solution of the Fokker-Planck-Kolmogorov (FPK) equations associated with stochastic partial differential equations in Hilbert spaces. The method is based on the spectral decomposition of the Ornstein-Uhlenbeck semigroup associated to the Kolmogorov equation. This allows us to write the solution of the Kolmogorov equation as a deterministic version of the Wiener-Chaos Expansion. By using this expansion we reformulate the Kolmogorov equation as a infinite system of ordinary differential equations, and by truncation it we set a linear finite system of differential equations. The solution of such system allow us to build an approximation to the solution of the Kolmogorov equations. We test the numerical method with the Kolmogorov equations associated with a stochastic diffusion equation, a Fisher-KPP stochastic equation and a stochastic Burgers Eq. in dimension 1.Comment: 28 pages, 10 figure

Faster Comparison of Stopping Times by Nested Conditional Monte Carlo

We show that deliberately introducing a nested simulation stage can lead to significant variance reductions when comparing two stopping times by Monte Carlo. We derive the optimal number of nested simulations and prove that the algorithm is remarkably robust to misspecifications of this number. The method is applied to several problems related to Bermudan/American options. In these applications, our method allows to substantially increase the efficiency of other variance reduction techniques, namely, Quasi-Control Variates and Multilevel Monte Carlo

Approximation of reachable sets using optimal control algorithms

To appearInternational audienceNumerical experiences with a method for the approximation of reachable sets of nonlinear control systems are reported. The method is based on the formulation of suitable optimal control problems with varying objective functions, whose discretization by Euler's method lead to finite dimensional non-convex nonlinear programs. These are solved by a sequential quadratic programming method. An efficient adjoint method for gradient computation is used to reduce the computational costs. The discretization of the state space is more efficiently than by usual sequential realization of Euler's method and allows adaptive calculations or refinements. The method is illustrated for two test examples. Both examples have non-linear dynamics, the first one has a convex reachable set, whereas the second one has a non-convex reachable set

Mini-Workshop: Numerical Upscaling for Media with Deterministic and Stochastic Heterogeneity

This minisymposium was third in series of similar events, after two very successful meetings in 2005 and 2009. The aim was to provide a forum for an extensive discussion on the theoretical aspects and on the areas of application and validity of numerical upscaling approaches for heterogeneous problems with deterministic and stochastic coefficients. The intensive discussions during the meeting contributed to a better understanding of upscaling approaches for multiscale problems with stochastic coefficients, and for synergy between scientists coming to this topic from the area of deterministic multiscale problems on one hand, and those coming from the area of SPDE on the other hand. Recent advanced results on upscaling approaches for deterministic multiscale problems were presented, well mixed with strong presentations on SDE and SPDE. The open problems in these areas were discussed, with emphasis on the case of stochastic coefficients brainstorming numerous numerical upscaling approaches. A number of young researchers, very actively working in these areas, were involved in the workshop discussing the links between scales., thus ensuring the continuity between the generations of researchers