Search

www.springer.com The European Mathematical Society

  • StatProb Collection
  • Recent changes
  • Current events
  • Random page
  • Project talk
  • Request account
  • What links here
  • Related changes
  • Special pages
  • Printable version
  • Permanent link
  • Page information
  • View source

Pole assignment problem

Let $R$ be a commutative ring and let $(A,B)$ be a pair of matrices of sizes $(n \times n)$ and $(n \times m)$, respectively, with coefficients in $R$. The pole assignment problem asks the following. Given $r_1,\ldots,r_n$, does there exist an $(m \times n)$-matrix $F$, called a feedback matrix, such that the characteristic polynomial of $A+BF$ is precisely $(X-r_1)\cdots(X - r_n)$? The pair $(A,B)$ is then called a pole assignable pair of matrices. The terminology derives from the "interpretation" of $(A,B)$ as (the essential data of) a discrete-time time-invariant linear control system: \begin{equation}\label{eq:a1} x(t+1) = Ax(t) + Bu(t) \end{equation} where $x(t) \in R^n$, $u(t) \in R^m$, or also, when $R = \mathbf{R}$ or $\mathbf{C}$, a continuous-time time-invariant linear control system: \begin{equation}\label{eq:a2} \dot x(t) = Ax(t) + Bu(t) \end{equation} where $x(t) \in R^n$, $u(t) \in R^m$.

In both cases, state feedback (see Automatic control theory ), $u \mapsto u + Fx$, changes the pair $(A,B)$ to $(A+BF,B)$.

The transfer function of a system \eqref{eq:a1} or \eqref{eq:a2} with output $y(t) = C x(t)$ is equal to \begin{equation}\label{eq:a3} T(s) = C(sI-A)^{-1}B \end{equation} and therefore the terminology "pole assignment" is used.

The pair $(A,B)$ is a coefficient assignable pair of matrices if for all $a_1,\ldots,a_n \in R$ there is an $(m\times n)$-matrix $F$ such that $A+BF$ has characteristic polynomial $X^n + a_1X^{n-1} + \cdots + a_n$.

The pair $(A,B)$ is completely reachable , reachable , completely controllable , or controllable if the columns of the $(n\times nm)$-reachability matrix \begin{equation}\label{eq:a4} (B,AB,\ldots,A^{n-1}B) \end{equation} span all of $R^n$. All four mentioned choices of terminology are used in the literature. The reachability matrix \eqref{eq:a4} is also called the controllability matrix. This terminology also derives from the "interpretations" \eqref{eq:a1} and \eqref{eq:a2} of a pair $(A,B)$, see again Automatic control theory .

A cyclic vector for an $(n\times n)$-matrix $M$ is a vector $v\in R^n$ such that $(v,MV,\ldots,M^{n-1}v)$ is a basis for $R^n$, i.e., such that $(M,v)$ is completely reachable. Now consider the following properties for a pair of matrices $(A,B)$:

a) there exist a matrix $F$ and a vector $w \in R^m$ such that $Bw$ is cyclic for $A+BF$;

b) $(A,B)$ is coefficient assignable;

c) $(A,B)$ is pole assignable;

d) $(A,B)$ is completely reachable.

Over a field these conditions are equivalent and, in general, a)$\Rightarrow$b)$\Rightarrow$c)$\Rightarrow$d). In control theory, the implication d)$\Rightarrow$a) for a field $R$ is called the Heyman lemma, and the implication d)$\Rightarrow$c) for a field $R$ is termed the pole shifting theorem.

A ring $R$ is said to have the FC-property (respectively, the CA-property or the PA-property) if for that ring d) implies a) (respectively, d) implies b), or d) implies c)). Such a ring is also called, respectively, an FC-ring, a CA-ring or a PA-ring. As noted, each field is an FC-ring (and hence a CA-ring and a PA-ring). Each Dedekind domain (cf. also Dedekind ring ) is a PA-ring. The ring of polynomials in one indeterminate over an algebraically closed field is a CA-ring, but the ring of polynomials in two or more indeterminates over any field is not a PA-ring (and hence not a CA-ring) [a4] .

For a variety of related results, see [a1] , [a2] , [a3] , [a5] .

[a1] J.W. Brewer, J.W. Bunce, F.S. van Vleck, "Linear systems over commutative rings" , M. Dekker (1986)
[a2] J. Brewer, D. Katz, W. Ullery, "Pole assignability in polynomial rings, power series rings, and Prüfer domains" , (1987) pp. 265–286
[a3] R. Bumby, E.D. Soutrey, H.J. Sussmann, W. Vasconcelos, "Remarks on the pole-shifting theorem over rings" , (1981) pp. 113–127
[a4] A. Tannenbaum, "Polynomial rings over arbitrary fields in two or more variables are not pole assignable" , (1982) pp. 222–224
[a5] J. Brewer, T. Ford, L. Kingler, W. Schmale, "When does the ring $K[g]$ have the coefficient assignment property?" , (1996) pp. 239–246
  • This page was last edited on 12 November 2017, at 20:38.
  • Privacy policy
  • About Encyclopedia of Mathematics
  • Disclaimers
  • Impressum-Legal

Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

A corollary of Pole assignment theorem

