Standard

Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer. / Mikhailov, G. A.; Lotova, G. Z.; Medvedev, I. N.

In: Numerical Analysis and Applications, Vol. 17, No. 2, 06.2024, p. 152-168.

Research output: Contribution to journal › Article › peer-review

Harvard

Mikhailov, GA, Lotova, GZ & Medvedev, IN 2024, 'Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer', Numerical Analysis and Applications, vol. 17, no. 2, pp. 152-168. https://doi.org/10.1134/S1995423924020058

APA

Mikhailov, G. A., Lotova, G. Z., & Medvedev, I. N. (2024). Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer. Numerical Analysis and Applications, 17(2), 152-168. https://doi.org/10.1134/S1995423924020058

Vancouver

Mikhailov GA, Lotova GZ, Medvedev IN. Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer. Numerical Analysis and Applications. 2024 Jun;17(2):152-168. doi: 10.1134/S1995423924020058

Author

Mikhailov, G. A. ; Lotova, G. Z. ; Medvedev, I. N. / Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer. In: Numerical Analysis and Applications. 2024 ; Vol. 17, No. 2. pp. 152-168.

BibTeX

@article{56a487c434304d02970e7c35847934e3,
title = "Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer",
abstract = "Abstract: The paper presents efficiently realized approximations of random functions, which have been developed by the authors and are numerically simulated for study of stochastic processes of particle transfer, including the problems of process criticality fluctuations in random media with multiplication. Efficient correlation-randomized algorithms are constructed for approximating an ensemble of particle trajectories using a correlation function or only a correlation scale of medium. A simple grid model of an isotropic random field is formulated, which reproduces a given average correlation length. This ensures high accuracy in solving stochastic transfer problems for a small correlation scale. The algorithms are tested by solving a test problem of photon transfer and a problem of estimating the overexponential average particle flux in a random medium with multiplication.",
keywords = "Voronoi tessellation, computation cost, correlation-randomized algorithms, estimation error, grid approximation, maximum cross-section method (Woodcock tracking), numerical statistical modeling, overexponential asymptotics, particle flow, random medium",
author = "Mikhailov, {G. A.} and Lotova, {G. Z.} and Medvedev, {I. N.}",
year = "2024",
month = jun,
doi = "10.1134/S1995423924020058",
language = "English",
volume = "17",
pages = "152--168",
journal = "Numerical Analysis and Applications",
issn = "1995-4239",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "2",

}

RIS

TY - JOUR

T1 - Efficiently Realized Approximate Models of Random Functions in Stochastic Problems of the Theory of Particle Transfer

AU - Mikhailov, G. A.

AU - Lotova, G. Z.

AU - Medvedev, I. N.

PY - 2024/6

Y1 - 2024/6

N2 - Abstract: The paper presents efficiently realized approximations of random functions, which have been developed by the authors and are numerically simulated for study of stochastic processes of particle transfer, including the problems of process criticality fluctuations in random media with multiplication. Efficient correlation-randomized algorithms are constructed for approximating an ensemble of particle trajectories using a correlation function or only a correlation scale of medium. A simple grid model of an isotropic random field is formulated, which reproduces a given average correlation length. This ensures high accuracy in solving stochastic transfer problems for a small correlation scale. The algorithms are tested by solving a test problem of photon transfer and a problem of estimating the overexponential average particle flux in a random medium with multiplication.

AB - Abstract: The paper presents efficiently realized approximations of random functions, which have been developed by the authors and are numerically simulated for study of stochastic processes of particle transfer, including the problems of process criticality fluctuations in random media with multiplication. Efficient correlation-randomized algorithms are constructed for approximating an ensemble of particle trajectories using a correlation function or only a correlation scale of medium. A simple grid model of an isotropic random field is formulated, which reproduces a given average correlation length. This ensures high accuracy in solving stochastic transfer problems for a small correlation scale. The algorithms are tested by solving a test problem of photon transfer and a problem of estimating the overexponential average particle flux in a random medium with multiplication.

KW - Voronoi tessellation

KW - computation cost

KW - correlation-randomized algorithms

KW - estimation error

KW - grid approximation

KW - maximum cross-section method (Woodcock tracking)

KW - numerical statistical modeling

KW - overexponential asymptotics

KW - particle flow

KW - random medium

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85195108691&origin=inward&txGid=9af930f8ccdf57b4ad4c4f5a697e1306

UR - https://www.mendeley.com/catalogue/a6515936-32e7-3b8e-82dd-4cd8bd2f510f/

U2 - 10.1134/S1995423924020058

DO - 10.1134/S1995423924020058

M3 - Article

VL - 17

SP - 152

EP - 168

JO - Numerical Analysis and Applications

JF - Numerical Analysis and Applications

SN - 1995-4239

IS - 2

ER -

ID: 61117753