The Sparse Tableau Approach to Network Analysis and Design

IEEE Transactions on Circuit Theory

Volumn 18, Issue 1, 1971, Pages 101-113

  Hachtel, Gary D ^a   Brayton, Robert K ^a   Gustavson, Fred G ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

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

References (20)

1. F. G. Gustavson, W. Liniger, and R. A. Willoughby, “Symbolic generation of an optimal Crout algorithm for sparse systems of linear equations,” J. Ass. Comput. Mach., vol. 17, pp. 87–109, January 1970.
2. R. K. Brayton, F. G. Gustavson, and R. A. Willoughby, “Some results on sparse matrices,” to be published in Math. Comput.
3. 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.
4. Proc. Sparse Matrix Symp., IBM Rep. RA-1, March 1969.
5. G. D. Hachtel and R. A. Rohrer, “Techniques for the optimal design and synthesis of switching circuits,” Proc. IEEE, vol. 55, pp. 1864–1877, November 1967.
6. F. H. Branin, Jr., “Computer methods of network analysis,” Proc. IEEE, vol. 55, pp. 1787–1801, November 1967.
7. C. W. Gear, “The automatic integration of stiff O.D.E.'s,” Proc. 1968 IFIPS Congr., pp. A81–A85.
8. —, “The control of parameters in the automatic integration of ordinary differential equations,” J. Ass. Comput. Mach.; Department of Computer Science, University of Illinois, Urbana, Internal Rep., p. 14, May 1968.
9. S. Sedore et al., “SCEPTRE—an automated digital computer program for determining the response of electronic systems to transient nuclear radiation,” vol. 11, IBM Space Guidance Center, Oswego, N. Y., Tech. Rep. AFWL-TR-66-126.
10. E. S. Kuh and R. A. Rohrer, “The state-variable approach to network analysis,” Proc. IEEE, vol. 53, pp. 672–686, July 1965.
11. R. Fletcher and M. J. D. Powell, “A rapidly convergent descent method for minimization,” Comput. J., vol. 6, pp. 163–168, 1965.
12. A. Nordsieck, “On numerical integration of ordinary differential equations,” Math. Comput. vol. 16, pp. 22–49, 1962.
13. D. A. Calahan, “Optimization of switching circuits,” presented at the 2nd Biennial Cornell Conf. Engineering Applications of Electronic Phenomena, 1969.
14. H. M. Markowitz, “The elimination form of the inverse and its application to linear programming,” Management Sci., vol. 3, pp. 255–269, April 1957.
15. G. B. Dantzig, R. P. Harvey, R. D. McKnight, and S. S. Smith, “Sparse matrix techniques in two mathematical programming codes,” Proc. Sparse Matrix Symp., IBM Rep. RA-1, pp. 85–99, March 1969.
16. P. D. Crout, “A short method for evaluating determinants and solving systems of linear equations with real or complex coefficients,” AIEE Trans. (Supplement), vol. 60, pp. 1235–1240, December 1941.
17. J. H. Wilkinson, The Algebraic Eigenvalue Problem. New York: Oxford University Press, 1965.
18. —, Rounding Errors in Algebraic Processes. Englewood Cliffs, N. J.: Prentice-Hall, 1963, pp. 121–126.
19. S. Seshu, “Topological considerations in the design of driving point functions,” Proc. AMS, pp. 1068–1073, October 1965.
20. A. Chang, “Applications of sparse matrix methods in electric power system analysis,” Proc. Sparse Matrix Symp., IBM Rep. RA-1, pp. 113–121, March 1969.