The well-known Pole Assignment Theorem is

Pole Assignment Theorem. Given $A\in \mathbb{R}^{n\times n},B\in \mathbb{R}^{n\times m}$ , for any target pole set $P=\{\lambda_1,...,\lambda_n\}$ which is closed under complex conjugate, there exists a matrix $F\in \mathbb{R}^{m\times n}$ such that $\lambda(A+BF)=P$ if and only if $(A,B)$ is controllable.

If $\mu$ is an eigenvalue of $A$ and $\mu$ is still an eigenvalue of $A+BF$ for any $F\in \mathbb{R}^{m\times n}$ , $\mu$ is called an uncontrollable pole of $A$ , my question is

Question. The pole assignment problem has a solution i.e. given a target pole set $P$ , there exists a matrix $F\in \mathbb{R}^{m\times n}$ such that $$\lambda(A+BF)=P$$ if and only if all uncontrollable poles of $A$ are in the target pole set $P$ .

by real Schur decomposition, we can choose an orthogonal matrix $Q$ such that $$Q^TAQ=\begin{bmatrix} A_{11} & A_{12} \\ 0 & A_{22} \end{bmatrix}$$ where $\lambda(A_{11})$ consists of all the uncontrollable poles of $A$ . Let $$Q^TB=\begin{bmatrix} B_1 \\B_2 \end{bmatrix}$$ but I do not have idea that how to continue... any help will be appreciated.

  • linear-algebra
  • matrix-calculus
  • control-theory

Xin Fu's user avatar

This is closely related to the Kalman decomposition , from which it can be noted that $\lambda(A_{22})$ instead of $\lambda(A_{11})$ should contain all uncontrollable poles of $A$ . You want to show that the eigenvalues of $A + B\,F$ and thus also $Q^\top(A + B\,F)\,Q$ always contain the uncontrollable poles of $A$ . Using this what can you say about $B_1$ and $B_2$ ? Hint: use $F\,Q = \begin{bmatrix}F_1 & F_2\end{bmatrix}$ and look at the eigenvalues of $Q^\top(A + B\,F)\,Q$ .

Kwin van der Veen's user avatar

  • $\begingroup$ Thank you very much! I got it! The key is Kalman decomposition... $\endgroup$ –  Xin Fu Commented Dec 11, 2019 at 3:32

You must log in to answer this question.

Not the answer you're looking for browse other questions tagged linear-algebra matrices matrix-calculus control-theory ..

  • Featured on Meta
  • Announcing a change to the data-dump process
  • Bringing clarity to status tag usage on meta sites
  • 2024 Election Results: Congratulations to our new moderator!

Hot Network Questions

  • What are the most commonly used markdown tags when doing online role playing chats?
  • How to Interpret Statistically Non-Significant Estimates and Rule Out Large Effects?
  • What's "the archetypal book" called?
  • How would you format to be cleaner and explain the steps better? Do I have any no no's in my latex?
  • Why didn't Air Force Ones have camouflage?
  • Setting labels to be the "Blocking" type using PyQGIS
  • Fusion September 2024: Where are we with respect to "engineering break even"?
  • Where is this railroad track as seen in Rocky II during the training montage?
  • How to clean a female disconnect connector
  • Wien's displacement law
  • Does the average income in the US drop by $9,500 if you exclude the ten richest Americans?
  • What is the nature of the relationship between language and thought?
  • Can I Use A Server In International Waters To Provide Illegal Content Without Getting Arrested?
  • Does a party have to wait 1d4 hours to start a Short Rest if no healing is available and an ally is only stabilized?
  • Can reinforcement learning rewards be a combination of current and new state?
  • Breaker trips when plugging into wall outlet(receptacle) directly, but not when using extension
  • Did the Turkish defense industry ever receive any significant foreign investment from any other OECD country?
  • Current in a circuit is 50% lower than predicted by Kirchhoff's law
  • Euler should be credited with PNT?
  • Is "She played good" a grammatically correct sentence?
  • Star Trek: The Next Generation episode that talks about life and death
  • Gravitational potential energy of a water column
  • The question about the existence of an infinite non-trivial controversy
  • How can I play MechWarrior 2?

pole assignment theorem

Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to  upgrade your browser .

Enter the email address you signed up with and we'll email you a reset link.

  • We're Hiring!
  • Help Center

paper cover thumbnail

Pole assignment for systems over rings

Profile image of Rikus Eising

1982, Systems & Control Letters

Related Papers

Journal of Algebra

David Lantz

pole assignment theorem

Linear Algebra and its Applications

Miguel Carriegos

Vera Angelova

IEEE Transactions on Automatic Control

Banavar Sridhar

Journal of Pure and Applied Algebra

eduardo sontag

Nicolai Christov

International Journal of Control

Petr Zagalak

Rikus Eising

Mathematical Systems Theory

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

RELATED PAPERS

Systems & Control Letters

Journal of Mathematical Sciences

N. Zamarashkin

SIAM Journal on Matrix Analysis and Applications

José Mas Marí

Vera Angelova , Ivan Popchev

2006 IEEE Conference on Computer-Aided Control Systems Design

Vasile Sima , Yaguang Yang

Conjectural Approach to Pole Placement‎

Omar El-Ghezawi

