

浏览全部资源
扫码关注微信
复旦大学电子工程系
Published:1987
移动端阅览
[1]李锋.全符号灵敏度函数的拓扑生成法[J].电子学报,1987(02):118-122.
Li Feng. A Topological Method for Symbolic Sensitivity Functions[J]. Acta Electronica Sinica, 1987, (2): 118-122.
本文讨论用K-树拓扑法生成网络的全符号灵敏度函数。该方法只涉及网络图中若干种K-树。由于求K-树已有成熟的算法
因此
本方法易于用计算机实现。本文的另一个结果是获得了求节点导纳矩阵任意一个二阶代数余子式的拓扑公式。
This paper discusses the generation of the symbolic sensitivity functions of networks by using the k-trees topological method. The method involves only some k-trees. There already exist good algorithims and programs for deriving the k-trees
so the method is easy to realize by using a computer. Another result is presented a topological formula for any 2-order algebraic cofactor in passive network node admittance matrixes.
0
Views
10
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621