JAMP  Vol.8 No.6 , June 2020
Steady State Gas Flow in Pipeline Networks: Existence and Uniqueness of Solution
Abstract: In this paper we discuss the uniqueness and existence of solution to a real gas flow network by employing graph theory. A directed graph is an efficient way to represent a gas network. We consider steady state real gas flow network that includes pipelines, compressors, and the connectors. The pipelines and compressors are represented as edges of the graph and the interconnecting points are represented as nodes of the graph representing the network. We show that a unique solution of such a system exists. We use monotonicity property of a mapping to proof uniqueness, and the contraction mapping theorem is used to prove existence.
Cite this paper: Atena, A. , Tekalign, W. and Muche, T. (2020) Steady State Gas Flow in Pipeline Networks: Existence and Uniqueness of Solution. Journal of Applied Mathematics and Physics, 8, 1155-1167. doi: 10.4236/jamp.2020.86087.

[1]   Reigstad, G.A. (2015) Existence and Uniqueness of Solutions to the Generalized Riemann Problem for Isentropic Flow. SIAM Journal on Applied Mathematics, 75, 679-702.

[2]   Deo, N. (2016) Graph Theory with Applications to Engineering and Computer Science, Mineola. Dover Publications, New York.

[3]   Feistauer, M. (2003) Mathematical and Computational Methods for Compressible Flow. Oxford University Press, Oxford.

[4]   Chorin, A.J. and Marsden, J.E. (2012) A Mathematical Introduction to Fluid Mechanics. 2nd Edition, Springer, New York.

[5]   Brook, R.M. and Schmitt, K. (2009) The Contraction Mapping Principle and Some Applications. Electronic Journal of Differential Equations, 9.