arXiv (Cornell University)

Cynthia Huffman

Bostwick Wyman

IEE proceedings

Franco Blanchini

Circuits, Systems, and Signal Processing

N. Viswanadham

Lecture Notes in Electrical Engineering

21st Mediterranean Conference on Control and Automation

ANTONIS IOANNIS Vardulakis

Mathematical Methods in the Applied Sciences

Michel Fliess

Gennadi Malaschonok

Journal of Computer and System Sciences

Proceedings of the 19th IFAC World Congress

Ioannis Meintanis

Viktor Levandovskyy

Mathematical Theory and Modeling

Aldrin Wanambisi

Argyrios Zolotas

Madhu Belur

RELATED TOPICS

  •   We're Hiring!
  •   Help Center
  • Find new research papers in:
  • Health Sciences
  • Earth Sciences
  • Cognitive Science
  • Mathematics
  • Computer Science
  • Academia ©2024

IEEE Account

  • Change Username/Password
  • Update Address

Purchase Details

  • Payment Options
  • Order History
  • View Purchased Documents

Profile Information

  • Communications Preferences
  • Profession and Education
  • Technical Interests
  • US & Canada: +1 800 678 4333
  • Worldwide: +1 732 981 0060
  • Contact & Support
  • About IEEE Xplore
  • Accessibility
  • Terms of Use
  • Nondiscrimination Policy
  • Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Stabilization of Linear Control Systems and Pole Assignment Problem: A Survey

  • TO THE MEMORY OF G.A. LEONOV
  • Published: 23 December 2019
  • Volume 52 , pages 349–367, ( 2019 )

Cite this article

pole assignment theorem

  • M. M. Shumafov 1  

205 Accesses

12 Citations

Explore all metrics

This paper reviews the problems of stabilization and pole assignment in the control of linear time-invariant systems using the static state and output feedback. The main results are presented, along with a literature review. Stationary and nonstationary stabilizations with the static feedback are considered. The algorithms of low- and high-frequency stabilization of linear systems for solving Brockett’s stabilization problem are provided. The effective necessary and sufficient conditions for stabilization of two- and three-dimensional controllable linear systems are given in terms of the system parameters. The pole assignment problem and the related issues for linear systems are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save.

  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

pole assignment theorem

Robust Stabilization of Linear Control Systems Using a Frequency Domain Approach

pole assignment theorem

Feedback Stabilization of Nonlinear Systems

pole assignment theorem

D. S. Bernstein, “Some open problems in matrix theory arising in linear systems and control,” Linear Algebra Appl. 162–164 , 409–432 (1992).

Article   MathSciNet   MATH   Google Scholar  

V. Blondel, M. Gevers, and A. Lindquist, “Survey on the state of the systems and control,” Eur. J. Contol 1 , 5–23 (1995).

Article   MATH   Google Scholar  

V. L. Syrmos, C. T. Abdallah, P. Dorato, and K. Grigoriadis, “Static output feedback. A survey,” Automatica 33 , 125–137 (1997).

Open Problems in Mathematical Systems and Control Theory , ed. by V. D. Blondel, E. D. Sontag, M. Vidyasagar, and J. C.Willems (Springer-Verlag, London, 1999).

Google Scholar  

B. T. Polyak and P. S. Shcherbakov, “Hard problems in linear control theory: Possible approaches to solution,” Autom. Remote Control 66 , 681–718 (2005).

R. Brockett, “A stabilization problem,” in Open Problems in Mathematical Systems and Control Theory (Springer-Verlag, London, 1999).

G. A. Leonov, “Brockett’s problem in the theory of stability of linear differential equations,” St. Petersburg Math. J. 13 , 613–628 (2001).

MathSciNet   Google Scholar  

G. A. Leonov, “The Brockett stabilization problem,” Autom. Remote Control 62 , 847–849 (2001).

G. A. Leonov, “The Brockett problem in the theory of nonstationary stabilization of linear differential equations,” Am. Math. Soc. Transl. 205 , 163–173 (2002).

MATH   Google Scholar  

G. A. Leonov, “The Brockett problem for linear discrete control systems,” Autom. Remote Control 63 , 777–781 (2002).

G. A. Leonov and M. M. Shumafov, Problems of Stabilization of Linear Controllable Systems (S.-Peterb. Gos. Univ., St. Petersburg, 2002) [in Russian].

L. Moreau and D. Aeyels, “Stabilization by means of periodic output feedback,” in Proc. 38th IEEE Conf. on Decision and Control (CDC), Phoenix, AZ, Dec. 7–10, 1999 (IEEE, Piscataway, NJ, 1999), pp. 108–109.

L. Moreau and D. Aeyels, “A note on stabilization by periodic output feedback for third-order systems,” in Proc. 14th Int. Symp. on Mathematical Theory of Networks and Systems (MTNS), Perpignan, France, June 19–23, 2000 (Univ. de Perpignan, Perpignan, 2000).

L. Moreau and D. Aeyels, “Periodic output feedback stabilization of single-input single-output continuous-time systems with odd relative degree,” Syst. Control Lett. 51 , 395–406 (2004).

I. V. Boikov, “The Brockett stabilization problem,” Autom. Remote Control 66 , 746–751 (2005).

