計算靈敏度的增量矩陣法
INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS
-
摘要: 本文介紹了計算網(wǎng)絡函數(shù)靈敏度的增量矩陣法。這個方法,既可求差分靈敏度,也可求微分靈敏度;既適用于無源網(wǎng)絡,也適用于有源網(wǎng)絡。這個算法只涉及到多項式計算,可節(jié)省機時。在附錄中,還給出了14種常用網(wǎng)絡函數(shù)的靈敏度公式。
-
關鍵詞:
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. -
計量
- 文章訪問數(shù): 2172
- HTML全文瀏覽量: 202
- PDF下載量: 474
- 被引次數(shù): 0
下載:
