Processing math: 100%
Home Quasi-Monte Carlo simulation of differential equations
Article
Licensed
Unlicensed Requires Authentication

Quasi-Monte Carlo simulation of differential equations

  • Aïcha Chouraqui , Christian Lécot EMAIL logo and Bachir Djebbar
Published/Copyright: September 21, 2017

Abstract

We are interested in the numerical solution of the ordinary differential equation y(t)=f(t,y(t)) when f is smooth in y but lacks regularity in t. We describe a family of methods akin to the Runge–Kutta family. It involves Monte Carlo simulation of integrals. We focus on third-order schemes which use random samples in dimension three. We give error bounds in terms of the step size and the discrepancy of the set used for the Monte Carlo approximations. We solve a model problem in which f undergoes rapid time variations. It is shown for this example that, by using a quasi-random point set in place of pseudo-random samples, we are able to obtain reduced errors.

MSC 2010: 11K45; 65C05; 65L06

References

[1] J. C. Butcher, The Numerical Analysis of Ordinary Differential Equations, J. Wiley & Sons, Chichester, 1987. Search in Google Scholar

[2] R. Cools and D. Nuyens, Monte Carlo and Quasi-Monte Carlo Methods 2014, Springer Proc. Math. Stat. 163, Springer, Cham, 2016. 10.1007/978-3-319-33507-0Search in Google Scholar

[3] I. Coulibaly and C. Lécot, A quasi-randomized Runge–Kutta method, Math. Comp. 68 (1999), no. 226, 651–659. 10.1090/S0025-5718-99-01056-XSearch in Google Scholar

[4] J. Dick, F. Y. Kuo, G. W. Peters and I. H. Sloan, Monte Carlo and Quasi-Monte Carlo Methods 2012, Springer Proc. Math. Stat. 65, Springer, Heidelberg, 2013. 10.1007/978-3-642-41095-6Search in Google Scholar

[5] E. Hairer, S. P. Nø rsett and G. Wanner, Solving Ordinary Differential Equations. I: Nonstiff Problems, Springer Ser. Comput. Math. 8, Springer, Berlin, 1987. 10.1007/978-3-662-12607-3Search in Google Scholar

[6] L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences, Wiley-Interscience, New York, 1974. Search in Google Scholar

[7] C. Lécot, Quasi-randomized numerical methods for systems with coefficients of bounded variation, Math. Comput. Simulation 55 (2001), no. 1–3, 113–121. 10.1016/S0378-4754(00)00251-2Search in Google Scholar

[8] H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conf. Ser. in Appl. Math. 63, SIAM, Philadelphia, 1992. 10.1137/1.9781611970081Search in Google Scholar

[9] L. Plaskota and H. Woźniakowski, Monte Carlo and Quasi-Monte Carlo Methods 2010, Springer Proc. Math. Stat. 23, Springer, Heidelberg, 2012. 10.1007/978-3-642-27440-4Search in Google Scholar

[10] K. F. Roth, On irregularities of distribution, Mathematika 1 (1954), 73–79. 10.1112/S0025579300000541Search in Google Scholar

[11] G. Stengle, Numerical methods for systems with measurable coefficients, Appl. Math. Lett. 3 (1990), no. 4, 25–29. 10.1016/0893-9659(90)90040-ISearch in Google Scholar

[12] G. Stengle, Error analysis of a randomized numerical method, Numer. Math. 70 (1995), no. 1, 119–128. 10.1007/s002110050113Search in Google Scholar

Received: 2017-4-13
Accepted: 2017-8-21
Published Online: 2017-9-21
Published in Print: 2017-12-1

© 2017 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 3.6.2025 from https://www.degruyterbrill.com/document/doi/10.1515/mcma-2017-0114/html
Scroll to top button