Standard

The Monte Carlo Method for Solving Large Systems of Linear Ordinary Differential Equations. / Ermakov, S. M.; Smilovitskiy, M. G.

в: Vestnik St. Petersburg University: Mathematics, Том 54, № 1, 01.2021, стр. 28-38.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

APA

Vancouver

Author

Ermakov, S. M. ; Smilovitskiy, M. G. / The Monte Carlo Method for Solving Large Systems of Linear Ordinary Differential Equations. в: Vestnik St. Petersburg University: Mathematics. 2021 ; Том 54, № 1. стр. 28-38.

BibTeX

@article{5f7106266f694f388575bef3e02f0d5c,
title = "The Monte Carlo Method for Solving Large Systems of Linear Ordinary Differential Equations",
abstract = "Abstract: The Monte Carlo method to solve the Cauchy problem for large systems of linear differential equations is proposed in this paper. Firstly, a quick overview of previously obtained results from applying the approach towards the Fredholm-type integral equations is made. In the main part of the paper, the method is applied towards a linear ODE system that is transformed into an equivalent system of the Volterra-type integral equations, which makes it possible to remove the limitations due to the conditions of convergence of the majorant series. The following key theorems are stated. Theorem 1 provides the necessary compliance conditions that should be imposed upon the transition propability and initial distribution densities that initiate the corresponding Markov chain, for which equality between the mathematical expectation of the estimate and the functional of interest would hold. Theorem 2 formulates the equation that governs the estimate{\textquoteright}s variance. Theorem 3 states the Markov chain parameters that minimize the variance of the estimate of the functional. Proofs are given for all three theorems. In the practical part of this paper, the proposed method is used to solve a linear ODE system that describes a closed queueing system of ten conventional machines and seven conventional service persons. The solutions are obtained for systems with both constant and time-dependent matrices of coefficients, where the machine breakdown intensity is time dependent. In addition, the solutions obtained by the Monte Carlo and Runge–Kutta methods are compared. The results are presented in the corresponding tables.",
keywords = "integral equation, Monte Carlo method, ODE systems, optimal density, queueing problems, statistical modeling, unbiased estimate",
author = "Ermakov, {S. M.} and Smilovitskiy, {M. G.}",
note = "Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd.",
year = "2021",
month = jan,
doi = "10.1134/S1063454121010064",
language = "English",
volume = "54",
pages = "28--38",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "1",

}

RIS

TY - JOUR

T1 - The Monte Carlo Method for Solving Large Systems of Linear Ordinary Differential Equations

AU - Ermakov, S. M.

AU - Smilovitskiy, M. G.

N1 - Publisher Copyright: © 2021, Pleiades Publishing, Ltd.

PY - 2021/1

Y1 - 2021/1

N2 - Abstract: The Monte Carlo method to solve the Cauchy problem for large systems of linear differential equations is proposed in this paper. Firstly, a quick overview of previously obtained results from applying the approach towards the Fredholm-type integral equations is made. In the main part of the paper, the method is applied towards a linear ODE system that is transformed into an equivalent system of the Volterra-type integral equations, which makes it possible to remove the limitations due to the conditions of convergence of the majorant series. The following key theorems are stated. Theorem 1 provides the necessary compliance conditions that should be imposed upon the transition propability and initial distribution densities that initiate the corresponding Markov chain, for which equality between the mathematical expectation of the estimate and the functional of interest would hold. Theorem 2 formulates the equation that governs the estimate’s variance. Theorem 3 states the Markov chain parameters that minimize the variance of the estimate of the functional. Proofs are given for all three theorems. In the practical part of this paper, the proposed method is used to solve a linear ODE system that describes a closed queueing system of ten conventional machines and seven conventional service persons. The solutions are obtained for systems with both constant and time-dependent matrices of coefficients, where the machine breakdown intensity is time dependent. In addition, the solutions obtained by the Monte Carlo and Runge–Kutta methods are compared. The results are presented in the corresponding tables.

AB - Abstract: The Monte Carlo method to solve the Cauchy problem for large systems of linear differential equations is proposed in this paper. Firstly, a quick overview of previously obtained results from applying the approach towards the Fredholm-type integral equations is made. In the main part of the paper, the method is applied towards a linear ODE system that is transformed into an equivalent system of the Volterra-type integral equations, which makes it possible to remove the limitations due to the conditions of convergence of the majorant series. The following key theorems are stated. Theorem 1 provides the necessary compliance conditions that should be imposed upon the transition propability and initial distribution densities that initiate the corresponding Markov chain, for which equality between the mathematical expectation of the estimate and the functional of interest would hold. Theorem 2 formulates the equation that governs the estimate’s variance. Theorem 3 states the Markov chain parameters that minimize the variance of the estimate of the functional. Proofs are given for all three theorems. In the practical part of this paper, the proposed method is used to solve a linear ODE system that describes a closed queueing system of ten conventional machines and seven conventional service persons. The solutions are obtained for systems with both constant and time-dependent matrices of coefficients, where the machine breakdown intensity is time dependent. In addition, the solutions obtained by the Monte Carlo and Runge–Kutta methods are compared. The results are presented in the corresponding tables.

KW - integral equation

KW - Monte Carlo method

KW - ODE systems

KW - optimal density

KW - queueing problems

KW - statistical modeling

KW - unbiased estimate

UR - http://www.scopus.com/inward/record.url?scp=85102718409&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/8957feb1-f644-32b0-b7d8-9651224ded68/

U2 - 10.1134/S1063454121010064

DO - 10.1134/S1063454121010064

M3 - Article

AN - SCOPUS:85102718409

VL - 54

SP - 28

EP - 38

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 1

ER -

ID: 86605677