In this paper a new method is described to completely solve in symbolic form an electrical analog network. The technique is an extension of the two-graph one, which has been shown to be the most suitable method for symbolic analysis of large analog circuits. On the other hand an attempt has been made to overcome the RLC-g/sub m/ limitation still inherent in the classical application of the algorithm.
展开▼
机译：在本文中，描述了一种新的方法来完全以符号形式求解电气模拟网络。该技术是两张图的扩展，已被证明是对大型模拟电路进行符号分析的最合适方法。另一方面，已经尝试克服算法的经典应用中仍然固有的RLC-g / sub m /限制。
展开▼
