• DocumentCode
    1189896
  • Title

    Near-Optimal Ordering of Electronic Circuit Equations

  • Author

    Silverberg, M.

  • Issue
    12
  • fYear
    1968
  • Firstpage
    1173
  • Lastpage
    1174
  • 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.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1968.226883
  • Filename
    1687287
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1189896