计算灵敏度的增量矩阵法
INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS
-
摘要: 本文介绍了计算网络函数灵敏度的增量矩阵法。这个方法,既可求差分灵敏度,也可求微分灵敏度;既适用于无源网络,也适用于有源网络。这个算法只涉及到多项式计算,可节省机时。在附录中,还给出了14种常用网络函数的灵敏度公式。
-
关键词:
Abstract: In this paper, a new algorithm called incremental matrix algorithm for calculating sensitivities of network functions is presented. By use of this algorithm, both difference and differential sensitivity can be calculated. The algorithm can be used in both passive networks and active networks. This algorithm only involves the calculation of polynomial, it can save computing time. In the appendix, sensitivity formulae for 14 usual network founctions are given. -
S. W. Director and R. A. Rohrer, IEEE Trans. on CT, CT-16 (1969), pp.318-323.[2]赵永昌,电子学报,1981年,第5期,第48页.[3]L. M. Vallese IEEE Trans, on CAS, CAS-21(1974), 46.[4]S. D. Shieu, and S. P. Chan, ibid, CAS-21(1974), 39.[5]S. R. Parker, IEEE Trans. on CT, CT-18(1971), 27.[6]J. K. Fidler, IEEE Trans, on CAS, CAS-23 (1976), 567.[7]J. G. Truxal, Automatic Feedbak Control Synthesis, New York: McGraw-Hill Book Company, 1959, pp.120-127. -
计量
- 文章访问数: 2132
- HTML全文浏览量: 192
- PDF下载量: 469
- 被引次数: 0
下载:
