# zbMATH — the first resource for mathematics

Pole placement and compensator design of generalized systems. (English) Zbl 0612.93028
It is shown that if the generalized system Eẋ$$=Ax+Bu$$, $$y=Cx$$ is controllable and observable, then the impulse modes can be eliminated by almost any constant output feedback. After impulse modes are eliminated, the poles of the strongly controllable and observable generalized system can be assigned arbitrarily by state feedback. An efficient procedure for design of a compensator is given.
Reviewer: T.Kaczorek

##### MSC:
 93B55 Pole and zero placement problems 34A99 General theory for ordinary differential equations 93C05 Linear systems in control theory 93B05 Controllability 93B07 Observability 93B50 Synthesis problems
Full Text:
##### References:
 [1] Cobb, D., Feedback and pole placement in descriptor variable systems, Internat. J. control, 33, 1135-1146, (1981) · Zbl 0464.93039 [2] Davison, E.J., Decentralized stabilization and regulation in linear multivariable system, () · Zbl 0308.93023 [3] Kailath, T., Linear systems, (1980), Prentice-Hall Englewood Cliffs, NJ · Zbl 0458.93025 [4] El-Tohami, M.; Lovass-Nagy, V.; Mukundan, R., On the design of observers for generalized state-space systems using singular value decomposition, Internat. J. control, 38, 673-683, (1983) · Zbl 0513.93029 [5] Verghese, G.C.; Levy, B.C.; Kailath, T., A generalized state-space for singular systems, IEEE trans. automat. control, 26, 811-831, (1981) · Zbl 0541.34040 [6] Van Der Weiden, A.J.J.; Bosgra, O.H., The determination of structural properties of a linear multivariable system by operations of system singularity 2. non-proper systems in generalized state-space form, Internat. J. control, 32, 489-537, (1980) · Zbl 0449.93040
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.