Abstract :
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.
Keywords :
Index Terms—Electronic circuit equations, Gaussian elimination, network analysis, optimal ordering of equations, sparse matrices.; Admittance; Circuit analysis; Differential equations; Electronic circuits; Frequency domain analysis; Laplace equations; Network topology; Sparse matrices; Steady-state; Symmetric matrices; Index Terms—Electronic circuit equations, Gaussian elimination, network analysis, optimal ordering of equations, sparse matrices.;
