2009
DOI: 10.1007/s10543-009-0211-6
|View full text |Cite
|
Sign up to set email alerts
|

Pathwise Taylor schemes for random ordinary differential equations

Abstract: Random ordinary differential equations (RODEs) are ordinary differential equations which contain a stochastic process in their vector fields. They can be analyzed pathwise using deterministic calculus, but since the driving stochastic process is usually only Hölder continuous in time, the vector field is not differentiable in the time variable. Traditional numerical schemes for ordinary differential equations thus do not achieve their usual order of convergence when applied to RODEs. Nevertheless, deterministi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
14
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…On the basis of Taylor expansion (11), the growth condition (4) and the assumptions A 1 , A 2 and A 3 , we conclude that J 1 (t) can be estimated in the following way,…”
Section: Resultsmentioning
confidence: 91%
See 1 more Smart Citation
“…On the basis of Taylor expansion (11), the growth condition (4) and the assumptions A 1 , A 2 and A 3 , we conclude that J 1 (t) can be estimated in the following way,…”
Section: Resultsmentioning
confidence: 91%
“…(1) and the approximate solution x n decreases when the degrees of Taylor expansions for f and g increase, indicates that it would be convenient to combine the presented analytic method with numerical approximations based on Ito-Taylor expansions of higher degrees, described, above all, by Kloeden and Platen [8,9]. Moreover, in order to derive numerical schemes of higher order, it seems to be reasonable to replace the solutions in approximate equations, that is, in Taylor polynomials, by lower order approximations, analogously to the recent papers [10,11] by Kloeden and Jentzen treating random ordinary differential equations.…”
mentioning
confidence: 80%
“…In this connection it is important to know that due to a lack of time differentiability of the noise process, this method is in general not attaining its usual order of convergence. Details on specific integration schemes for random differential equations can be looked up in the publications [19] and [30].…”
Section: Applicationmentioning
confidence: 99%
“…In particular high accuracy, computational efficiency, and stability of the numerical schemes, are very desirable properties. Taking all this into consideration, some numerical integrator have been proposed in literature e.g., [2], [6], [8], [3]. However, these methods or are of implicit nature (involving the numerical solution of a system of nonlinear algebraic equations at each integration step, that typically increase the computational effort of these numerical integrators) or are explicit integrators, having the appealing feature of retaining the standard order of convergence of the classical deterministic schemes, but at the expense of high computational cost and low stability.…”
Section: Introductionmentioning
confidence: 99%