Poisson-Box Sampling algorithms for three-dimensional Markov binary mixtures

摘要

Highlights?We introduce a family of new algorithms to generalize the Chord Length Sampling method.?We test these Poisson-Box Sampling (PBS) methods against CLS and reference solutions.?We revisit the Adams, Larsen and Pomraning benchmark.?PBS is further extended so to take into account partial memory effects.AbstractParticle transport in Markov mixtures can be addressed by the so-called Chord Length Sampling (CLS) methods, a family of Monte Carlo algorithms taking into account the effects of stochastic media on particle propagation by generating on-the-fly the material interfaces crossed by the random walkers during their trajectories. Such methods enable a significant reduction of computational resources as opposed to reference solutions obtained by solving the Boltzmann equation for a large number of realizations of random media. CLS solutions, which neglect c