arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.22124physics.comp-phmath.OC
收藏

通过图划分求解潜在驱动的稳态非线性网络流方程

The Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations via Graph Partitioning

Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室)

Shriram Srinivasan, Kaarthik Sundar

AI总结:

本文提出一种通过图划分求解大规模网络中潜在驱动稳态流非线性方程的算法,通过局部求解小子系统实现全局解,适用于不同运营商网络的协同计算。

摘要:

在各种工程应用中,如管道网络中天然气或水的输送,求解大规模网络中的潜在驱动稳态流所需的非线性方程系统依赖于网络拓扑,并且随着网络规模的增加,求解难度加大。本文提出一种算法,利用给定的网络划分将其划分为可处理的子规模,通过局部求解由划分诱导的小子系统来计算整个非线性系统的全局解。当划分由不同运营商拥有的网络的互连点或转运点诱导时,该方法确保数据仅在互连点共享,使网络运营商能够以任何方式求解其各自领域的网络流系统。所提出的方法与Schur补联系,并在一些具有挑战性的测试用例上验证了其可行性。

英文摘要:

The solution of potential-driven steady-state flow in large networks is required in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and its solution grows more challenging as the network size increases. We present an algorithm that utilizes a given partition of a network into tractable sizes to compute a global solution for the full nonlinear system through local solution of smaller subsystems induced by the partitions. When the partitions are induced by interconnects or transfer points corresponding to networks owned by different operators, the method ensures data is shared solely at the interconnects, leaving network operators free to solve the network flow system corresponding to their own domain in any manner of their choosing. The proposed method is shown to be connected to the Schur complement and the method's viability demonstrated on some challenging test cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