13,814 research outputs found
Singularly perturbed forward-backward stochastic differential equations: application to the optimal control of bilinear systems
We study linear-quadratic stochastic optimal control problems with bilinear
state dependence for which the underlying stochastic differential equation
(SDE) consists of slow and fast degrees of freedom. We show that, in the same
way in which the underlying dynamics can be well approximated by a reduced
order effective dynamics in the time scale limit (using classical
homogenziation results), the associated optimal expected cost converges in the
time scale limit to an effective optimal cost. This entails that we can well
approximate the stochastic optimal control for the whole system by the reduced
order stochastic optimal control, which is clearly easier to solve because of
lower dimensionality. The approach uses an equivalent formulation of the
Hamilton-Jacobi-Bellman (HJB) equation, in terms of forward-backward SDEs
(FBSDEs). We exploit the efficient solvability of FBSDEs via a least squares
Monte Carlo algorithm and show its applicability by a suitable numerical
example
Optimal control of multiscale systems using reduced-order models
We study optimal control of diffusions with slow and fast variables and
address a question raised by practitioners: is it possible to first eliminate
the fast variables before solving the optimal control problem and then use the
optimal control computed from the reduced-order model to control the original,
high-dimensional system? The strategy "first reduce, then optimize"--rather
than "first optimize, then reduce"--is motivated by the fact that solving
optimal control problems for high-dimensional multiscale systems is numerically
challenging and often computationally prohibitive. We state sufficient and
necessary conditions, under which the "first reduce, then control" strategy can
be employed and discuss when it should be avoided. We further give numerical
examples that illustrate the "first reduce, then optmize" approach and discuss
possible pitfalls
A unified approach for the solution of the Fokker-Planck equation
This paper explores the use of a discrete singular convolution algorithm as a
unified approach for numerical integration of the Fokker-Planck equation. The
unified features of the discrete singular convolution algorithm are discussed.
It is demonstrated that different implementations of the present algorithm,
such as global, local, Galerkin, collocation, and finite difference, can be
deduced from a single starting point. Three benchmark stochastic systems, the
repulsive Wong process, the Black-Scholes equation and a genuine nonlinear
model, are employed to illustrate the robustness and to test accuracy of the
present approach for the solution of the Fokker-Planck equation via a
time-dependent method. An additional example, the incompressible Euler
equation, is used to further validate the present approach for more difficult
problems. Numerical results indicate that the present unified approach is
robust and accurate for solving the Fokker-Planck equation.Comment: 19 page
A probabilistic algorithm approximating solutions of a singular PDE of porous media type
The object of this paper is a one-dimensional generalized porous media
equation (PDE) with possibly discontinuous coefficient , which is
well-posed as an evolution problem in . In some recent papers
of Blanchard et alia and Barbu et alia, the solution was represented by the
solution of a non-linear stochastic differential equation in law if the initial
condition is a bounded integrable function. We first extend this result, at
least when is continuous and the initial condition is only integrable
with some supplementary technical assumption. The main purpose of the article
consists in introducing and implementing a stochastic particle algorithm to
approach the solution to (PDE) which also fits in the case when is
possibly irregular, to predict some long-time behavior of the solution and in
comparing with some recent numerical deterministic techniques
The instanton method and its numerical implementation in fluid mechanics
A precise characterization of structures occurring in turbulent fluid flows
at high Reynolds numbers is one of the last open problems of classical physics.
In this review we discuss recent developments related to the application of
instanton methods to turbulence. Instantons are saddle point configurations of
the underlying path integrals. They are equivalent to minimizers of the related
Freidlin-Wentzell action and known to be able to characterize rare events in
such systems. While there is an impressive body of work concerning their
analytical description, this review focuses on the question on how to compute
these minimizers numerically. In a short introduction we present the relevant
mathematical and physical background before we discuss the stochastic Burgers
equation in detail. We present algorithms to compute instantons numerically by
an efficient solution of the corresponding Euler-Lagrange equations. A second
focus is the discussion of a recently developed numerical filtering technique
that allows to extract instantons from direct numerical simulations. In the
following we present modifications of the algorithms to make them efficient
when applied to two- or three-dimensional fluid dynamical problems. We
illustrate these ideas using the two-dimensional Burgers equation and the
three-dimensional Navier-Stokes equations
- …