| 生成有源网络符号灵敏度的拓扑法 |
| |
| 引用本文： | 李锋. 生成有源网络符号灵敏度的拓扑法[J]. 复旦学报(自然科学版), 1987, 0(3) |
| |
| 作者姓名： | 李锋 |
| |
| 作者单位： | 复旦大学电子工程系 |
| |
| 摘 要： | 本文讨论用有向K-树生成有源网络符号灵敏度函数的方法,给出了十四种常用网络函数和网络参数的灵敏度公式.这些公式易于在计算机上生成有源网络的符号灵敏度函数.
|
| 关 键 词： | 图论 拓扑分析 网络拓扑 灵敏度 |
A TOPOLOGICAL METHOD FOR PRODUCING SYMBOUC SENSITIVITY FUNCTIONS OF ACTIVE NETWORKS |
| |
| Li Feng. A TOPOLOGICAL METHOD FOR PRODUCING SYMBOUC SENSITIVITY FUNCTIONS OF ACTIVE NETWORKS[J]. Journal of Fudan University(Natural Science), 1987, 0(3) |
| |
| Authors: | Li Feng |
| |
| Affiliation: | Department of Electronic Engineering |
| |
| Abstract: | A topological method for producing symbolic sensitivity functions of active networks by using directed K-trees is discussed in this paper. The formulas of 14 networks functions and parameters are given. They can be used conveniently in producing symbolic sensitivity functions by computer. |
| |
| Keywords: | graph theory topological analysis network topology sensitivity. |
| 本文献已被 CNKI 等数据库收录！ |