I. V. Boikov, “The Brockett stabilization problem for the system of nonlinear differential equations with delay,” Izv. Vyssh. Uchebn, Zaved., Povolzhskii Region, Fiz.-Mat. Nauki, No. 4, 3–13 (2011).

T. Insperger and G. Stepan, “Brockett problem for systems with feedback delay,” in Proc. 17th World Congr. of the Int. Fed. of Aut. Control (IFAC), Seoul, July 6–11, 2008 , pp. 11491–11496.

Article   Google Scholar  

V. I. Zubov, Theory of Optimal Control (Sudostroenie, Leningrad, 1966) [in Russian].

W. M. Wonham, “On pole assignment in multi-input controllable linear systems,” IEEE Trans. Autom. Control 12 , 660–665 (1967).

M. L. J. Hautus, “Controllability and observability conditions of linear autonomous systems,” Nedert. Acad. Wetensch. Proc. Ser. A 72 , 443–448 (1969).

MathSciNet   MATH   Google Scholar  

T. Kailath, Linear Systems (Prentice-Hall, Englewood Cliffs, NJ, 1980).

R. E. Kalman, “Contribution to the theory of optimal theory,” Bol. Soc. Mat. Mexicana 5 , 102–119 (1960).

H. Kwakernaak and R. Sivan, Linear Optimal Control (Wiley, New York, 1972).

P. A. Kuzmin, Small Oscillations and Stability of Motion (Nauka, Moscow, 1973) [in Russian].

U. Helmke and B. Anderson, “Hermitian pencils and output feedback stabilization of scalar systems,” Int. J. Control 56 , 857–876 (1992).

F. Perez, C. Abdallah, P. Dorato, and D. Docambo, “Algebraic tests for output stabilizability,” in Proc. 32nd IEEE Conf. on Decision and Control, San Antonio, TX, Dec. 15–17, 1993 (IEEE, New York, 1993), pp. 2385–2386.

V. Kucera and C. Souza, “A necessary and sufficient condition for output feedback stabilizability,” Automatica 31 , 1357–1359 (1995).

V. A. Yakubovich, G. A. Leonov, and A. Kh. Gelig, Stability of Stationary Sets in Control Systems with Discontinuous Nonlinearities (Nauka, Moscow, 1978; World Sci., Singapore, 2004).

A. Trofino-Neto and V. Kucera, “Stabilization via static output feedback,” IEEE Trans. Autom. Control 38 , 764–765 (1993).

Y. Y. Cao, Y.-X. Sun, and W.-J. Mao, “A new necessary and sufficient condition for static output feedback stabilizability and comments on "Stabilization via static output feedback”,” IEEE Trans. Autom. Control 43 , 1110–1112 (1998).

T. Iwasaki and R. Skelton, “Parametrization of all stabilizing controllers via quadratic Lyapunov functions,” J. Optim. Theory Appl. 77 , 291–307 (1995).

L. El-Chaoui and P. Gahinet, “Rank minimization under LMI constraints: A framework for output feedback problems,” in Proc. Eur. Control Conf., Groningen, 1993 , pp. 1176–1179.

E. Davison, “An automatic way of finding optional control systems for large multi-variable plants,” in Proc. IFAC Tokyo Symp. Control 1965 , pp. 357–373.

B. Anderson, N. Bose, and E. Jury, “Output feedback stabilization and related problems — Solution via decision methods,” IEEE Trans. Autom. Control 20 , 53–65 (1975).

B. D. O. Anderson and J. C. Clements, “Algebraic characterization of fixed modes in decentralized control,” Automatica 17 , 703–712 (1981).

C. I. Byrnes and B. D. O. Anderson, “Output feedback and generic stabilizability,” SIAM J. Control Optim. 11 , 362–380 (1984).

B. D. O. Anderson and R. W. Scott, “Output feedback stabilization — Solution by algebraic geometry methods,” Proc. IEEE 65 , 849–861 (1977).

J.-W. Wu, K.-Y. Lian, and P. Lancaster, “A stabilization criterion for matrices,” Linear Algebra Appl. 422 , 22–28 (2007).

H. Crauel, T. Damm, and A. Ilchmann, “Stabilization of linear systems by rotation,” J. Differ. Equations 234 , 412–438 (2007).

S. M. Meerkov, “Vibrational control,” Autom. Remote Control 34 , 201–209 (1973).

S. M. Meerkov, “Vibrational control theory,” J. Franklin Inst. 3 , 117–128 (1977).

E. Tamaseviciute and A. Tamasevicius, “Stabilizing uncertain steady states of some dynamical systems by means of proportional feedback,” Nonlinear Anal.: Model. Control 18 , 86–98 (2013).

V. Blondel, Simultaneous Stabilization of Linear Systems (Springer-Verlag, London, 1994).

Book   MATH   Google Scholar  

C. Nett, D. Bernstein, and W. Haddad, “Minimal complexity control law synthesis. Pt. 1: Problem formulation and reduction to optimal static output feedback,” in Proc. Am. Control Conf. (ACC), Pittsburg, PA, June 21–23, 1989 (IEEE, Piscataway, NJ), pp. 2056–2064 (1989).

