An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix Solution

IEEE Transactions on Circuit Theory

Volumn 18, Issue 1, 1971, Pages 40-50

  Berry, Robert D ^a  

^a NAVAL AIR WARFARE CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS; COMPUTER-AIDED CIRCUIT ANALYSI; COMPUTERS, DIGITAL, PROGRAMMIN; ELECTRIC CIRCUITS, ANALYSIS; ELECTRIC CIRCUITS, COMPUTER AP; RADIO CIRCUITS; RADIO CIRCUITS, COMPUTER APPLI;

EID: 0014975411     PISSN: 00189324     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCT.1971.1083215     Document Type: Article

References (5)

1. E. C. Ogbuobiri, W. F. Tinney, and J. W. Walker. “Sparsity-directed decomposition for Gaussian elimination on matrices,” 1969 Power Industry Computer Applications Conf. pp. 215–225.
2. W. F. Tinney and J. W. Walker, “Direct solutions of sparse network equations by optimally ordered triangular factorization,” Proc. IEEE., vol. 55, pp. 1801–1809, November 1967.
3. F. Gustavson, W. Liniger, and R. Willoughby, “Symbolic generation of an optimal Crout algorithm for sparse systems of linear equations,” IBM Corp., Yorktown Heights, N. Y., Res. Paper RC 1852.
4. L. Fox, An Introduction to Numerical Linear Algebra. New York: Oxford, 1965, pp. 60–65, 99–102.
5. S. W. Director and R. A. Rohrer, “Automated network design—the frequency-domain case,” IEEE Trans. Circuit Theory, vol. CT-16, pp. 330–337, August 1969.