Metraipolis › archive › dc_80ff840b022e
Neural Network-Assisted Refinement of Traditional Schemes for One-Dimensional Scalar Conservation Laws — arXiv:2609.32887
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32887
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T22:39:50.284Z
- SHA-256 of the archived text
e2a40826cf35cdde364a916b409b8977a8676f1155d4e1950b38dbb0d9754bb3- Stable URL of this page
https://metraipolis.com/documento/dc_80ff840b022e
How to cite
Neural Network-Assisted Refinement of Traditional Schemes for One-Dimensional Scalar Conservation Laws — arXiv:2609.32887 — arXiv (en), https://arxiv.org/abs/2609.32887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_80ff840b022e (Metraipolis archive dc_80ff840b022e, sha256 e2a40826cf35cdde364a916b409b8977a8676f1155d4e1950b38dbb0d9754bb3)
BibTeX
@misc{dc80ff840b022e,
title = {Neural Network-Assisted Refinement of Traditional Schemes for One-Dimensional Scalar Conservation Laws — arXiv:2609.32887},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32887},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_80ff840b022e; sha256 e2a40826cf35cdde364a916b409b8977a8676f1155d4e1950b38dbb0d9754bb3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32887. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A clear link is established between conventional numerical methods and neural network approximations for solving one-dimensional scalar conservation laws. The focus is on the construction of an appropriate flux term in the case of convex flux functions for improving the classical schemes. The first neural network developed here is able to rediscover Godunov's method, while the second one emulates the behavior of a second-order slope-limiter function. In this way, by merging them, second-order reconstruction-based schemes can be developed. The networks presented here employ a minimal number of parameters, significantly reducing the complexity compared to previous approaches. These networks can also be linked consecutively to get a deep one corresponding to multiple time steps. Training them with an appropriate loss leads to stable schemes, improving even the classical methods without increasing their complexity. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG). Categorie arXiv: Numerical Analysis (math.NA) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.32887 — 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-10-07T22:14:28.671Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).