Return to search

Numerical methods for approximating solutions to rough differential equations

The main motivation behind writing this thesis was to construct numerical methods to approximate solutions to differential equations driven by rough paths, where the solution is considered in the rough path-sense. Rough paths of inhomogeneous degree of smoothness as driving noise are considered. We also aimed to find applications of these numerical methods to stochastic differential equations. After sketching the core ideas of the Rough Paths Theory in Chapter 1, the versions of the core theorems corresponding to the inhomogeneous degree of smoothness case are stated and proved in Chapter 2 along with some auxiliary claims on the continuity of the solution in a certain sense, including an RDE-version of Gronwall's lemma. In Chapter 3, numerical schemes for approximating solutions to differential equations driven by rough paths of inhomogeneous degree of smoothness are constructed. We start with setting up some principles of approximations. Then a general class of local approximations is introduced. This class is used to construct global approximations by pasting together the local ones. A general sufficient condition on the local approximations implying global convergence is given and proved. The next step is to construct particular local approximations in finite dimensions based on solutions to ordinary differential equations derived locally and satisfying the sufficient condition for global convergence. These local approximations require strong conditions on the one-form defining the rough differential equation. Finally, we show that when the local ODE-based schemes are applied in combination with rough polynomial approximations, the conditions on the one-form can be weakened. In Chapter 4, the results of Gyurko & Lyons (2010) on path-wise approximation of solutions to stochastic differential equations are recalled and extended to the truncated signature level of the solution. Furthermore, some practical considerations related to the implementation of high order schemes are described. The effectiveness of the derived schemes is demonstrated on numerical examples. In Chapter 5, the background theory of the Kusuoka-Lyons-Victoir (KLV) family of weak approximations is recalled and linked to the results of Chapter 4. We highlight how the different versions of the KLV family are related. Finally, a numerical evaluation of the autonomous ODE-based versions of the family is carried out, focusing on SDEs in dimensions up to 4, using cubature formulas of different degrees and several high order numerical ODE solvers. We demonstrate the effectiveness and the occasional non-effectiveness of the numerical approximations in cases when the KLV family is used in its original version and also when used in combination with partial sampling methods (Monte-Carlo, TBBA) and Romberg extrapolation.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:496902
Date January 2008
CreatorsGyurko, Lajos Gergely
ContributorsLyons, Terry
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttp://ora.ox.ac.uk/objects/uuid:d977be17-76c6-46d6-8691-6d3b7bd51f7a

Page generated in 0.0026 seconds