摘要
在电路设计中 ,灵敏度分析具有重要意义。通常应用计算机辅助网络分析法 ,在直接展开网络节点电压方程中的节点导纳矩阵时 ,由于出现重复项而增加出错机会和增大计算误差。该文以图论知识为基础 ,应用网络连通图中的树、k -树与k-树树支导纳乘积 ,给出网络函数及其灵敏度分析的拓扑表达式 ,无重复项出现 ,减少了工作量和出错机会 ,通过实例计算可以看出该方法简捷、直观、有效。
The network function sensitivity is important in network design. The computer aided network analysis often increases the wrong making probability and computation errors in the procedure of expanding the node admittance matrix. In this paper, based on network graph theory, using tree , k-tree and admittance product of k-tree branches, a method for generating topological formulas of network function sensitivity is presented . This method reduces the workload and wrong making probability.It is proved by the example that this method is simple and efficient.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2001年第5期524-527,共4页
Journal of Nanjing University of Science and Technology
