Papers › Global random walk solvers for reactive transport and biodegradation processes in...
Global random walk solvers for reactive transport and biodegradation processes in heterogeneous porous media
Nicolae Suciu, Florin A. Radu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Flow and multicomponent reactive transport in saturated/unsaturated porous media are modeled by ensembles of computational particles moving on regular lattices according to specific random walk rules. The occupation number of the lattice sites is updated with a global random walk (GRW) procedure which spreads the particles from a lattice site with computational costs comparable to those for a single random walk step in sequential procedures. To cope with the nonlinearity and the degeneracy of the Richards equation the GRW flow solver uses linearization techniques similar to the L-scheme developed in finite element/volume approaches. Numerical schemes for reactive transport, coupled with the flow solver via numerical solutions for saturation and water flux, are implemented in splitting procedures. Diffusion-advection steps are solved by GRW algorithms using either biased or unbiased random walk probabilities. Since the number of particles in GRW simulations can be as large as the number of molecules involved in chemical reactions, one avoids the cumbersome problem of rescaling particle densities to approximate concentrations. Reaction steps are therefore formulated in terms of concentrations, as in deterministic approaches. The numerical convergence of the new schemes is demonstrated by comparisons with manufactured analytical solutions. Coupled flow and reactive transport problems of contaminant biodegradation described by the Monod model are further solved and the influence of flow nonlinearity/degeneracy and of the spatial heterogeneity of the medium is investigated numerically.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections