Solution of water networks by sparse matrix methods

Publisher Website
Google Scholar
Abstract
A computer program for Water Network analysis has been developed usingy sparse matrix techniques for solution. The method used is the successive linearization method where the set of equations [Q]=[Y][H] is solved. In the process, two subroutines for node reordering to preserve sparsity of the Jacobian matrix and a subroutine for solving the matrix by the Doolittle method are included. The method is user oriented and requires a minimum amount of input data and effort. Networks of up to 200 nodes and 300 pipes may be analysed on an IBM 1130 computer with 16K words of memory.

This publication has 12 references indexed in Scilit: