Issue No. 12 - December (1968 vol. 17)
Abstract?An implementation of an algorithm for near-optimal ordering of sparse network equations is described. Such ordering can result in considerable savings in computer time and may be applied to various types of analysis programs. A sample problem demonstrates a saving in computer time in excess of 50 percent.
Index Terms?Electronic circuit equations, Gaussian elimination, network analysis, optimal ordering of equations, sparse matrices.
M. Silverberg, "Near-Optimal Ordering of Electronic Circuit Equations", IEEE Transactions on Computers, vol. 17, no. , pp. 1173-1174, December 1968, doi:10.1109/TC.1968.226883