B. Martensson, “The order of any stabilizing regulator is sufficient a priori information for adaptive stabilization,” Syst. Control Lett. 6 , 87–91 (1985).

V. I. Arnol’d, Ordinary Differential Equations , 3rd ed. (Nauka, Moscow, 1971; Springer-Verlag, 1991).

A. Stephenson, “A new type of dynamical stability,” Mem. Proc. Manchr. Cit. Phil. Soc. 52 , 1907–1908 (1908).

P. L. Kapitsa, “Dynamical stability of pendulum under oscillating suspension point,” Zh. Eksp. Teor. Fiz. 21 , 588–598 (1951).

A. G. Leonov and M. M. Shumafov, Methods of Stabilization of Linear Controllable Systems (S.-Peterb. Gos. Univ., St. Petersburg, 2005) [in Russian].

R. E. Kalman, P. L. Falb, and M. A. Arbib, Topics in Mathematical System Theory (McGraw Hill, New York, 1969; Mir, Moscow, 1971).

J. Rissanen, “Control system synthesis by analogue computer based on the "generalized linear feedback control” concept,” in Proc. Int. Seminar Analogue Computation Applied to the Study of Chemical Processes, Brussels, Nov. 21–23, 1960 (Gordon & Breach, New York, 1961), pp. 1–13.

H. H. Rosenbrock, “Distinctive processes in process control,” Chem. End. Prog. 58 , 43–50 (1962).

R. E. Kalman, “Ljapunov Functions for the problem of Lur’e in Automatic Control,” in Proc. Natl. Acad. Sci. U. S. A. 49 , 201–205 (1963).

V. M. Popov, “Hyperstability and optimality of automatic systems with several control functions,” Rev. Roum. Sci. Tech. Ser. Electrotech. Energ. 9 , 629–690 (1964).

C. E. Langenhop, “On the stabilization of linear systems,” in Proc. Am. Math. Soc. 15 , 735–742 (1964).

J. D. Simon and S. K. Mitter, “A theory of modal control,” Inf. Control 13 , 316–353 (1968).

P. Brunovsky, “A classification of linear controllable systems,” Kybernetika 6 , 173–187 (1970).

C. T. Chen, “A note on pole assignment,” IEEE Trans. Autom. Control 12 , 597–598 (1968).

E. J. Davison, “On pole assignment in multivariable linear systems,” IEEE Trans. Autom. Control 13 , 747–748 (1968).

M. Heymann, “Comments "On pole assignment in multi-input controllable linear systems”,” IEEE Trans. Autom. Control 13 , 748–749 (1968).

Article   MathSciNet   Google Scholar  

Yu. N. Andreev, Control of Finite-Dimensional Linear Objects (Nauka, Moscow, 1976) [in Russian].

W. M. Wonham, Linear Multivariable Control: A Geometric Approach (Springer-Verlag, New York, 1979).

E. Ya. Smirnov, The Stabilization of Program Motions (S.-Peterb. Gos. Univ., St. Petersburg, 1977) [in Russian].

G. S. Aksenov, “On the problem of stabilization of the linear object of control,” Vestn. Leningr. Gos. Univ., No. 7, 5–8 (1977).

G. A. Leonov and M. M. Shumafov, “Elementary proof of the theorem on stabilizability of linear controllable systems,” Vestn. S.-Peterb. Univ., Ser. 1: Mat., Mekh., Astron., No. 3, 56–68 (2003).

G. A. Leonov and M. M. Shumafov, “Algorithm of step-by-step stabilization of linear object of control,” Izvest. Vyssh. Uchebn. Zaved. Sev.-Kavk. Reg. Estestv. Nauki, No. 2 , 14–19 (2005).

R. T. Kabamba, S. M. Meerkov, and E. K. Roh, “Pole placement capabilities of vibrational control,” IEEE Trans. Autom. Control 43 , 1256–1261 (1998).

E. J. Davison, “On pole assignment in linear systems with incomplete state feedback,” IEEE Trans. Autom. Control 15 , 348–351 (1970).

E. J. Davison and R. Chatterjee, “A note on pole assignment in linear systems with incomplete state feedback,” IEEE Trans. Autom. Control 16 , 98–99 (1971).

E. J. Davison, “An algorithm for the assignment of closed-loop poles using output feedback in large multivariable systems,” IEEE Trans. Autom. Control 18 , 74–75 (1973).

B. Sridhar and D. P. Lindorff, “Pole placement with constant gain output feedback,” Int. J. Control 18 , 993–1003 (1973).

A. Jameson, “Design of a single-input system for specified roots using output feedback,” IEEE Trans. Autom. Control 15 , 345–348 (1970).

A. K. Nandi and J. H. Herzog, “Comments on design of a single-input system for specified roots using output feedback,” IEEE Trans. Autom. Control 16 , 384–385 (1971).

E. J. Davison and S. H. Wang, “On pole assignment in linear multivariable systems using output feedback,” IEEE Trans. Autom. Control 20 , 516–518 (1975).

H. Kimura, “On pole assignment by output feedback,” Int. J. Control 28 , 11–22 (1978).

R. Brockett and C. Byrnes, “Multivariable Nyquist criteria, root loci, and pole placement: A geometric viewpoint,” IEEE Trans. Autom. Control 26 , 271–284 (1981).

