Metraipolis › archive › dc_279ddefd7134
A Data-Driven Computational Framework for Incompressible Flow in Hydraulic Networks — arXiv:2608.21575
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21575
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:27:27.105Z
- SHA-256 of the archived text
38ac8a3da2709dffac0fc0fbe636739d82b444248de931ee32248d17c9194c3e- Stable URL of this page
https://metraipolis.com/documento/dc_279ddefd7134
How to cite
A Data-Driven Computational Framework for Incompressible Flow in Hydraulic Networks — arXiv:2608.21575 — arXiv (en), https://arxiv.org/abs/2608.21575 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_279ddefd7134 (Metraipolis archive dc_279ddefd7134, sha256 38ac8a3da2709dffac0fc0fbe636739d82b444248de931ee32248d17c9194c3e)
BibTeX
@misc{dc279ddefd7134,
title = {A Data-Driven Computational Framework for Incompressible Flow in Hydraulic Networks — arXiv:2608.21575},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21575},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_279ddefd7134; sha256 38ac8a3da2709dffac0fc0fbe636739d82b444248de931ee32248d17c9194c3e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21575. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The classical procedure for solving hydraulic networks relies on the assumption of constitutive equations, which state the relationship between the pressure gradient and fluxes along an edge. In this paper, we propose a data-driven framework that bypasses these constitutive models, formulating the incompressible flow problem directly on the graph topology. By assigning discrete measured data points to network edges, the problem is cast as a mixed-integer quadratic optimization over nodal pressures, edgewise states, and data assignments, accommodating both laminar (convex) and turbulent (non-convex) regimes. To solve this, we evaluate three algorithms: a GPU-accelerated Brute Force method, the Alternating Direction Method (ADM), and Deterministic Annealing (DA). The Brute Force method certifies global optima for small networks, establishing a good baseline for the iterative solvers. We demonstrate that ADM is highly sensitive to its initialization, requiring a faithful surrogate model to avoid local minima. In contrast, DA eliminates this dependence through unsupervised clustering. By annealing the data assignment from the centroid to strict nearest-neighbor projections, DA consistently reaches the global optimum without prior manifold reconstruction. Furthermore, numerical experiments reveal that DA is robust to noisy data, remains thermodynamically admissible on all but the coarsest and noisiest datasets, and sustains its convergence rate on larger networks where Brute Force is intractable and ADM degrades. Finally, the framework is successfully validated on complex configurations, including mixed-component networks and a $958$-edge arteriovenous bed featuring a non-Newtonian Carreau--Yasuda model, demonstrating its scalability and practical applicability. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.21575 — 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-18T08:27:23.828Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).