On the randomized solution of initial value problems (Q544122)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the randomized solution of initial value problems |
scientific article |
Statements
On the randomized solution of initial value problems (English)
0 references
14 June 2011
0 references
The paper focuses on the numerical solution of initial value problems for systems of ordinary differential equations: \[ \begin{cases} y'(x)=f(x,y(x)), &x\in[a,b],\\ y(a)=y_0,\end{cases} \] where \(y_0\in{\mathbb R}^d,\) \(-\infty<a<b<\infty,\) \(f:[a,b]\times{\mathbb R}^d\rightarrow{\mathbb R}^d,\) presenting an order optimal randomized algorithm for the class of \(\gamma\)-smooth functions that uses only values of \(f\) (\(\gamma=1+\rho:\) the \(r\)-th derivatives of \(f\) satisfy a \(\rho\)-Hölder condition). The first part is an introduction in nature. In the second part the author presents the basic notations, defines the IBC framework and introduces some necessary definitions. The third part defines the conditions for the family of deterministic algorithms and the randomized algorithm itself. The fourth part is dedicated to the analysis of the algorithm, proving the optimal order of algorithm for admissible information in the deterministic and in the randomized case. The last section presents the numerical results obtained by performing three tests, by comparison with a 3-stage Runge-Kutta method and Euler method, respectively.
0 references
initial value problem
0 references
comparison of methods
0 references
Monte-Carlo algorithm
0 references
complexity
0 references
systems
0 references
randomized algorithm
0 references
numerical results
0 references
Runge-Kutta method
0 references
Euler method
0 references
0 references