Metraipolis › archive › dc_7325e6dd32be
Fixed-grid schemes for fractional moving-boundary problems — arXiv:2611.04026
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04026
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:48:36.916Z
- SHA-256 of the archived text
f220dbf7e3cc400385e3127fa24abe877d9f9e0233296726d7a0924ec2277425- Stable URL of this page
https://metraipolis.com/documento/dc_7325e6dd32be
How to cite
Fixed-grid schemes for fractional moving-boundary problems — arXiv:2611.04026 — arXiv (en), https://arxiv.org/abs/2611.04026 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7325e6dd32be (Metraipolis archive dc_7325e6dd32be, sha256 f220dbf7e3cc400385e3127fa24abe877d9f9e0233296726d7a0924ec2277425)
BibTeX
@misc{dc7325e6dd32be,
title = {Fixed-grid schemes for fractional moving-boundary problems — arXiv:2611.04026},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04026},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7325e6dd32be; sha256 f220dbf7e3cc400385e3127fa24abe877d9f9e0233296726d7a0924ec2277425},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04026. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA) ; Materials Science (cond-mat.mtrl-sci); Mathematical Physics (math-ph). Pagina del lavoro: https://arxiv.org/abs/2611.04026 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:32:17.121Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).