Fixed-grid schemes for fractional moving-boundary problems
Abstract
The Landau transformation xi = x/s(t) is the usual way to hold a moving boundary in place. It fails for fractional time derivatives because they have no chain rule: the transformed operator gains a nonlocal integral with a closed form only for self-similar fronts. We develop a sharp-interface finite-difference scheme for the conservation-consistent memory-flux fractional Stefan problem on a fixed grid, storing the memory limit h(x) = s^-1(x) as the time each node melts. The front is advanced using an integrated energy balance, with the singular source timed to the sub-step crossing instant. Against a known self-similar solution, the front constant is accurate to 0.02 to 0.11%, whereas competing formulations differ by 17 to 27% at alpha = 0.6. A remaining positivity violation follows from dt/t0 ~ s0^(1 - 2/alpha) and disappears on a front-locked time grid. We also derive two exact solutions with non-power-law fronts: a source-dominated solution and a Mittag-Leffler traveling wave, and verify the scheme against both. Neural-network solvers for moving boundaries are often trained in normalized coordinates; for alpha < 1, this silently changes the problem, while the change vanishes at alpha = 1, where checks are commonly performed. In the classical limit, our scheme is more accurate in 12 ms than a reimplemented moving-boundary network in 177 s.
Related
- A 2+1-dimensional extended Dym equation: moving boundary problems solvable via Painlevé II symmetry reduction
- An Extended 2+1-Dimensional Gardner Equation: On Moving Boundary Problems Solvable via Ermakov-Painlevé II Symmetry Reduction
- A novel extension of the canonical 2+1-dimensional Dym equation. Moving boundary problems solvable via Painleve' II Reduction
- Searching Schemes With p-Adic Neumann Boundary Value Problems
- Editorial for the Special Issue of Fractal and Fractional “Advances in Fractional Initial and Boundary Value Problems”
BibTeX
@misc{feugmo2026fixedgrid,
title = {{Fixed-grid schemes for fractional moving-boundary problems}},
author = {Conrard Giresse Tetsassi Feugmo},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04026},
eprint = {2611.04026},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04026},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Fixed-grid schemes for fractional moving-boundary problems
AU - Conrard Giresse Tetsassi Feugmo
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.04026
UR - https://arxiv.org/abs/2611.04026
AB - The Landau transformation xi = x/s(t) is the usual way to hold a moving boundary in place. It fails for fractional time derivatives because they have no chain rule: the transformed operator gains a nonlocal integral with a closed form only for self-similar fronts. We develop a sharp-interface finite-difference scheme for the conservation-consistent memory-flux fractional Stefan problem on a fixed grid, storing the memory limit h(x) = s^-1(x) as the time each node melts. The front is advanced using an integrated energy balance, with the singular source timed to the sub-step crossing instant. Against a known self-similar solution, the front constant is accurate to 0.02 to 0.11%, whereas competing formulations differ by 17 to 27% at alpha = 0.6. A remaining positivity violation follows from dt/t0 ~ s0^(1 - 2/alpha) and disappears on a front-locked time grid. We also derive two exact solutions with non-power-law fronts: a source-dominated solution and a Mittag-Leffler traveling wave, and verify the scheme against both. Neural-network solvers for moving boundaries are often trained in normalized coordinates; for alpha < 1, this silently changes the problem, while the change vanishes at alpha = 1, where checks are commonly performed. In the classical limit, our scheme is more accurate in 12 ms than a reimplemented moving-boundary network in 177 s.
ER -