Weak second order S-ROCK methods for Stratonovich stochastic differential equations

It is well known that the numerical solution of stiff stochastic ordinary differential equations leads to a step size reduction when explicit methods are used. This has led to a plethora of implicit or semi-implicit methods with a wide variety of stability properties. However, for stiff stochastic problems in which the eigenvalues of a drift term lie near the negative real axis, such as those arising from stochastic partial differential equations, explicit methods with extended stability regions can be very effective. In the present paper our aim is to derive explicit Runge–Kutta schemes for non-commutative Stratonovich stochastic differential equations, which are of weak order two and which have large stability regions. This will be achieved by the use of a technique in Chebyshev methods for ordinary differential equations.     

An adaptive discretization algorithm for the weak approximation of stochastic differential equations

Numerical methods with fixed step size have limitations if they are applied for example to stiff stochastic differential equations where the step size is forced to be very small. In this paper, an adaptive step size control algorithm for the weak approximation of stochastic differential equations is introduced. The proposed algorithm calculates an estimation of the local error in order to determine the optimal step size such that the local error is bounded by some given tolerances. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Weak convergence of approximate solutions of random equations

Approximations of random operator equations are considered where the stochastic inputs and the underlying deterministic equation are approximated simultaneously. The main convergence result asserts that, under reasonable and verifiable assumptions, a sequence of weak solutions of approximate random equations converges weakly to a weak solution of the original equation. It is shown that this theorem extends and unifies results already known. We apply our theory to approximations of random differential equations involving stochastic processes with discontinuous paths and to projection methods for nonlinear random Hammerstein integral equations in spaces of integrable functions.     

Weak convergence of finite element approximations of linear stochastic evolution equations with additive noise

A unified approach is given for the analysis of the weak error of spatially semidiscrete finite element methods for linear stochastic partial differential equations driven by additive noise. An error representation formula is found in an abstract setting based on the semigroup formulation of stochastic evolution equations. This is then applied to the stochastic heat, linearized Cahn-Hilliard, and wave equations. In all cases it is found that the rate of weak convergence is twice the rate of strong convergence, sometimes up to a logarithmic factor, under the same or, essentially the same, regularity requirements.     

Solving the Dirichlet problem for Navier–Stokes equations by probabilistic approach

We construct a number of layer methods for Navier-Stokes equations (NSEs) with no-slip boundary conditions. The methods are obtained using probabilistic representations of solutions to NSEs and exploiting ideas of the weak sense numerical integration of stochastic differential equations. Despite their probabilistic nature, the proposed methods are nevertheless deterministic.     

On the Equivalence of Solutions for a Class of Stochastic Evolution Equations in a Banach Space

We study a class of stochastic evolution equations in a Banach space E driven by cylindrical Wiener process. Three different analytical concepts of solutions: generalised strong, weak and mild are defined and the conditions under which they are equivalent are given. We apply this result to prove existence, uniqueness and continuity of weak solutions to stochastic delay evolution equations. We also consider two examples of these equations in non-reflexive Banach spaces: a stochastic transport equation with delay and a stochastic delay McKendrick equation.     

Rooted Tree Analysis for Order Conditions of Stochastic Runge-Kutta Methods for the Weak Approximation of Stochastic Differential Equations

Abstract

A general class of stochastic Runge-Kutta methods for the weak approximation of Itô and Stratonovich stochastic differential equations with a multi-dimensional Wiener process is introduced. Colored rooted trees are used to derive an expansion of the solution process and of the approximation process calculated with the stochastic Runge-Kutta method. A theorem on general order conditions for the coefficients and the random variables of the stochastic Runge-Kutta method is proved by rooted tree analysis. This theorem can be applied for the derivation of stochastic Runge-Kutta methods converging with an arbitrarily high order.     

Continuous weak approximation for stochastic differential equations

