Quasi-randomized numerical methods for systems with coefficients of bounded variation (Q5938369): Difference between revisions
From MaRDI portal
Revision as of 18:32, 3 June 2024
scientific article; zbMATH DE number 1621875
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasi-randomized numerical methods for systems with coefficients of bounded variation |
scientific article; zbMATH DE number 1621875 |
Statements
Quasi-randomized numerical methods for systems with coefficients of bounded variation (English)
0 references
6 September 2001
0 references
This paper is concerned with the numerical solution of initial value problems for systems of first order differential equations \( y' = f (t,y)\) where \(f \) is smooth with respect to \( y \) but of bounded variation in \(t\). The methods under consideration are formally similar to one- and two stage Runge-Kutta methods, however the discretization with respect to the variable \(t\) is carried out with Monte Carlo simulation. The author proposes first and second order methods that consider quasi random times for the simulation. It is proved that, in spite of the random approximation in \(t\), error bounds in powers of the size of the step can be derived. Finally some numerical experiments with the linear non homogeneous test equation \( y' = y + \mu \sin ( \cos ( \lambda t))\) for several values of parameters \( \mu \) and \( \lambda \) are presented to show that a quasi random choice is preferred to the pseudo-random option in order to get smaller errors.
0 references
initial value problems
0 references
Monte Carlo simulation
0 references
randomized Runge-Kutta methods
0 references
systems
0 references
error bounds
0 references
numerical experiment
0 references