Papers › Global random walk for one-dimensional one-phase Stefan-type moving-boundary problems:...
Global random walk for one-dimensional one-phase Stefan-type moving-boundary problems: Simulation results
Nicolae Suciu, Surendra Nepal, Yosief Wondmagegne, Magnus Ögren, Adrian Muntean
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.
This work presents global random walk approximations of solutions to one-dimensional Stefan-type moving-boundary problems. We are particularly interested in the case when the moving boundary is driven by an explicit representation of its speed. This situation is usually referred to in the literature as moving-boundary problem with kinetic condition. As a direct application, we propose a numerical scheme to forecast the penetration of small diffusants into a rubber-based material. To check the quality of our results, we compare the numerical results obtained by global random walks either using the analytical solution to selected benchmark cases or relying on finite element approximations with a priori known convergence rates. It turns out that the global random walk concept can be used to produce good quality approximations of the weak solutions to the target class of problems.
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