2009
DOI: 10.1016/j.cam.2008.05.060
|View full text |Cite
|
Sign up to set email alerts
|

A random Euler scheme for Carathéodory differential equations

Abstract: a b s t r a c tWe study a random Euler scheme for the approximation of Carathéodory differential equations and give a precise error analysis. In particular, we show that under weak assumptions, this approximation scheme obtains the same rate of convergence as the classical Monte-Carlo method for integration problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(44 citation statements)
references
References 15 publications
0
44
0
Order By: Relevance
“…Let us stress, that the mapping f is not necessarily continuous with respect to the temporal variable t. In addition, the mappings L and K are not assumed to be bounded, in contrast to other results found in the literature [6,20,30,31]. Moreover, from (17) and (18) we directly deduce the linear growth condition |f (t, x)| ≤ K(t)(1 + |x|) (19) for almost all t ∈ [0, T ] and In the following proposition we collect a few properties of the solution u to (1).…”
Section: Numerical Approximation Of Carathéodory Odesmentioning
confidence: 94%
See 2 more Smart Citations
“…Let us stress, that the mapping f is not necessarily continuous with respect to the temporal variable t. In addition, the mappings L and K are not assumed to be bounded, in contrast to other results found in the literature [6,20,30,31]. Moreover, from (17) and (18) we directly deduce the linear growth condition |f (t, x)| ≤ K(t)(1 + |x|) (19) for almost all t ∈ [0, T ] and In the following proposition we collect a few properties of the solution u to (1).…”
Section: Numerical Approximation Of Carathéodory Odesmentioning
confidence: 94%
“…Compare also with [20,Theorem 2], if the coefficient function f is additionally assumed to be locally bounded. …”
Section: Numerical Approximation Of Carathéodory Odesmentioning
confidence: 99%
See 1 more Smart Citation
“…In [13] Jentzen and Neuenkirch analyzed a numerical scheme for RODEs that converges independent of ϑ with the order 1 2 to the exact solution of the RODE. This scheme is called random Euler scheme there and is given by…”
Section: A Random Euler Schemementioning
confidence: 99%
“…Regular finite difference schemes should be avoided because we cannot guarantee convergence of such methods in the case of a discontinuous right-hand side. There are many other ideas known starting from integral Euler-type methods (with practical usage limited to specific affine cases  see the discussion in [9]) up to random methods (see in particular [9,15,16]). We will suggest a method which does not entirely escape from the integration, but in many cases leads to classical nonlinear problems in R .…”
Section: Property 11 ([12 Theorem 212] [4])mentioning
confidence: 99%