Root m-tissues: Systems under an action of the m-parameters. (English) Zbl 0584.93016

This paper considers the root loci of the characteristic polynomial of degree n with m parameters \[ \det (sI-F)=\sum_{m_ 1,...,m_ n}\delta^{1,...,n}_{m_ 1,...,m_ n}(\delta_{1,m_ 1}s- F_{1,m_ 1})...(\delta_{n,m_ n}s-F_{n,m_ n}) \] where the summation with respect to \(m_ 1,...,m_ n\) is over all permutations on 1,...,n, and \(\delta^{1,...,n}_{m_ 1,...,m_ n}=1\) (-1) for the even (odd) permutation \(\left( \begin{matrix} 1,...,n\\ m_ 1,...,m_ n\end{matrix} \right)\). Let \(K_ i\) \((i=1,...,m)\) be parameters. Then, the roots \(s_ 1,...,s_ n\) of the characteristic equation have the structure of the action of the additive group \(\{K_ 1,...,K_ m\}={\mathbb{R}}^ m.\)
The image \(s_ i=T(K_ 1,...,K_ m)\) of the linear mapping \(T: {\mathbb{R}}^ m\to {\mathbb{C}}\) is called the m-tissue at the point \(s_ i\). The m-tissues go through every root. The group action is used to compute the root differentials. Integrating them gives root loci. This method is illustrated by three numerical examples. In an example it is shown that m-tissues constitute 2m-gons under the simultaneous change of m- parameters. Accordingly, the robustness can be checked by using them. For the case that \(F_{i_ 1,j_ 1}=K\) is a simple parameter of F, Theorem 3 states that if the root loci have no multiplicy at \(\infty\), then there exist no root loci with odd number of even multiplicities.
Section 4 shows how to find the feedback gains \(K_ 1\) \((i=1,...,\rho)\) to shift the poles to the desired place. This is called the inverse problem. By integrating the equations for the gain differentials, the gains are obtained. This method is illustrated by an example.
Reviewer: M.Kono


93B35 Sensitivity (robustness)
93B55 Pole and zero placement problems
93C35 Multivariable systems, multidimensional control systems
93D99 Stability of control systems
Full Text: EuDML


[1] R. Abraham, J. E. Marsden: Foundations of Mechanics. Benjamin Publ. Co., London 1978. · Zbl 0393.70001
[2] G. E. Alderson, P. M. Lin: Computer generation of symbolic network functions - A new theory and implementation. IEEE Trans. Circuit Theory CT-20 (1973), 48- 56.
[3] J. W. Archbold: Algebra. Pitman, London 1964. · Zbl 0161.00903
[4] J. Bak, D. J. Newmann: Complex Analysis. Springer-Verlag, New York 1982.
[5] J. H. Blakelock: Automatic Control of Aircraft and Missiles. Wiley, New York 1965.
[6] W. Blaschke, G. Bol: Geometrie der Gewebe. Springer-Verlag, Berlin 1938. · Zbl 0020.06701
[7] H. W. Bode: Network Analysis and Feedback Amplifier Design. Van Nostrand, Princeton 1945, 115-120.
[8] N. Bourbaki: Variétés Différentielles et Analytiques. Herman, Paris 1967. · Zbl 0171.22004
[9] N. H. Clamroch: State Models of Dynamic Systems. Springer-Verlag, New York 1980.
[10] N. G. Čebotarev: Algebraic Functions Theory. (in Russian). OGIZ, Moscow 1948.
[11] J. C. Doyle: Guaranteed margins for LQG regulators. IEEE Trans. Automat. Control AC-23 (1978), 756-757.
[12] J. C. Doyle, G. Stein: Robustness with observers. IEEE Trans. Automat. Control AC-24 (1979), 607-611. · Zbl 0429.93048
[13] W. R. Evans: Control system synthesis by root locus method. Trans. AIEE 69 (1960), 66-69.
[14] K. S. Fu: Sensitivity of a linear system with variations of one or several parameters. IRE Trans. Circuit Theory CT-7 (1960), 348-349.
[15] H. Haken: Higher Order Root-Locus Technique with Applications in Control System Design. Vieweg, Braunschweig 1981.
[16] P. Hippe: Partial fraction expansion and root locus method. Internat. J. Control 34 (1981), 1185-1194. · Zbl 0472.93019
[17] S. S. L. Chang: Synthesis of Optimum Control Systems. McGraw-Hill, New York 1961.
[18] C. G. J. Jacobi: Über ein leichtes Verfahren die in der Theorie der Säcularstörungen verkommenden Gleichungen numerisch aufzulösen. J. reine angew. Mathematik 30 (1846), 51-94. · ERAM 030.0852cj
[19] T. Kailath: Linear Systems. Prentice-Hall, Englewood Cliffs 1980. · Zbl 0454.93001
[20] T. Kato: Perturbation Theory for Linear Operators. Springer-Verlag, Berlin 1984. · Zbl 0531.47014
[21] B. C. Kuo: Automatic Control Systems. Prentice-Hall, Englewood Cliffs 1982. · Zbl 0542.93001
[22] P. M. Lin: A Survey of applications of symbolic network functions. IEEE Trans. Circuit Theory CT-20 (1973), 732-737.
[23] S. J. Mason, H. J. Zimmerman: Electronic Circuits, Signals, and Systems. Wiley, New York 1960.
[24] C. T. Pan, K. S. Chao: A computer-aided root-locus method. IEEE Trans. Automat. Control AC-23 (1978), 856-860. · Zbl 0387.93019
[25] A. Papoulis: Perturbations of the natural frequencies and eigenvectors of a network. IEEE Trans. Circuit Theory CT-13 (1966), 188-195.
[26] I. Postlethwaite, A. G. J. MacFarlane: A Complex Variable Approach to the Analysis of Linear Multivariable Feedback Systems. Springer-Verlag, Berlin 1979. · Zbl 0402.93001
[27] D. G. Retallack: Extended root-locus technique for desing of linear multivariable feedback systems. Proc. Inst. Electr. Engrs. 117 (1970), 618-622.
[28] G. Rosenau: Höhere Wurzelortskurven bei Mehrgrössensystemen. Preprints IFAC Symp. Multivar. Control. Systems, Düsseldorf, Tome 1, 1-9, 1968.
[29] M. Suzuki: Group Theory I. Springer-Verlag, Berlin 1982. · Zbl 0472.20001
[30] K. Singhal, J. Vlach: Symbolic analysis of analog and digital circuits. IEEE Trans. Circuits and Systems CAS-24 (1977), 598-609. · Zbl 0365.94064
[31] M. K. Tsai, B. A. Shenoi: Generation of symbolic network functions using computer software techniques. IEEE Trans. Circuits and Systems CAS-24 (1977), 344-346. · Zbl 0365.94054
[32] A. Vaněček: Maximally Stable Control and Reconstruction. Academia, Prague 1984.
[33] V. C. M. Yeh: The study of transients in linear feedback systems by conformal mapping and the root locus method. Trans. ASME 76 (1954), 349-363.
[34] K. S. Yeung: Symbolic network function generation via discrete Fourier transform. IEEE Trans. Circuits and Systems CAS-31 (1984), 229-231. · Zbl 0534.94005
[35] A. Vaněček: What is the Basic Problem of the Multivariable Control Synthesis?. Res. Rept. ČSAV-ÚTIA No. 1322, Prague 1985.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.