Photo from archive.org
By analogy with Kellogg’s method, a Monte Carlo algorithm well suited for parallelization was constructed for estimating probability moments of the leading eigenvalue of the particle transport equation with multiplication… Click to show full abstract
By analogy with Kellogg’s method, a Monte Carlo algorithm well suited for parallelization was constructed for estimating probability moments of the leading eigenvalue of the particle transport equation with multiplication in a random medium. For this purpose, a randomized homogenization method was developed by applying the theory of small perturbations and the diffusion approximation. Test computations were performed for a one-group spherically symmetric model system. They revealed that the results produced by two methods are in satisfactory agreement.
Journal Title: Doklady Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!