New Computer Efficient Approximations of Random Functions for Solving Stochastic Transport Problems

Standard

New Computer Efficient Approximations of Random Functions for Solving Stochastic Transport Problems. / Mikhailov, G. A.; Medvedev, I. N.

в: Computational Mathematics and Mathematical Physics, Том 64, № 2, 02.2024, стр. 314-325.

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

BibTeX

@article{884b2a5e04f84fcd9735d9044fa8e232,

title = "New Computer Efficient Approximations of Random Functions for Solving Stochastic Transport Problems",

abstract = "A new grid approximation of a homogeneous isotropic random field with a given average correlation length is developed. The approximation is constructed by partitioning the coordinate space into an ensemble of cubes whose size reproduces the average correlation length in the case of a field value chosen independently from a given one-dimensional distribution in each partition element. The correlative randomized algorithm recently proposed by the authors for modeling particle transport through a random medium is formulated. The accuracy and computational cost of corresponding Monte Carlo algorithms intended to compute gamma radiation transfer through a random medium of Voronoi diagram type are compared. To test the hypothesis that the one-dimensional distribution and the correlation length of the optical density of the medium have a large effect on radiation transfer, additional computations are performed for a random Poisson {"}field of air balls{"} in water. The grid approximation is generalized to anisotropic random fields.",

keywords = "computational cost of algorithm, correlation length, correlative randomized algorithms, gamma radiation transfer, grid approximation, majorant cross section method, stochastic medium",

author = "Mikhailov, {G. A.} and Medvedev, {I. N.}",

note = "This work was carried out under the state project of ICMMG SB RAS no. 0251-2022-0002",

year = "2024",

month = feb,

doi = "10.1134/S0965542524020088",

language = "English",

volume = "64",

pages = "314--325",

journal = "Computational Mathematics and Mathematical Physics",

issn = "0965-5425",

publisher = "PLEIADES PUBLISHING INC",

number = "2",

}

RIS

TY - JOUR

T1 - New Computer Efficient Approximations of Random Functions for Solving Stochastic Transport Problems

AU - Mikhailov, G. A.

AU - Medvedev, I. N.

N1 - This work was carried out under the state project of ICMMG SB RAS no. 0251-2022-0002

PY - 2024/2

Y1 - 2024/2

N2 - A new grid approximation of a homogeneous isotropic random field with a given average correlation length is developed. The approximation is constructed by partitioning the coordinate space into an ensemble of cubes whose size reproduces the average correlation length in the case of a field value chosen independently from a given one-dimensional distribution in each partition element. The correlative randomized algorithm recently proposed by the authors for modeling particle transport through a random medium is formulated. The accuracy and computational cost of corresponding Monte Carlo algorithms intended to compute gamma radiation transfer through a random medium of Voronoi diagram type are compared. To test the hypothesis that the one-dimensional distribution and the correlation length of the optical density of the medium have a large effect on radiation transfer, additional computations are performed for a random Poisson "field of air balls" in water. The grid approximation is generalized to anisotropic random fields.

AB - A new grid approximation of a homogeneous isotropic random field with a given average correlation length is developed. The approximation is constructed by partitioning the coordinate space into an ensemble of cubes whose size reproduces the average correlation length in the case of a field value chosen independently from a given one-dimensional distribution in each partition element. The correlative randomized algorithm recently proposed by the authors for modeling particle transport through a random medium is formulated. The accuracy and computational cost of corresponding Monte Carlo algorithms intended to compute gamma radiation transfer through a random medium of Voronoi diagram type are compared. To test the hypothesis that the one-dimensional distribution and the correlation length of the optical density of the medium have a large effect on radiation transfer, additional computations are performed for a random Poisson "field of air balls" in water. The grid approximation is generalized to anisotropic random fields.

KW - computational cost of algorithm

KW - correlation length

KW - correlative randomized algorithms

KW - gamma radiation transfer

KW - grid approximation

KW - majorant cross section method

KW - stochastic medium

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

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:001195395200007

UR - https://www.mendeley.com/catalogue/5d4b56b8-c6eb-3bb4-a33a-2575d8668eea/

U2 - 10.1134/S0965542524020088

DO - 10.1134/S0965542524020088

M3 - Article

VL - 64

SP - 314

EP - 325

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 2

ER -

ID: 61162146