Sparsity Oriented Analysis of Large Pipe Networks

by M. Chandrashekar, Asst. Prof.; Dept. of Systems Design, Univ. of Waterloo, Waterloo, Ontario, Canada,
K. H. Stewart, Student; Dept. of Systems Design, Univ. of Waterloo, Waterloo, Ontario, Canada,


Serial Information: Journal of the Hydraulics Division, 1975, Vol. 101, Issue 4, Pg. 341-355


Document Type: Journal Paper

Discussion: Fietz Trevor R. (See full record)
Discussion: Prakash Anand (See full record)
Closure: (See full record)

Abstract: Water distribution systems of large metropolitan centers contain several hundred nodes and pipes and a number of pumping stations and reservoirs. The size and complexity of these networks require very efficient steady-state solution techniques for implementation on large digital computer systems. A new approach to this problem is proposed based on graph theory, sparsity oriented matrix decomposition techniques, and Newton's method of iterative solution of nonlinear algebraic system of equations. Several large-scale networks were analyzed using a FORTRAN coded program called WATER using minimal computer resources. The results included in the paper clearly demonstrate the computational power of this approach.

Subject Headings: Pumping stations | Computer networks | Network analysis | Water pipelines | Urban areas | Pipes | Railroad stations

Services: Buy this book/Buy this article

 

Return to search