2009
DOI: 10.1007/s00780-009-0101-4
|View full text |Cite
|
Sign up to set email alerts
|

A new higher-order weak approximation scheme for stochastic differential equations and the Runge–Kutta method

Abstract: The authors report on the construction of a new algorithm for the weak approximation of stochastic differential equations. In this algorithm, an ODE-valued random variable whose average approximates the solution of the given stochastic differential equation is constructed by using the notion of free Lie algebras. It is proved that the classical Runge-Kutta method for ODEs is directly applicable to the ODE drawn from the random variable. In a numerical experiment, this is applied to the problem of pricing Asian… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
49
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(49 citation statements)
references
References 33 publications
0
49
0
Order By: Relevance
“…We remark that it is necessary to solve the ordinary differential equation by a certain order to realize higher order discretization of the SDE, for more details, see Theorem 1.3 of [14]. Here we need to solve the ordinary differential equation by order 7.…”
Section: Implementation Of the New Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…We remark that it is necessary to solve the ordinary differential equation by a certain order to realize higher order discretization of the SDE, for more details, see Theorem 1.3 of [14]. Here we need to solve the ordinary differential equation by order 7.…”
Section: Implementation Of the New Methodsmentioning
confidence: 99%
“…Here we present numerical results obtained by applying 7th-order Runge-Kutta method. For the implementation of 7th-order Runge-Kutta method, see the appendix of [14]. [8,10], in order to obtain the order 3 discretization method by Q (7,2) (s) , we should take the partitions 0 = t 0 < t 1 · · · < t n = T as follows :…”
Section: Implementation Of the New Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…An alternative approach can be found in Kusuoka [21,22]. Its implementation as a splitting method is given in Ninomiya and Victoir [26], see also Alfonsi [1], Ninomiya and Ninomiya [25], and Tanaka and Kohatsu-Higa [33]. Our strategy is as follows.…”
Section: Stability Of Cubature Schemesmentioning
confidence: 99%
“…More recently, many discretization schemes of higher weak convergence order have appeared in the literature. Among others, we cite the work of Kusuoka [2001Kusuoka [ , 2004, the Ninomiya and Victoir [2008] scheme which we will use hereafter, the Ninomiya and Ninomiya [2009] scheme and the scheme based on cubature on Wiener spaces of Lyons and Victoir [2004]. Concerning strong approximation, the Milstein scheme has order one of strong convergence.…”
Section: Introductionmentioning
confidence: 99%