On the number of conductances required for realizing  Y  and  K  matrices | Zendy

Naidu M. G. G. | Zendy; Reddy P. S. | Zendy; Thulasiraman K. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

On the number of conductances required for realizing Y and K matrices

Author(s) -

Naidu M. G. G.,

Reddy P. S.,

Thulasiraman K.

Publication year - 1977

Publication title -

international journal of circuit theory and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.364

H-Index - 52

eISSN - 1097-007X

pISSN - 0098-9886

DOI - 10.1002/cta.4490050302

Subject(s) - realization (probability) , matrix (chemical analysis) , port (circuit theory) , conductance , resistive touchscreen , mathematics , network analysis , active networking , combinatorics , topology (electrical circuits) , discrete mathematics , computer science , electrical engineering , engineering , telecommunications , materials science , statistics , composite material

Upper bounds are established on the number of conductances required for realizing a real symmetric matrix Y as the short‐circuit conductance matrix of a resistive n ‐port network containing no negative conductances, and for the realization of a real matrix K as the potential factor matrix of a similar network without negative conductances. These results are the consequence of the properties of the modified cut‐set matrix of an n ‐port and a theorem in the theory of linear programming.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research