Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
复制标题
包含无记忆 2 端口的线性网络的独特可解性的充分条件
DOI：
10.1002/cta.4490080203
复制
发表时间：
1980
影响因子：
2.3
通讯作者：
A. Recski
中科院分区：
文献类型：
--
作者：
A. Recski
包含n个端口的线性网络的唯一可解性的组合必要和充分条件是众所周知的“一般”情况。只有考虑到n-port参数之间的关系时，它们才有必要。
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.