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

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 cho...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational mathematics and mathematical physics 2024-02, Vol.64 (2), p.314-325
Hauptverfasser: Mikhailov, G. A., Medvedev, I. N.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0965-5425
1555-6662
DOI:10.1134/S0965542524020088