A review of computational techniques in flow Network models

Abstract

Several computational algorithms which have been found useful in the computer  simulation of flow network problems are discussed. The emphasis is on accurate, fast and low-cost methods for handling large structured problems. In the case of underdetermined problems, the implementation of smoothing and related techniques that yield a class of desirable solutions is described. It is shown how the model structure has been utilized in the solution process to save computer storage and run time. How the accuracy of the numerical schemes has been improved by the use of splines without disturbing the sparsity structure of the given system is also discussed.