Premium
Node Reordering algorithms for water network analysis
Author(s) -
Gay R. K. L.,
Chin K. K.,
Chua S. H.,
Chan C. H.,
Ho S. Y.
Publication year - 1978
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620120804
Subject(s) - node (physics) , subroutine , computer science , algorithm , admittance , admittance parameters , fortran , parallel computing , matrix (chemical analysis) , engineering , materials science , electrical engineering , structural engineering , voltage , composite material , operating system , electrical impedance
The node Admittance matrices for Water Networks are normally sparse and symmetrical. Advantage may be taken of these properties to reduce the amount of computational time and memory required to solve them. Two node reordering algorithms and an economic system of storing input data are described. The node reordering algorithms minimize the number of fill‐ins which would occur in the solution of the node admittance matrix. Only non‐zero elements are stored and operated on. Subroutines for the node reordering algorithms and storge of input data, written in FORTRAN IV are included.