J. Schumacher, “Compensator synthesis using (C,A,B)-pairs,” IEEE Trans. Autom. Control 25 , 1133–1138 (1980).

X. Wang, “Pole placement by static output feedback,” Math. Syst., Estim. Control 2 , 205–218 (1992).

J. Leventides and N. Karcanias, Arbitrary Pole Placement via Low Order Dynamic Output Feedback Controllers: A Solution in Closed Form , Technical Report CEC/EL-NK/135 (City University, London, 1995).

J. Rosenthal, J. M. Schumacher, and J. C. Willems, “Generic eigenvalue assignment by memoryless real output feedback,” Syst. Control Lett. 26 , 253–260 (1995).

J. C. Willems, “Generic eigenvalue assignability by real memoryless output feedback made simple,” in Communications, Computation, Control and Signal Processing (Springer-Verlag, New York, 1997), pp. 343–354.

G. A. Leonov and M. M. Shumafov, Stabilization of Linear Systems (Cambridge Sci. Publ., Cambridge, 2012).

R. Hermann and C. Martin, “Applications of algebraic geometry to systems theory: Part 1,” IEEE Trans. Autom. Control 22 , 19–25 (1977).

J. C. Willems and W. H. Hesselink, “Generic properties of the pole placement problem,” in Proc. 7th IFAC Congr., Helsinki, Finland, June 12–16, 1978 (Pergamon, Oxford, 1979), pp. 1725–1729.

A. N. Andry, E. Y. Shapiro, and J. C. Chung, “Eigenstructure assignment for linear systems,” IEEE Trans. Aerosp. Electron. Syst. 19 , 711–728 (1983).

H. H. Rosenbrock, State Space and Multivariable Theory (Wiley, New York, 1970).

R. E. Kalman, “Kronecker invariants and feedback,” in Ordinary Differential Equations , Ed. by L. Weiss (Academic, New York, 1972), pp. 452–471.

B. C. Moore, “On the flexibility offered by state feedback in multivariable systems beyond closed loop eigenvalue assignment,” IEEE Trans. Autom. Control 21 , 689–692 (1976).

S. Srinathkumar, Eigenvalues/Eigenvector Assignment Using Outback Feedback (NASA, 1978).

J. Kautsky, N. K. Nichols, and P. Van Dooren, “Robust pole assignment in linear state feedback,” J. Control 41 , 1129–1155 (1985).

V. A. Zaitsev, “Modal control of the linear differential equation with incomplete feedback,” Differ. Uravnen. 39 , 133–135 (2003).

V. A. Zaitsev, “On controlling the spectrum and stabilization of bilinear,” Vestn. Udmurt. Univ., Mat., Mekh., Comput. Nauki 2 , 49–51 (2008).

V. A. Zaytsev, “Spectrum control in linear systems with incomplete feedback,” Differ. Uravn. 45 , 1320–1328 (2009).

V. A. Zaitsev, “The spectrum control in bilinear systems,” Differ. Uravn. 46 , 1061–1064 (2010).

V. A. Zaitsev, “Necessary and sufficient conditions of the spectrum control problem,” Differ. Uravn. 46 , 1789–1793 (2010).

K. Yang and R. Orsi, “Generalized pole placement via based on projections,” Automatica 42 , 2143–2150 (2006).

M. Sh. Misrikhanov and V. N. Ryabchenko, “Pole placement for controlling a large scale power system,” Autom. Remote Control 72 , 2123–2146 (2011).

R. Schmid, L. Ntogramatzidis, T. Ngyen, and A. Pandey, “A unified method for optimal arbitrary placement,” Automatica 50 , 2150–2154 (2014).

N. E. Zubov, E. A. Mikrin, M. Sh. Misrikhanov, and V. N. Ryabchenko, “Controlling the finite eigenvalues of the descriptor system,” Dokl. Akad. Nauk 460 , 381–384 (2015).

F. R. Gantmakher, Matrix Theory (Nauka, Moscow, 1962; Chelsea, New York, 1959).

V. Ye. Belozyorov, “New solution method of linear static output feedback design problem for linear control systems,” Linear Algebra Appl. 54 , 204–227 (2016).

M. E. Mostafa El-Sayed, M. A. Tawhid, and E. R. Elwan, “Nonlinear conjugate gradient methods for the output feedback pole assignment problem,” Pac. J. Optim. 12 , 55–85 (2016).

A. G. Yannakoudacis, “The static output feedback from the invariant point of view,” IMA J. Math. Control Inf. 33 , 639–669 (2016).

V. A. Zaitsev and I. G. Kim, “Pole assignment a finite spectrum in linear systems with delay in state by static feedback,” Vestn. Udmurt. Univ., Mat., Mekh., Comput. Nauki 26 , 463–473 (2016).

V. A. Zaitsev and I. G. Kim, “Pole assignment an arbitrary spectrum in linear stationary systems with commensurable delays in state by static feedback,” Vestn. Udmurt. Univ., Mat., Mekh., Comput. Nauki 27 , 315–325 (2017).

G. A. Leonov, M. M. Shumafov, and N. V. Kuznetsov, “A short survey of delayed feedback stabilization,” in 1st IFAC Conf. on Modeling, Identification and Control of Nonlinear Systems, St. Petersburg, June 24–26, 2015 (Curran, Red Hook, New York, 2016), pp. 716–719.

