Abstract
In the previous chapters, control systems with discretized nonlinear characteristics were considered. However, the problems of these nonlinear control systems are generally difficult to analyze. In this chapter, the case where a nonlinear characteristic can be treated as a set of linear characteristics (in other words, interval parameters) is considered. This concept is based on the validity of Aizerman’s conjecture. It is assumed that the transfer function (and the characteristic polynomial) is expressed by interval parameters. The control performance of these interval systems is discussed from the viewpoint of the roots area of a characteristic polynomial. The robust stability condition for discrete interval systems is derived using Sturm’s theorem (the division algorithm), which has been applied to the Routh-Hurwitz criterion.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Basically, the concept of an interval parameter is not different from that of a sector for a nonlinear characteristic.
- 2.
See Appendix A.
- 3.
Note that the symbol γ is used differently from the resolution value in Chap. 2.
- 4.
First, it is assumed that variable x and the value of f (i.e., coefficients a i of the polynomial) are real.
- 5.
The discrimination of the number of roots in a specified area is equivalent to the Routh-Hurwitz criterion.
References
Ackermann J (1993) Robust control systems with uncertain physical parameters. Springer, Berlin
Barmish BR (1994) New tools for robustness of linear systems. Macmillan, New York
Barmish BR, Kang H (1993) A survey of extreme points results of robust control systems. Automatica, 13–15
Bartlett AC, Hollot CV, Huang L (1988) Root location of an entire polytope of polynomials: it suffices to check the edges. Math Control Signals Syst 1:61–71
Bhattacharyya SP, Chapellat H, Keel LH (1996) Robust control, the parametric approach. Prentice-Hall, New York
Cohn PM (2003) Basic algebra: group, rings and fields. Springer, Berlin
Kharitonov VL (1979) Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differ Equ 14:1483–1485
Okuyama Y (1988) Sensitivity and robust stability of control systems with uncertainties: a graphical approach. Trans IEEJ 108-C:371–378 (in Japanese)
Okuyama Y, Takemori F (2000) Evaluation of robust performance for interval systems based on characteristic roots area. In: Kucera V, Sebek M (eds) Robust control design 2000. Pergamon Press, Oxford, pp 101–106
Okuyama Y, Takemori F (2002) A discrimination method of roots area for polytopic polynomials. In: Proc of the 15th IFAC world congress, T-Th-A21, Barcelona, Spain
Okuyama Y, Takemori F, Chen H (1998) On the Sturm theorem for interval polynomials. In: Proc of the American control conference, Philadelphia, PA, USA, pp 1883–1885
Okuyama Y, Takemori F, Chen H (1999) Discriminance of characteristic roots area for interval systems. In: Proc of the 14th IFAC world congress, vol G. Pergamon Press, Oxford, pp 13–18
Rahman QI, Schmeisser G (2002) Analytic theory of polynomials. Clarendon Press, Oxford
Soh YC, Evans RJ, Petersen IR, Betz RE (1997) Robust pole placement. Automatica 27:711–715
Takagi T (1948) Lecture notes in algebra (Daisugaku Kougi). Kyoritsu Shuppan, Tokyo (in Japanese)
Turnbull HW (1947) Theory of equations. Oliver and Boyd, Edinburgh
Author information
Authors and Affiliations
Appendices
Appendix A: Kharitonov Rectangles
With respect to continuous-time systems, consider the following characteristic polynomials [7]:
Considering the imaginary axis, i.e., s=jω, Eq. (6.64) can be given as
When n is odd,
On the other hand, when n is even,
For a third-order system, (6.65) can be written directly as follows:
Therefore,
When considering ω>0, the following vertices are obtained:
Of course, when ω<0, the following vertices are obtained:
although they are conjugated with each other.
Example 6.5
Consider the following (monic) interval polynomial (the highest coefficient a 0=1):
Obviously, when ω>0,
And, when ω<0,
Figure 6.15(a) shows the trace of Kharitonov rectangles when ω: −ω c →ω c . From the figure, one can see that the stability of the interval system is determined by only the four vertices of the rectangular array. The robust stability condition is necessary and sufficient for interval (uncertain) systems. In this example, a view of the root areas is shown in Fig. 6.15(b).
Appendix B: Roots of Polynomials and Sturm’s Theorem
The basic concept of Sturm’s theorem is given as follows [6, 13]. Let f(x) be a “real” polynomial.Footnote 4 Denote it by f 0(x) and its derivative f′(x) by f 1(x). Applying Euclid’s division algorithm, the following sequence is obtained:
where f i (x) is of degree lower than that of f i−1(x) for 1≤i≤n. The signs of the remainders are negated from those in the algorithm. Note that the divisor f k that yields a zero remainder is the greatest common divisor of f(x) and f′(x). The sequence f 0,f 1,⋯,f n is called a Sturm sequence for the polynomial f.
Sturm’s Theorem
The number of distinct (simple) zeros of a polynomial f(x) in x∈(x 1,x 2) is equal to the excess of the number of changes of sign in the sequence f 0(x 1), ⋯, f n−1(x 1), f n (x 1) over the number of changes of sign in the sequence f 0(x 2), ⋯, f n−1(x 2), f n (x 2).
In other expressions, if the number of sign changes that cross the zero of f 0(x)/f 1(x) for x:x 1→x 2 is defined as N(x 1,x 2) and the number of sign changes of sequence f 0(x 2), ⋯, f n−1(x 2), f n (x 2) is defined as V(x), we obtain the relationship
Here, f(x) can be multiplied by a positive constant or a factor involving x provided that the factor remains positive in x∈(x 1,x 2). Moreover, there is no common divisor between f 0(x) and f 1(x), because the zeros of f(x) are distinct.
Example 6.6
(Real Roots)
Consider the following polynomial to apply Sturm’s theorem [16]:
The first step polynomials f 0 and f 1 are given as:
Therefore, the results of the division algorithm are obtained as follows:
Table 6.1 lists the signs of each Sturm sequence, and the number of sign changes is given in Table 6.2. From these tables, we obtain, for example,
This result is clear from Fig. 6.16.
Complex Roots Problem
The Sturm sequence can be extended to a complex roots problem. Consider the following circle as a closed contour in the complex plane:
where ϱ, (x 0,y 0), and ϕ are the radius, the center, and the angle of rotation of a specified circle, respectively. The problem of a sectorial area in the complex plane can be considered in a large circle ∂Γ, as shown in Fig. 6.3(a).Footnote 5
Figures 6.17(a), (b) show examples of the circular contour in a complex plane. The circular contour (6.36) can also be written as the following rational function:
where
and A and B are complex constants written as A=ϱ+x 0+jy 0 and B=y 0+j(ϱ−x 0). Clearly, the relationship between variables ϕ and v is
Consider the following characteristic polynomial in general:
If (6.69) is substituted into (6.71), a numerator polynomial with complex coefficients is obtained:
Here, polynomials P(v) and Q(v) can be written as
Therefore, argument change 2μπ for polynomial F(z) becomes (2μ−n)π for Φ(jv) by adding change −nπ in the argument of (1−jv)n. When P/Q (or −Q/P) is considered, the number of sign changes that cross zero for v:−∞→+∞ is n−2μ.
The coefficients in (6.73) are calculated by
from (6.69). This equation is expanded as
and thus we can obtain
where
denotes a combination symbol.
By setting f 0(v)=P(v) and f 1(v)=Q(v), the following division algorithm can be executed:
If f 0(v) and f 1(v) are of the n-th order for v, then f 2(v),f 3(v),⋯,f 2n are expressed as:
Here, each coefficient can be given by the following sequential operations:
If the number of sign changes which cross the zero of f 0(v)/f 1(v) for v:v 1→v 2 is expressed as N(v 1,v 2) and the number of sign changes of sequence f 0(v),f 1(v),⋯,f 2n is expressed as V(v), the following relationship is obtained:
Since the condition is N(−∞,+∞)=n−2μ,
is obtainable.
On the other hand, the following expressions are derived from (6.76):
The condition of (6.78) corresponds to observing whether the following ratios (ratios to the polynomial of different orders) are negative or not:
because ratios to the polynomial of same order (i.e., \(\frac{a_{0,0}}{b_{0,0}}, \frac{a_{1,1}}{b_{1,1}},\ldots\)) are canceled based on (6.79). Suppose that the number of negative ratios is N and the number of positive ratios is P. Thus, P−N=n−2μ can be obtained from (6.79). Since P+N=n, N=μ is given.
Example 6.7
(Quadratic Equation)
As a simple example, consider the following quadratic polynomial:
First, a specified circle is assumed to be x 0=−0.5, y 0=0.1, and ϱ=1.5, as shown in Fig. 6.17(a). Then, numerator polynomials P(v) and Q(v) written as
are given as
By setting f 0(v)=P(v), f 1(v)=Q(v), the following results are obtained from (6.76):
Since the sequence of fractions, (6.81), is given as
the number of roots in the specified circle is μ=2.
The discriminating procedure given above can be interpreted as follows. The specified contour encircles two roots of the quadratic equation. As a result, the mapping curve is as shown in Fig. 6.18(a). Thus, the argument change of Φ(jv) becomes 4π−2π=2π by adding a change of −2π to the argument of (1−jv)2. Figure 6.18(b) shows the Φ curve for this case.
On the other hand, when a circle is chosen as x 0=−0.5, y 0=0.8, and ϱ=0.4, as shown in Fig. 6.17(b), numerator polynomials P(v) and Q(v) are given by
The Sturm sequence is given as
Since the sequence of fractions, (6.81), is given as
the number of roots in the specified circle is μ=1.
Example 6.8
(Cubic Equation)
Consider the following cubic polynomial:
A specified circle is chosen as x 0=−0.5, y 0=0.1, and ϱ=1.5. Then, numerator polynomials P(v) and Q(v) written as
are given as
By setting f 0(v)=P(v), f 1(v)=Q(v), the following results are obtained from (6.76):
Since the sequence of fractions, (6.81), is given as
the number of roots in the specified circle is μ=3.
Routh-Hurwitz Criterion
Finally, the relationship between the above results based on Sturm’s theorem and the classical Routh-Hurwitz criterion is presented. In general, a characteristic equation for continuous-time systems is written as
where s is the Laplace transform variable and a i (i=1,2,⋯,n) are real coefficients. The stability of a control system having characteristic equation (6.88) is discriminated by a contour on the imaginary axis and a large half-contour in the right half-plane (RHP) or left half-plane (LHP) and its mapping in the F-plane.
On the imaginary axis s=jω (ω:−∞→∞),
The real and imaginary parts of (6.89) are given as follows.
-
(1)
When n=1,5,9,⋯,
$$\begin{aligned} &P^{(1)}(\omega)=a_1\omega^{n-1}-a_3\omega^{n-3}+a_5\omega^{n-5}-\cdots,\\ &Q^{(1)}(\omega)=a_0\omega^{n}-a_2\omega^{n-2}+a_4\omega^{n-4}-\cdots. \end{aligned}$$ -
(2)
When n=2,6,10,⋯,
$$\begin{aligned} &P^{(2)}(\omega)=-a_0\omega^{n}+a_2\omega^{n-2}-a_4\omega^{n-4}+\cdots,\\ &Q^{(2)}(\omega)=a_1\omega^{n-1}-a_3\omega^{n-3}+a_5\omega^{n-5}-\cdots. \end{aligned}$$ -
(3)
When n=3,7,11,⋯,
$$\begin{aligned} &P^{(3)}(\omega)=-a_1\omega^{n-1}+a_3\omega^{n-3}-a_5\omega^{n-5}+\cdots,\\ &Q^{(3)}(\omega)=-a_0\omega^{n}+a_2\omega^{n-2}-a_4\omega^{n-4}+\cdots. \end{aligned}$$ -
(4)
When n=4,8,12,⋯,
$$\begin{aligned} &P^{(4)}(\omega)=a_0\omega^{n}-a_2\omega^{n-2}+a_4\omega^{n-4}-\cdots,\\ &Q^{(4)}(\omega)=-a_1\omega^{n-1}+a_3\omega^{n-3}-a_5\omega^{n-5}+\cdots. \end{aligned}$$
If the following polynomials are considered:
the four cases of polynomials obviously become
Based on the above premise, the following division algorithm is executed:
Then, f 2(ω),f 3(ω),⋯,f n are obtained as follows:
For an easier understanding, polynomials f 0(ω) and f 1(ω) are also written in (6.92). Here, a 0,0=a 0, a 0,2=−a 2, a 0,4=a 4, ⋯ and a 1,1=a 1, a 1,3=−a 3, a 1,5=a 5, ⋯. Moreover, each coefficient can be given by the following sequential operations:
In regard to the four cases, the following Sturm sequences are obtained.
-
(1)
In this case, f 0(ω)/f 1(ω)=Q (1)(ω)/P (1)(ω) should be calculated (when considering a large contour in the RHP). Since a 0,0=a 0, a 0,2=−a 2, a 0,4=a 4,⋯, a 1,1=a 1, a 1,3=−a 3, a 1,5=a 5,⋯, the following coefficients (Routh’s series) are obtained:
$$\begin{aligned} &a_{2,2}=-a_3\left(\frac{a_0}{a_1}\right)+a_2,~~~ a_{2,4}=a_5\left(\frac{a_0}{a_1}\right)-a_4,~~~ ~~\cdots\\ &a_{3,3}=a_{2,4}\left(\frac{a_1}{a_{2,2}}\right)+a_3,~~~ a_{3,5}=a_{2,6}\left(\frac{a_1}{a_{2,2}}\right)-a_5,~~~\cdots\\ &a_{4,4}=a_{3,5}\left(\frac{a_{2,2}}{a_{3,3}}\right)-a_{2,4}\\ &~~~~~\cdots. \end{aligned}$$ -
(2)
In this case, f 0(ω)/f 1(ω)=−P (2)(ω)/Q (2)(ω) is assumed to be calculated (when considering a large contour in the RHP). Since a 0,0=−a 0, a 0,2=a 2, a 0,4=−a 4,⋯, a 1,1=a 1, a 1,3=−a 3, a 1,5=a 5,⋯, the following series are obtained:
$$\begin{aligned} &a_{2,2}=-a_3\left(\frac{a_0}{a_1}\right)+a_2,~~~~ a_{2,4}=a_5\left(\frac{a_0}{a_1}\right)-a_4,~~~ ~~\cdots\\ &a_{3,3}=a_{2,4}\left(\frac{a_1}{a_{2,2}}\right)+a_3,~~~ a_{3,5}=a_{2,6}\left(\frac{a_1}{a_{2,2}}\right)-a_5,~~~\cdots\\ &a_{4,4}=a_{3,5}\left(\frac{a_{2,2}}{a_{3,3}}\right)-a_{2,4}\\ &~~~~~\cdots. \end{aligned}$$In either case (1) or (2), the top of Routh’s series can be written as
$$\begin{aligned} &a_{1,1}=a_1 \\ &a_{2,2}= \begin{vmatrix} a_1 & a_3\\ a_0 & a_2 \end{vmatrix} \diagup a_1 \\ &a_{3,3}= \begin{vmatrix} a_1 & a_3 & a_5\\ a_0 & a_2 & a_4\\ 0 & a_1 & a_3 \end{vmatrix} \diagup \begin{vmatrix} a_1 & a_3\\ a_0 & a_2 \end{vmatrix} \\ &a_{4,4}= \begin{vmatrix} a_1 & a_3 & a_5 & a_7\\ a_0 & a_2 & a_4 & a_6\\ 0 & a_1 & a_3 & a_5\\ 0 & a_0 & a_2 & a_4 \end{vmatrix} \diagup \begin{vmatrix} a_1 & a_3 & a_5\\ a_0 & a_2 & a_4\\ 0 & a_1 & a_3 \end{vmatrix} \\ &~~~\cdots \\ &a_{n,n}=a_n,~~~~(\mathrm{because}~~a_m=0~~\mathrm{for}~~m>n). \end{aligned}$$(6.94)Each term of (6.94) corresponds to a Hurwitz determinant and its principal minors.
However, in regard to the remaining two cases, the following Sturm’s sequences are calculated.
-
(3)
In this case, if f 0(ω)/f 1(ω)=Q (3)(ω)/P (3)(ω) is calculated as above for (1), the following series are obtained:
$$\begin{aligned} &a_{2,2}=a_3\left(\frac{a_0}{a_1}\right)-a_2,~~~~ a_{2,4}=-a_5\left(\frac{a_0}{a_1}\right)+a_4,~~~ ~~\cdots\\ &a_{3,3}=-a_{2,4}\left(\frac{a_1}{a_{2,2}}\right)-a_3,~~~ a_{3,5}=-a_{2,6}\left(\frac{a_1}{a_{2,2}}\right)+a_5,~~~\cdots\\ &a_{4,4}=a_{3,5}\left(\frac{a_{2,2}}{a_{3,3}}\right)-a_{2,4}\\ &~~~~~\cdots. \end{aligned}$$ -
(4)
In this case, if f 0(ω)/f 1(ω)=−P (4)(ω)/Q (4)(ω) is calculated as above for (2), the following series are obtained:
$$\begin{aligned} &a_{2,2}=a_3\left(\frac{a_0}{a_1}\right)-a_2,~~~~ a_{2,4}=-a_5\left(\frac{a_0}{a_1}\right)+a_4,~~~ ~~\cdots\\ &a_{3,3}=-a_{2,4}\left(\frac{a_1}{a_{2,2}}\right)-a_3,~~~ a_{3,5}=-a_{2,6}\left(\frac{a_1}{a_{2,2}}\right)+a_5,~~~\cdots\\ &a_{4,4}=a_{3,5}\left(\frac{a_{2,2}}{a_{3,3}}\right)-a_{2,4}\\ &~~~~~\cdots. \end{aligned}$$
In either case (3) or (4), the top of Routh’s series can be written as
Each term of (6.95) corresponds to a Hurwitz determinant and its principal minors. Although it is different from (6.94) in sign, the number of sign changes is invariant (i.e., zero).
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Okuyama, Y. (2014). Interval Polynomials and Robust Performance. In: Discrete Control Systems. Springer, London. https://doi.org/10.1007/978-1-4471-5667-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5667-3_6
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5666-6
Online ISBN: 978-1-4471-5667-3
eBook Packages: EngineeringEngineering (R0)