A convergence theorem for the continuous weak approximation of the solution of stochastic differential equations (SDEs) by general one-step methods is proved, which is an extension of a theorem due to Milstein. As an application, uniform second order conditions for a class of continuous stochastic Runge–Kutta methods containing the continuous extension of the second order stochastic Runge–Kutta scheme due to Platen are derived. Further, some coefficients for optimal continuous schemes applicable to Itô SDEs with respect to a multi–dimensional Wiener process are presented.     

New explicit stabilized stochastic Runge-Kutta methods with weak second order for stiff Itô stochastic differential equations

Numerical Algorithms - This paper introduces a new class of weak second-order explicit stabilized stochastic Runge-Kutta methods for stiff Itô stochastic differential equations. The...     

A step size control algorithm for the weak approximation of stochastic differential equations

A vriable step size control algorithm for the weak approximation of stochastic differential equations is introduced. The algorithm is based on embedded Runge–Kutta methods which yield two approximations of different orders with a negligible additional computational effort. The difference of these two approximations is used as an estimator for the local error of the less precise approximation. Some numerical results are presented to illustrate the effectiveness of the introduced step size control method.      

倒向随机方程期权定价模型的一类随机算法

期权定价问题可以转化为对倒向随机微分方程的求解,进而转化为对相应抛物型偏微分方程的求解.为了求解与倒向随机微分方程相应的二阶拟线性抛物型微分方程初值问题,引入一类新的随机算法-分层方法取代传统的确定性数值算法.这种数值方法理论上是通过弱显式欧拉法,离散其相应随机系统解的概率表示而得到.该随机算法的收敛性在文中得到证明,其稳定性是自然的.并构造了易于数值实现的基于插值的算法,实证研究说明这种算法能很好地提供期权定价模型的数值模拟.     

Diagonally drift-implicit Runge–Kutta methods of weak order one and two for Itô SDEs and stability analysis

The class of stochastic Runge–Kutta methods for stochastic differential equations due to Rößler is considered. Coefficient families of diagonally drift-implicit stochastic Runge–Kutta (DDISRK) methods of weak order one and two are calculated. Their asymptotic stability as well as mean-square stability (MS-stability) properties are studied for a linear stochastic test equation with multiplicative noise. The stability functions for the DDISRK methods are determined and their domains of stability are compared to the corresponding domain of stability of the considered test equation. Stability regions are presented for various coefficients of the families of DDISRK methods in order to determine step size restrictions such that the numerical approximation reproduces the characteristics of the solution process.     

Large deviations for stochastic PDE with Lévy noise

We prove a large deviation principle result for solutions of abstract stochastic evolution equations perturbed by small Lévy noise. We use general large deviations theorems of Varadhan and Bryc coupled with the techniques of Feng and Kurtz (2006) [15], viscosity solutions of integro-partial differential equations in Hilbert spaces, and deterministic optimal control methods. The Laplace limit is identified as a viscosity solution of a Hamilton-Jacobi-Bellman equation of an associated control problem. We also establish exponential moment estimates for solutions of stochastic evolution equations driven by Lévy noise. General results are applied to stochastic hyperbolic equations perturbed by subordinated Wiener process.     

Hilbert space-valued forward-backward stochastic differential equations with Poisson jumps and applications

In this paper, we study a class of Hilbert space-valued forward-backward stochastic differential equations (FBSDEs) with bounded random terminal times; more precisely, the FBSDEs are driven by a cylindrical Brownian motion on a separable Hilbert space and a Poisson random measure. In the case where the coefficients are continuous but not Lipschitz continuous, we prove the existence and uniqueness of adapted solutions to such FBSDEs under assumptions of weak monotonicity and linear growth on the coefficients. Existence is shown by applying a finite-dimensional approximation technique and the weak convergence theory. We also use these results to solve some special types of optimal stochastic control problems.     

Stochastic Runge-Kutta methods with deterministic high order for ordinary differential equations

