Global random walk for one-dimensional one-phase Stefan-type moving-boundary problems: simulation resultsShow others and affiliations
2025 (English)In: Computational and Applied Mathematics, ISSN 2238-3603, E-ISSN 1807-0302, Vol. 44, no 7, article id 377
Article in journal (Refereed) Published
Abstract [en]
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.
Place, publisher, year, edition, pages
Springer, 2025. Vol. 44, no 7, article id 377
Keywords [en]
Global random walk approximation, Stefan-type moving-boundary problems, Finite element approximation, Order of convergence, Diffusion in rubber
National Category
Mathematical Analysis Computational Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:oru:diva-122583DOI: 10.1007/s40314-025-03334-4ISI: 001536229300003Scopus ID: 2-s2.0-105011715436OAI: oai:DiVA.org:oru-122583DiVA, id: diva2:1986061
Funder
Karlstad UniversitySwedish Research Council, 2018-03648Knowledge Foundation, 2019-0213; 2020-0152; 2023-0010.
Note
The work of S.N. and A.M. is partially funded by the Swedish Research Council’s project "Homogenization and dimension reduction of thin heterogeneous layers" with grant nr. VR 2018-03648. A.M. acknowledges also support from the Knowledge Foundation for the grants KK 2019-0213, KK 2020-0152, and KK 2023-0010.
2025-07-292025-07-292026-01-23Bibliographically approved