Efficient computation of large change multiparameter sensitivity
- 1 September 1973
- journal article
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 1 (3) , 237-247
- https://doi.org/10.1002/cta.4490010304
Abstract
In many applications, a network has to be solved repeatedly while certain element values are changed. The computation is reduced significantly if the network functions are generated in terms of these variable parameters explicitly. This paper presents a method of doing this which requires the solution of the network with at most m+1 excitations when there are m variable parameters.Keywords
This publication has 6 references indexed in Scilit:
- Method for the efficient computation of the large-change sensitivity of linear nonreciprocal networksElectronics Letters, 1971
- Realistic Design Using Large-Change Sensitivities and Performance ContoursIEEE Transactions on Circuit Theory, 1971
- The Transfer Function and Sensitivity of a Network with n Variable ElementsIEEE Transactions on Circuit Theory, 1969
- Application of a Bilinear Theorem to Network SensitivityIEEE Transactions on Circuit Theory, 1965
- COMPOUND MATRICES IN NETWORK THEORYPublished by Elsevier ,1963
- Topological Analysis and Synthesis of Communication NetworksPublished by Columbia University Press ,1962