K. Pyragas, “Continuous control of chaos by self-controlling feedback,” Phys. Lett. A 170 , 421–428 (1992).

Download references

Author information

Authors and affiliations.

Adyghe State University, 385000, Maykop, Russia

M. M. Shumafov

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to M. M. Shumafov .

Additional information

Translated by E. Oborin

About this article

Shumafov, M.M. Stabilization of Linear Control Systems and Pole Assignment Problem: A Survey. Vestnik St.Petersb. Univ.Math. 52 , 349–367 (2019). https://doi.org/10.1134/S1063454119040095

Download citation

Received : 09 May 2019

Revised : 13 June 2019

Accepted : 13 June 2019

Published : 23 December 2019

Issue Date : October 2019

DOI : https://doi.org/10.1134/S1063454119040095

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • linear control system
  • unstable system
  • stabilization
  • asymptotic stability
  • pole assignment
  • static output feedback
  • Brockett’s problem.
  • Find a journal
  • Publish with us
  • Track your research

Eindhoven University of Technology research portal Logo

  • Help & FAQ

Pole assignment : a new proof and algorithms

  • Mathematics and Computer Science

Research output : Book/Report › Report › Academic

Original languageEnglish
Place of PublicationEindhoven
Publisher
Number of pages24
Publication statusPublished - 1981

Publication series

NameMemorandum COSOR
Volume8110
ISSN (Print)0926-4493

Access to Document

  • 339661 Final published version, 534 KB

Fingerprint

  • Matrix Mathematics 100%
  • Unitary Matrix Mathematics 100%
  • Structural Property Mathematics 100%
  • Canonical Form Mathematics 100%
  • Input Case Engineering 100%
  • Theorem Earth and Planetary Sciences 100%

T1 - Pole assignment : a new proof and algorithms

AU - Eising, R.

