7 results
Search Results
Now showing 1 - 7 of 7
- ItemRunge--Kutta methods for rough differential equations(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Redmann, Martin; Riedel, SebastianWe study Runge-Kutta methods for rough differential equations which can be used to calculate solutions to stochastic differential equations driven by processes that are rougher than a Brownian motion. We use a Taylor series representation (B-series) for both the numerical scheme and the solution of the rough differential equation in order to determine conditions that guarantee the desired order of the local error for the underlying Runge-Kutta method. Subsequently, we prove the order of the global error given the local rate. In addition, we simplify the numerical approximation by introducing a Runge-Kutta scheme that is based on the increments of the driver of the rough differential equation. This simplified method can be easily implemented and is computational cheap since it is derivative-free. We provide a full characterization of this implementable Runge-Kutta method meaning that we provide necessary and sufficient algebraic conditions for an optimal order of convergence in case that the driver, e.g., is a fractional Brownian motion with Hurst index 1/4 < H ≤ 1/2. We conclude this paper by conducting numerical experiments verifying the theoretical rate of convergence.
- ItemThe geometry of controlled rough paths(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Varzaneh, Mazyar Ghani; Riedel, Sebastian; Schmeding, Alexander; Tapia, NikolasWe prove that the spaces of controlled (branched) rough paths of arbitrary order form a continuous field of Banach spaces. This structure has many similarities to an (infinite-dimensional) vector bundle and allows to define a topology on the total space, the collection of all controlled path spaces, which turns out to be Polish in the geometric case. The construction is intrinsic and based on a new approximation result for controlled rough paths. This framework turns well-known maps such as the rough integration map and the Itô-Lyons map into continuous (structure preserving) mappings. Moreover, it is compatible with previous constructions of interest in the stability theory for rough integration.
- ItemFrom rough path estimates to multilevel Monte Carlo(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2013) Bayer, Christian; Friz, Peter K.; Riedel, Sebastian; Schoenmakers, John G.M.Discrete approximations to solutions of stochastic differential equations are well-known to converge with strong rate 1=2. Such rates have played a key-role in Giles multilevel Monte Carlo method [Giles, Oper. Res. 2008] which gives a substantial reduction of the computational effort necessary for the evaluation of diffusion functionals. In the present article similar results are established for large classes of rough differential equations driven by Gaussian processes (including fractional Brownian motion with H > 1=4 as special case).
- ItemSolving linear parabolic rough partial differential equations(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2018) Bayer, Christian; Belomestny, Denis; Redmann, Martin; Riedel, Sebastian; Schoenmakers, JohnWe study linear rough partial differential equations in the setting of [Friz and Hairer, Springer, 2014, Chapter 12]. More precisely, we consider a linear parabolic partial differential equation driven by a deterministic rough path W of Hölder regularity with 1=3 < 1=2. Based on a stochastic representation of the solution of the rough partial differential equation, we propose a regression Monte Carlo algorithm for spatio-temporal approximation of the solution. We provide a full convergence analysis of the proposed approximation method which essentially relies on the new bounds for the higher order derivatives of the solution in space. Finally, a comprehensive simulation study showing the applicability of the proposed algorithm is presented.
- ItemSemi-implicit Taylor schemes for stiff rough differential equations(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Riedel, SebastianWe study a class of semi-implicit Taylor-type numerical methods that are easy to implement and designed to solve multidimensional stochastic differential equations driven by a general rough noise, e.g. a fractional Brownian motion. In the multiplicative noise case, the equation is understood as a rough differential equation in the sense of T. Lyons. We focus on equations for which the drift coefficient may be unbounded and satisfies a one-sided Lipschitz condition only. We prove well-posedness of the methods, provide a full analysis, and deduce their convergence rate. Numerical experiments show that our schemes are particularly useful in the case of stiff rough stochastic differential equations driven by a fractional Brownian motion.
- ItemA dynamical theory for singular stochastic delay differential equations II: Nonlinear equations and invariant manifolds(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Ghani Varzaneh, Mazyar; Riedel, SebastianBuilding on results obtained in [GVRS], we prove Local Stable and Unstable Manifold Theorems for nonlinear, singular stochastic delay differential equations. The main tools are rough paths theory and a semi-invertible Multiplicative Ergodic Theorem for cocycles acting on measurable fields of Banach spaces obtained in [GVR].
- ItemOptimal stopping with signatures(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Bayer, Christian; Hager, Paul; Riedel, Sebastian; Schoenmakers, John G. M.We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process. We consider classic and randomized stopping times represented by linear functionals of the associated rough path signature, and prove that maximizing over the class of signature stopping times, in fact, solves the original optimal stopping problem. Using the algebraic properties of the signature, we can then recast the problem as a (deterministic) optimization problem depending only on the (truncated) expected signature. The only assumption on the process is that it is a continuous (geometric) random rough path. Hence, the theory encompasses processes such as fractional Brownian motion which fail to be either semi-martingales or Markov processes.