A Theorem on Inverses of Convex Sets of Real Matrices with Application to the Worst Case DC Problem

IEEE Transactions on Circuits and Systems

Volumn 24, Issue 8, 1977, Pages 409-415

  Scott, Terrence R ^b   Hoffman, Alan J ^a  

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

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - MATRIX ALGEBRA;

DC NETWORKS; WORST CASE DC PROBLEM;

ELECTRIC NETWORKS, LINEAR;

EID: 0017524049     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1977.1084365     Document Type: Article

References (7)

1. G. D. Hachtel, R. K. Brayton, and F. G. Gustavson, “The sparse tableau approach to network analysis and design,” IEEE Trans. Circuit Theory, vol. CT-18, no. I, pp. 101–113, Jan. 1971.
2. P. Penfield, Jr., R. Spence, and S. Duinker, Tellegens Theorem and Electrical Networks. Cambridge, MA: MIT Press, 1970.
3. C. E. Shannon and D. W. Hagelbarger, “Concavity of resistance functions,” J. Appl. Phys., vol. 27, pp. 42–43, Jan. 1956.
4. R. T. Rockafeller, Convex Analysis: Princeton, NJ: Princeton University Press, 1970. (See sec. 11 and 18.)
5. J. W. Bandler, “Optimization of design tolerances using nonlinear programming,” J. of Optimization Theory and Applications, vol. 14, no. I, pp. 99–114, July 1974.
6. W. J. Troop and E. Peskin, “The transfer function and sensitivity of a network with n-variable elements,” IEEE Trans. Circuit Theory, vol. CT-16, pp. 242–244, 1969.
7. A. Antoniou and K. S. Naidu, “Modeling a gyrator circuit,” in 1973 Proceedings IEEE International Symposium on Circuits and Systems, pp. 272-275.