Sufficient conditions for the unique solvability of linear networks containing memoryless 2‐ports
András Recski · International Journal of Circuit Theory and Applications · 1980
Abstract Combinatorial necessary and sufficient conditions for the unique solvability of linear networks containing n ‐ports are well known for the ‘general’ case. They are only necessary if relations among n ‐port parameters are also taken into consideration. In the present paper combinatorial sufficient conditions are presented for linear networks containing RLC elements and memoryless 2‐ports. The somewhat surprising result is proved that whether a 2‐port can cause certain types of singularities can be predicted before the interconnection. A concept, similar to the normal tree (which intersects ideal transformers by one, gyrators by two or no edges) is introduced for arbitrary 2‐ports. Its existence implies unique solvability. Relations to previous results and algorithmical aspects are also discussed.