Near-Optimal Ordering of Electronic Circuit Equations

1 December 1968

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-17 (12) , 1173-1174
https://doi.org/10.1109/TC.1968.226883

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

ELECTRONIC CIRCUIT
SPARSE NETWORK
ANALYSIS PROGRAMS
NETWORK EQUATIONS
SAMPLE PROBLEM
OPTIMAL ORDERING
PROBLEM DEMONSTRATES
EQUATIONS ABSTRACT&MDASH

This publication has 0 references indexed in Scilit: