Networks of pipelines for gas with nonconstant compressibility factor: stationary states (Q725736)

The paper models the gas transportation on networks. The isothermal Euler equations are considered. The compressibility factor in the state equation on the edge \(e\) is given as \[ z^e(p^e) = 1+\alpha^e p^e\,, \] where \(p^e\) is the pressure on the edge \(e\) and \(\alpha^e\) is a negative constant. The stationary states in the pipes (edges of the graph) are considered, and their properties are examined. The solutions are compared with the solutions of the Weymouth equation. For the stationary states in the network (finite oriented graph with Kirchhoff conditions), three examples are shown -- tree graph, a graph with two parallel edges, and a diamond graph with two independent cycles. As the main result, the existence and uniqueness for the stationary state, described by a general graph are proved. The proof is done by induction, according to the number \(n\) of cycles of the graph. Cutting of an edge is used to complete this proof.