N2 - In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. It is not based on canonical forms and also the reduction to the single input case (Heymann's Lemma) is not used. Furthermore, an algorithm is given which is based on structural properties and also an algorithm is presented which allows to take into account numerical aspects. This latter algorithm uses only unitary matrices as transforming matrices preceding the pole assignment.

AB - In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. It is not based on canonical forms and also the reduction to the single input case (Heymann's Lemma) is not used. Furthermore, an algorithm is given which is based on structural properties and also an algorithm is presented which allows to take into account numerical aspects. This latter algorithm uses only unitary matrices as transforming matrices preceding the pole assignment.

M3 - Report

T3 - Memorandum COSOR

BT - Pole assignment : a new proof and algorithms

PB - Technische Hogeschool Eindhoven

CY - Eindhoven

COMMENTS

  1. PDF POLE ASSIGNMENT FOR LINEAR SYSTEMS

    The pole assignment problem for a single-input controllable system is relatively straightforward to solve. The pole assignment problem for multivariable systems, to be presented in the next section, is considerably ... Theorem 3.1: Let (A,B) be controllable, and let b1,...,bm be the columns of the B matrix. For each i

  2. PDF Pole assignment : a new proof and algorithms

    Proofs of the pole assignment theorem are mostly based on Heymann's Lemma [3], thereby reducing the mUlti-input case to the single input case. Then some canonical form for the single input case is used in order to be able to specify the feedback matrix which assigns the poles of a system as specified beforehand.

  3. Pole assignment problem

    R. Bumby, E.D. Soutrey, H.J. Sussmann, W. Vasconcelos, "Remarks on the pole-shifting theorem over rings" J. Pure Appl. Algebra, 20 (1981) pp. 113-127 [a4] A. Tannenbaum, "Polynomial rings over arbitrary fields in two or more variables are not pole assignable" Syst. Control Lett. , 2 (1982) pp. 222-224

  4. PDF Observability, Observers and Feedback Compensators

    In Chapter 3, we have studied the design of state feedback laws using pole assignment. Such control laws require the state to be measured. For many systems, we may only get partial information about the state ... pole assignment problem. Theorem 4.4: There exists an n×p matrix L such that det(sI −A+LC) = r(s), where r(s) is any nth

  5. linear algebra

    The pole assignment problem has a solution i.e. given a target pole set P P, there exists a matrix F ∈Rm×n F ∈ R m × n such that. λ(A + BF) = P λ (A + B F) = P. if and only if all uncontrollable poles of A A are in the target pole set P P. by real Schur decomposition, we can choose an orthogonal matrix Q Q such that.

  6. PDF Pole assignment for systems over rings

    Pole assignment theorem, Systems over a principal ideal domain, Pole assignment algorithm. In [2] Morse gave a proof of the pole assignment theorem for systems over the ring •[z] (the ring of polynomials in the variable z with coefficients in the field of real numbers). In [3] Sontag observed that the proof by Morse in fact proved in the pole ...

  7. Pole assignment via Sylvester's equation

    It is shown that the pole assignment problem can be reduced to solving the linear matrix equations AX − XA = −BG, FX = G successively for X, and then F for almost any choice of G.The result is a new pole assignment procedure and proof of the pole assignment theorem that should play an important role in both theoretical and practical applications.

  8. Pole assignment, a new proof and algorithm

    - 2 - I. Introduction and preliminaries Proofs of the pole assignment theorem are mostly based on Heymann's Lemma [3], thereby reducing the mUlti-input case to the single input case. Then some canonical form for the single input case is used in order to be able to specify the feedback matrix which assigns the poles of a system as specified ...

  9. PDF Pole assignment for systems over rings

    In [2J Morse gave a proof of the pole assignment theorem for systems over the ring JR[zJ (the ring of polynomials in the variable z with coefficients in the field of real numbers). In [3J Sontag observed that the proof by Morse in fact proved the pole assignment theorem for systems over a prin-cipal ideal domain.

  10. A note on pole assignment in linear systems with incomplete state

    Abstract: A theorem recently proposed by Davison [1] on pole assignment with incomplete state feedback is extended to noncyclic matrices by using the results of Brasch and Pearson [2]. It is shown that the number of poles that can be arbitrarily assigned is equal to the maximum of the number of nontrivial inputs or outputs.

  11. (PDF) A Note On Pole Assignment

    This note gives an alternate proof of Davison's theorem [2] on pole placement and further shows that, for a controllable, observable system dot {x} = hat {A}x + hat {B}u, y = hat {C}x , the number ...

  12. Pole assignment, a new proof and algorithm

    Number I SYSTEMS & CONTROL LEITERS July 1982 Pole assignment, a new proof and algorithm Received 18 March 1982 In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. II is not based on canonical forms and also rhe reduction IO the single input case (Heymann lemma) is not used.

  13. A note on pole assignment

    Abstract: This note gives an alternate proof of Davison's theorem [2] on pole placement and further shows that, for a controllable, observable system \dot{x} = \hat{A}x + \hat{B}u, y = \hat{C}x, the number of poles that can be assigned arbitrarily are equal to max ( m,p), where m Rank \hat{B} and p = Rank \hat{C}.In some cases, more than max ( m,p) poles can be assigned arbitrarily.

  14. POLE ASSIGNMENT VIA SYLVESTER EQUATION

    It is shown that the pole assignment problem can be reduced to solving the linear matrix equations AX - XA = -BG, FX = G successively for X, and then F for almost any choice of G. The result is a new pole assignment procedure and proof of the pole assignment theorem that should play an important role in both theoretical and practical ...

  15. (PDF) Pole assignment for systems over rings

    Pole assignment theorem, Systems over a principal ideal domain, Pole assignment algorithm. In [2] Morse gave a proof of the pole assignment theorem for systems over the ring •[z] (the ring of polynomials in the variable z with coefficients in the field of real numbers). In [3] Sontag observed that the proof by Morse in fact proved in the pole ...

  16. Pole assignment for systems over rings

    Pole assignment theorem, Systems over a principal ideal domain, Pole assignment algorithm. In [2] Morse gave a proof of the pole assignment theorem for systems over the ring [z] (the ring of polynomials in the variable z with coefficients in the field of real numbers). In [3] Sontag observed that the proof by Morse in fact proved in the pole ...

  17. Pole assignment and a theorem from exterior algebra

    Pole assignment and a theorem from exterior algebra. Abstract: This paper presents an extension of a basic decomposition result from the exterior algebra of F-vector spaces to that of free F [s]-modules and explains its relevance to certain pole assignment problems associated with minimal design. Published in: 1977 IEEE Conference on Decision ...

  18. Stabilization of Linear Control Systems and Pole Assignment ...

    The pole assignment problem and the related issues for linear systems are considered. This paper reviews the problems of stabilization and pole assignment in the control of linear time-invariant systems using the static state and output feed. ... Then, if the conditions of Theorem 8 are fulfilled for some numberS 0 ≠ K j ...

  19. Pole assignment via Sylvester's equation

    It is shown that the pole assignment problem can be reduced to solving the linear matrix equations AX − XA = −BG, FX = G successively for X, and then F for almost any choice of G.The result is a new pole assignment procedure and proof of the pole assignment theorem that should play an important role in both theoretical and practical applications.

  20. On pole assignment problems in polynomial rings

    The main result is called the pole assignment theorem which gave rise to different refinements and discussions Heymann (1979); Sharma (1984). A particular pole assignment in linear multivariable systems consists in shifting only the real part of the open-loop eigenvalues in continuous time domain or in applying a homothetic rate on them in ...

  21. Pole assignment, a new proof and algorithm

    In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. It is not based on canonical forms and also the reduction to the single input case (Heymann's lemma) is not used. Furthermore, an algorithm is given which allows to take into account numerical aspects with respect to the feedback ...

  22. Pole assignment : a new proof and algorithms

    T1 - Pole assignment : a new proof and algorithms. AU - Eising, R. PY - 1981. Y1 - 1981. N2 - In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. It is not based on canonical forms and also the reduction to the single input case (Heymann's Lemma) is not used.

  23. A parametric poles assignment algorithm for high-order linear discrete

    The periodic state feedback pole assignment problem of high-order periodic discrete systems is investigated, and the pole assignment problem for such systems is transformed into a class of problems for resolving periodic Sylvester matrix equations with constraints. ... According to Propositions 1 and Theorem 1, the pole assignment issue is ...