We consider embedding deterministic Runge-Kutta methods with high order into weak order stochastic Runge-Kutta (SRK) methods for non-commutative stochastic differential equations (SDEs). As a result, we have obtained weak second order SRK methods which have good properties with respect to not only practical errors but also mean square stability. In our stability analysis, as well as a scalar test equation with complex-valued parameters, we have used a multi-dimensional non-commutative test SDE. The performance of our new schemes will be shown through comparisons with an efficient and optimal weak second order scheme proposed by Debrabant and Rößler (Appl. Numer. Math. 59:582–594, 2009).     

Dynamic programming in stochastic control of systems with delay

We consider optimal control problems for systems described by stochastic differential equations with delay (SDDE). We prove a version of Bellman's principle of optimality (the dynamic programming principle) for a general class of such problems. That the class in general means that both the dynamics and the cost depends on the past in a general way. As an application, we study systems where the value function depends on the past only through some weighted average. For such systems we obtain a Hamilton-Jacobi-Bellman partial differential equation that the value function must solve if it is smooth enough. The weak uniqueness of the SDDEs we consider is our main tool in proving the result. Notions of strong and weak uniqueness for SDDEs are introduced, and we prove that strong uniqueness implies weak uniqueness, just as for ordinary stochastic differential equations.     

具有跳跃的扩散过程的最优控制及相关的积分-微分型分布参数系统的最优控制问题

§1.引言在[1]、[2]及[3]中考虑了可以用偏微分方程方法处理的一类具有连续轨道的扩散过程的最优控制问题.近来[4]研究了具有跳跃的扩散过程的最优控制问题,证明了 reward函数满足 Bellman 方程.     

Second order Runge–Kutta methods for Stratonovich stochastic differential equations

The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly. AMS subject classification (2000)  65C30, 65L06, 60H35, 60H10     

Limit Theorem for Controlled Backward SDEs and Homogenization of Hamilton–Jacobi–Bellman Equations

We prove a convergence theorem for a family of value functions associated with stochastic control problems whose cost functions are defined by backward stochastic differential equations. The limit function is characterized as a viscosity solution to a fully nonlinear partial differential equation of second order. The key assumption we use in our approach is shown to be a necessary and sufficient assumption for the homogenizability of the control problem. The results generalize partially homogenization problems for Hamilton–Jacobi–Bellman equations treated recently by Alvarez and Bardi by viscosity solution methods. In contrast to their approach, we use mainly probabilistic arguments, and discuss a stochastic control interpretation for the limit equation.     

New efficient numerical procedures for solving stochastic variational problems with a priori maximum pointwise error estimates

In a previous paper we gave a new formulation and derived the Euler equations and other necessary conditions to solve strong, pathwise, stochastic variational problems with trajectories driven by Brownian motion. Thus, unlike current methods which minimize the control over deterministic functionals (the expected value), we find the control which gives the critical point solution of random functionals of a Brownian path and then, if we choose, find the expected value.This increase in information is balanced by the fact that our methods are anticipative while current methods are not. However, our methods are more directly connected to the theory and meaningful examples of deterministic variational theory and provide better means of solution for free and constrained problems. In addition, examples indicate that there are methods to obtain nonanticipative solutions from our equations although the anticipative optimal cost function has smaller expected value.In this paper we give new, efficient numerical methods to find the solution of these problems in the quadratic case. Of interest is that our numerical solution has a maximal, a priori, pointwise error of O(h3/2) where h is the node size. We believe our results are unique for any theory of stochastic control and that our methods of proof involve new and sophisticated ideas for strong solutions which extend previous deterministic results by the first author where the error was O(h²).We note that, although our solutions are given in terms of stochastic differential equations, we are not using the now standard numerical methods for stochastic differential equations. Instead we find an approximation to the critical point solution of the variational problem using relations derived from setting to zero the directional derivative of the cost functional in the direction of simple test functions.Our results are even more significant than they first appear because we can reformulate stochastic control problems or constrained calculus of variations problems in the unconstrained, stochastic calculus of variations formulation of this paper. This will allow us to find efficient and accurate numerical solutions for general constrained, stochastic optimization problems. This is not yet being done, even in the deterministic case, except by the first author.