论文信息 - On the Design of Resistance n-Port Networks by Digital Computer

On the Design of Resistance n-Port Networks by Digital Computer

An effective computational algorithm for the design of resistance n -port networks from given n \times n real, symmetric admittance or impedance matrix specifications is derived and discussed. The computer program that results from this algorithm not only realizes realizable admittance or impedance matrices, but also usually indicates nonrealizability and always provides a "best approximation" in such situations.

R. Rohrer | R. Rohrer

[1] Charles A. Desoer,et al. Basic Circuit Theory , 1969 .

[2] L. Weinberg,et al. The Realization of n-Port Networks Without Transformers - A Panel Discussion: Statements by Discussants , 1962 .

[3] G. D. Hachtel,et al. Techniques for the optimal design and synthesis of switching circuits , 1967 .

[4] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[5] I. Cederbaum. Topological Considerations in the Realization of Resistive n-Port Networks , 1961 .

[6] R. E. Kalman,et al. Optimum Seeking Methods. , 1964 .

[7] Ronald A. Rohrer,et al. Fully automated network design by digital computer: Preliminary considerations , 1967 .

[8] K. Thulasiraman,et al. Synthesis of a Class of n-Port Networks , 1968 .

[9] Russell G. Foster,et al. An Open Question , 1961 .