An automatic reordering scheme for simultaneous equations derived from network systems

A procedure is presented for the automatic renumbering of network type equations prior to solution by sparse matrix techniques. The method takes an arbitrary input sequence and creates an order which makes possible solution of complex network systems by reducing demand for computer storage and time. Examples are presented to demonstrate the procedure in action and show that, even in cases where the system has been carefully numbered, considerable improvement can be achieved. The procedure is also applicable to band matrix solution techniques.