气体网络上的最优传输
Optimal transport on gas networks
AI总结:
本文通过度量图建模气体网络,引入广义$p$-Wasserstein度量,推导梯度流,重点研究$p=3$的非标准情形。
摘要:
本文将气体网络建模为度量图,边上的等温欧拉方程、内部顶点的基尔霍夫定律以及边界顶点的时间(不)依赖边界条件。针对此设置,引入动态形式下的广义$p$-Wasserstein度量,并利用其推导$p$-Wasserstein梯度流,特别关注非标准情形$p=3$。
英文摘要:
This paper models gas networks as metric graphs, with isothermal Euler equations at the edges, Kirchhoff's law at interior vertices and time-(in)dependent boundary conditions at boundary vertices. For this setup, a generalized $p$-Wasserstein metric in a dynamic formulation is introduced and utilized to derive $p$-Wasserstein gradient flows, specifically focusing on the non-standard case $p = 3$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。