Synthesis of Minimum-Sensitivity Networks Through Some Classes of Equivalent Transformations
- 1 February 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 17 (1), 2-8
- https://doi.org/10.1109/tct.1970.1083035
Abstract
This paper considers the synthesis of passive networks with minimum sensitivity to element tolerances through some classes of continuously equivalent transformations. The methods of transformations to be discussed are those transformerless ones in which the port structures of networks are invariant. Two approaches to the problem are to be considered. The first is the procedure in which an additional network is sought such that the augmented network, obtained by the parallel connection of the given network and the additional one, is equivalent to the original one. The second is based on linear transformations discussed by a number of authors. Of practical interest is the choice of transformation parameters that minimizes the sensitivity to element tolerances. The solution procedure to this problem depends on a penalty function approach that converts the constrained problem into a sequence of unconstrained minimizations for which efficient algorithms have recently been proposed.Keywords
This publication has 14 references indexed in Scilit:
- Sensitivity Invariants of Continuously Equivalent NetworksIEEE Transactions on Circuit Theory, 1968
- Simplified Multiple Parameter Sensitivity Calculation and Continuously Equivalent NetworksIEEE Transactions on Circuit Theory, 1967
- Minimizing a function without calculating derivativesThe Computer Journal, 1967
- Fully automated network design by digital computer: Preliminary considerationsProceedings of the IEEE, 1967
- Techniques for the optimal design and synthesis of switching circuitsProceedings of the IEEE, 1967
- The Noncompleteness of Continuously Equivalent NetworksIEEE Transactions on Circuit Theory, 1966
- Nonlinear Programming: A Numerical SurveySIAM Journal on Control, 1966
- Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear ProgrammingManagement Science, 1964
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964