Li Feng. INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS[J]. Journal of Electronics & Information Technology, 1987, 9(4): 323-334.
Citation:
Li Feng. INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS[J]. Journal of Electronics & Information Technology, 1987, 9(4): 323-334.
Li Feng. INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS[J]. Journal of Electronics & Information Technology, 1987, 9(4): 323-334.
Citation:
Li Feng. INCREMENTAL MATRIX ALGORITHM FOR CALCULATING SENSITIVITIES OF NETWORK FUNCTIONS[J]. Journal of Electronics & Information Technology, 1987, 9(4): 323-334.
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.
DownLoad: