This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Near-Optimal Ordering of Electronic Circuit Equations
December 1968 (vol. 17 no. 12)
pp. 1173-1174
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:
Index Terms?Electronic circuit equations, Gaussian elimination, network analysis, optimal ordering of equations, sparse matrices.
Citation:
M. Silverberg, "Near-Optimal Ordering of Electronic Circuit Equations," IEEE Transactions on Computers, vol. 17, no. 12, pp. 1173-1174, Dec. 1968, doi:10.1109/TC.1968.226883
Usage of this product signifies your acceptance of the Terms of Use.