Metraipolis › archive › dc_fe97eaf0975c
Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining — arXiv:2611.04001
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04001
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T19:00:05.536Z
- SHA-256 of the archived text
0b5b1ebef89485d1bcf8ad897996898c7fe574d99909d1d0c5641e77e1fab664- Stable URL of this page
https://metraipolis.com/documento/dc_fe97eaf0975c
How to cite
Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining — arXiv:2611.04001 — arXiv (en), https://arxiv.org/abs/2611.04001 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe97eaf0975c (Metraipolis archive dc_fe97eaf0975c, sha256 0b5b1ebef89485d1bcf8ad897996898c7fe574d99909d1d0c5641e77e1fab664)
BibTeX
@misc{dcfe97eaf0975c,
title = {Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining — arXiv:2611.04001},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04001},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe97eaf0975c; sha256 0b5b1ebef89485d1bcf8ad897996898c7fe574d99909d1d0c5641e77e1fab664},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04001. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Coarse finite-volume information does not automatically define an exact pathwise closure for the restricted evolution of a fine-grid realization. We study two one-step information boundaries that are distinct from recursive predictive memory. First, we show that parent averages together with complete initial parent-interface trace pairs are sufficient for one forward-Euler finite-volume transition with a deterministic two-state numerical flux, but they do not generally determine a completed second-order strong-stability-preserving Runge-Kutta, equivalently Heun, transition. An explicit scalar upwind collision shows that hidden interior data can affect later stage traces and hence the completed parent update, even when initial traces and parent averages agree. Second, we show that exact conservative one-step closure is not the same as entropy-accounting closure. A parent entropy balance obtained from a cellwise numerical entropy balance contains a subcell Jensen gap, a realized entropy-flux difference, and residual dissipation. For a declared Burgers-Rusanov conservative flux and a declared Rusanov-type numerical entropy flux, we construct a sign-indexed finite family in which all branches have identical parent averages, identical conservative interface registers, and identical next parent averages, while the entropy-interface register distinguishes every branch. Under the uniform branch law, the conservative channel leaves nonzero deterministic squared-error floors for both the raw entropy register and its cyclic divergence. The results give a concise finite-volume information-sufficiency test for multistage interface data and entropy-side accounting. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2611.04001 — 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-04T18:38:07.287Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).