Loading [MathJax]/jax/output/HTML-CSS/jax.js

ECE 486 Control Systems
Lecture 7

Effect of Extra Zeros

We discussed transient response characteristics last time, specifically rise time tr, overshoot Mp and settling time ts. We also sketched possible pole locations when there are constraints on them.

In this lecture, we will try to understand the effect of zeros and high-order poles on the shape of transient response, then its relation with stability. Following this line, we will formulate and learn how to apply the Routh–Hurwtiz stability criterion in the second half of this lecture.

Recall a system transfer function is a rational function H(s)=q(s)p(s), its zeros are the roots of the numerator polynomial equation q(s)=0.

Extra Zero on Left Half Plane

Example 1: Consider transfer function H1(s) with normalized natural frequency ωn=1 rad/s,

H1(s)=1s2+2ζs+1, with ωn=1.

Introduce a zero at s=a, a>0 (a Left Half Plane zero) to H1(s). To keep DC gain=1, we normalize the constant term of the numerator, then we get sa+1. Denote the new transfer function H2(s),

H2(s)=sa+1s2+2ζs+1=1s2+2ζs+1this is H1(s)+1ass2+2ζs+1call this Hd(s)=H1(s)+1aHd(s),Hd(s)=sH1(s).

That is to say

H1(s)=1s2+2ζs+1add zero at s=aH2(s)=H1(s)+1asH1(s)

We are interested in the relationship between the step response of the new transfer function H2(s) and the step response of the original H1(s),

Y1(s)=H1(s)s;Y2(s)=H2(s)s=1s(H1(s)+1asH1(s))=H1(s)s+1asH1(s)s=Y1(s)+1asY1(s).

Therefore, assuming zero initial conditions we have,

y2(t)=L1{Y2(s)}=L1{Y1(s)+1asY1(s)}=y1(t)+1a˙y1(t).

Equation (1) says when we add an extra zero s=a to the original transfer function, the new response y2(t) is the original response y1(t) plus its scaled derivative ˙y1(t).

y2(t)=y1(t)+1a˙y1(t), where y1(t) is the original step response.

LHP zero

Figure 1: Effect of a LHP extra zero s=a on step response of H1(s)

Based on Figure 1, we noticed a LHP zero

  • increased overshoot (its major effect);
  • had little influence on settling time;
  • and when the extra zero is far from origin, i.e., a, its effects become less significant since 1a˙y1(t)0.

Extra Zero on Right Half Plane

Similarly, we can consider a RHP extra zero s=a with a>0.

H1(s)=1s2+2ζs+1add zero at s=aH2(s)=H1(s)1asH1(s),y2(t)=y1(t)1a˙y1(t).

Equation (2) says when the extra zero is on the RHP, instead of summing up the original response y1(t) and its derivative ˙y1(t), we subtract the scaled derivative term 1a˙y1(t) from the original response y1(t).

RHP zero

Figure 2: Effect of a RHP extra zero s=a on step response of H1(s)

Based on Figure 2, a RHP zero

  • slowed down (or delayed) the original response;
  • created significant undershoot when the extra zero is close to origin, i.e., a is small enough.

Effect of Poles

Poles on Left Half Plane

A general nth-order system has n (complex) poles since by Fundamental theorem of algebra the polynomial equation p(s)=0 has exactly n roots in C. Further we observe

  • LHP poles are not significant if their real parts are at least 5 times the real parts of dominant LHP poles, e.g., if dominant poles have Re(s)=2 and we have extra poles with Re(s)=10, their time-domain contributions will be e2t and e10t but e10te2t decays much faster;
  • the “5 times” is just a convention, but we can really see the effect of poles that are closer. (cf. Lab 2)

    high order poles

Poles on Right Half Plane

We do not want to consider RHP poles in general since these are unstable poles.

Poles on Imaginary Axis

The boundary case is when the poles lie on the imaginary axis.

First consider the case of a pole at the origin H(s)=1s.

Is this a stable system?

  • To compute its impulse response: Y(s)=1sy(t)=1(t), output is a unit, hence a stable output.
  • To compute its step response: Y(s)=1s2y(t)=t,t0, output is a unit ramp, hence growing indefinitely.

Next consider the case of a pair of purely imaginary poles H(s)=ω2s2+ω2.

  • To compute its impulse response: Y(s)=ω2s2+ω2y(t)=ωsin(ωt), hence output is bounded but not convergent.
  • To compute its step response: Y(s)=ω2s(s2+ω2)y(t)=1cos(ωt), again the output is bounded but not convergent.

Therefore, systems with poles on the imaginary axis are not strictly stable.

To illustrate what we have discussed so far, Figure 4 shows

pole locations

Figure 4: Effect of poles on step response of H(s)

Correction: The shape of the subfigure in Figure 4 is not correct in the case of a blowing up exponential for real positive poles. The shape of this subfigure shall be a reflection with respect to y-axis of the figure in the case of a decaying exponential for real negative poles, not with respect to x-axis.

  • poles in open LHP Re(s)<0, system response is stable
  • poles in open RHP Re(s)>0, system response is unstable
  • poles on the imaginary axis Re(s)=0, system response is not strictly stable.

Input-Output Stability

Recall the input-output set-up we used in Lecture 4,

input output

A linear time-invariant system is said to be Bounded-Input, Bounded-Output (BIBO) stable provided either one of the following three equivalent conditions is satisfied:

  • If every bounded input u(t) results in a bounded output y(t), regardless of initial conditions.
  • If the impulse response h(t) is absolutely integrable, |h(t)|dt<.
  • If all poles of the transfer function H(s) are strictly stable, i.e., all of them lie in the Open Left Half Plane.

Checking for Stability

Consider a general proper transfer function H(s)=q(s)p(s), where q(s) and p(s) are polynomials, and deg(q)deg(p).

We need to develop machinery to check system stability, i.e., whether or not all roots of p(s)=0 lie in Open Left Half Plane (OLHP). For simple polynomials, we can run stability checking via factoring them “by inspection” and find roots.

This is hard however to do for high-degree polynomials; it’s computationally intensive, and there is no closed form formula in simple operations for polynomials with degrees greater than or equal to 5. (Why?) Hint: See Abel-Ruffini. Often we don’t need to know the precise pole locations, we just need to know whether they are strictly stable poles, i.e., lying in the OLHP.

Question: Given an nth-degree polynomial p(s)=sn+a1sn1+a2sn2++an1s+an,

with real coefficients, check that the roots of the equation p(s)=0 are strictly stable (i.e., have negative real parts).

Terminology:

  • We often say that the polynomial p is (strictly) stable if all of its roots are (strictly) stable.
  • We say that A is a necessary condition for B if A is false B is false, or B is true A is true. This means even if A is true, B may still be false.
  • We say that A is a sufficient condition for B if A is true B is true.
  • Thus, A is a necessary and sufficient condition for B if A is trueB is true, it reads A is true if and only if (iff) B is true.

Necessary condition for stability: A polynomial p is strictly stable only if all of its coefficients are strictly positive.

Proof: Suppose that p has roots at r1,r2,,rn with Re(ri)<0 for all i, then

p(s)=(sr1)(sr2)(srn).

Multiply this out and check that all coefficients are positive. (Why?) Hint: For complex roots, they appear in pairs. (Why?) For each pair, they belong to a factor s2(ri+ˉri)s+riˉri of the polynomial p(s). This factor has real coefficients since ri+ˉri=2Re(ri) and riˉri=|ri|2.

Routh–Hurwitz Criterion

We will now introduce a necessary and sufficient condition for stability, the Routh–Hurwitz Criterion.

Routh–Hurwitz Criterion: A Bit of History

Maxwell

Figure 6: James Clerk Maxwell

J.C. Maxwell, On governors, Proc. Royal Society, no. 100, 1868

Stability of the governor is mathematically equivalent to the condition that all the possible roots, and all the possible parts of the impossible roots, of a certain equation shall be negative

I have not been able completely to determine these conditions for equations of a higher degree than the third; but I hope that the subject will obtain the attention of mathematicians.

Routh

Figure 7: Edward John Routh, 1831–1907

In 1877, Maxwell was one of the judges for the Adams Prize, a biennial competition for best essay on a scientific topic. The topic that year was stability of motion. The prize went to Edward John Routh, who solved the problem posed by Maxwell in 1868.

Hurwitz

Figure 8: Adolf Hurwitz, 1859–1919

In 1893, Adolf Hurwitz solved the same problem, using a different method, independently of Routh.

Routh’s Test: check whether the polynomial p(s)=sn+a1sn1+a2sn2++an1s+an is strictly stable.

We begin by forming the Routh array using the coefficients of p(s),

sn:1a2a4a6sn1:a1a3a5a7

If necessary, add zeros in the second row to match lengths. Note that the very first entry is always 1, and also note the order in which the coefficients are filled in: from left to right, odd numbered coefficients are in the first row; even numbered coefficients are in the second.

Next, we form the third row marked by sn2. The computation of coefficients in the current row is based on the coefficients in the immediate previous two rows.

sn:1a2a4a6sn1:a1a3a5a7sn2:b1b2b3

where

b1=1a1det(1a2a1a3)=1a1(a3a1a2),b2=1a1det(1a4a1a5)=1a1(a5a1a4),b3=1a1det(1a6a1a7)=1a1(a7a1a6), and so on ...

Notice that the new row is 1 element shorter than the one above it.

Similar to sn2, we can construct the fourth row sn3 by coefficients from the second and third rows,

sn:1a2a4a6sn1:a1a3a5a7sn2:b1b2b3sn3:c1c2

where

c1=1b1det(a1a3b1b2)=1b1(a1b2a3b1),c2=1b1det(a1a5b1b3)=1b1(a1b3a5b1), and so on ...

Eventually, we complete the array

sn:1a2a4a6sn1:a1a3a5a7sn2:b1b2b3sn3:c1c2s1:s0:

as long as we don’t get stuck with division by zero. (More on this later.)

After the process terminates, we will have n+1 entries in the first column.

The Routh–Hurwitz Criterion: Consider n-th degree polynomial p(s)=sn+a1sn1++an1s+an and form the Routh array:

sn:1a2a4a6sn1:a1a3a5a7sn2:b1b2b3sn3:c1c2s1:s0:

Assume that the necessary condition for stability holds, i.e., a1,,an>0, then

  • p(s) is stable if and only if all entries in the first column of Routh array are positive; otherwise,
  • #(RHP poles)=#(sign changes in first column of Routh array).

Example 2: Determine the stability of polynomial p(s)=s4+4s3+s2+2s+3.

Solution: All coefficients strictly positive, i.e., necessary condition holds. Compute the Routh array as follows,

s4:113s3:420s2:123s1:220s0:3

Therefore p(s) is unstable. It has 2 RHP poles since there are 2 sign changes in first column of the above Routh array.

Example 3: Apply Routh–Hurwitz criterion to low-order polynomials when n=2,3. Obtain shortcuts for those cases.

Solution: When n=2, consider p(s)=s2+a1s+a2. The corresponding Routh array is

s2:1a2s1:a10s0:b1

where

b1=1a1det(1a2a10)=a2.

Thus p(s) is stable if and only if a1,a2>0.

Similarly, when n=3, consider p(s)=s3+a1s2+a2s+a3. The corresponding Routh array is

s3:1a2s2:a1a3s1:b10s0:c1

where

b1=1a1det(1a2a1a3)=a1a2a3a1,c1=1b2det(a1a3b10)=a3.

Thus p(s) is stable if and only if a1,a2,a3>0 and a1a2>a3.

Upshot: From the above two examples, we observe

  • A 2nd-degree polynomial p(s)=s2+a1s+a2 is stable if and only if a1>0 and a2>0.
  • A 3rd-degree polynomial p(s)=s3+a1s2+a2s+a3 is stable if and only if a1,a2,a3>0 and a1a2>a3.

These conditions were already obtained by Maxwell in 1868. In both cases, the computations were purely symbolic. This can make a lot of difference in design as opposed to analysis.

Routh–Hurwitz Criterion as a Design Tool

We can use the Routh test to determine parameter ranges for stability.

Example 4: Consider the unity feedback configuration in Figure 9,

d7 ex4

Figure 9: Example 4, Unity Feedback

determine the range of values the scalar gain K can take, for which the closed-loop system is stable.

Note that the plant itself is unstable since the denominator has a negative coefficient and a zero coefficient.

Solution: Let’s first write down the transfer function from reference R to output Y,

YR=forward gain1+loop gain=Ks+1s3+2s2s1+Ks+1s3+2s2s=K(s+1)s3+2s2s+K(s+1)=Ks+Ks3+2s2+(K1)s+K.

Now we need to test stability of p(s)=s3+2s2+(K1)s+K using the Routh test.

Form the Routh array:

s3:1K1s2:2Ks1:K210s0:K

For p to be stable, all entries in the first column must be positive, i.e., K21>0 and K>0. The necessary condition requires K>1, but now we actually know that we must have K>2 for stability.

Comments on the Routh Test:

  • The result #(RHP roots) is not affected if we multiply or divide any row of the Routh array by an arbitrary positive number.
  • If we get a zero element in the first column, we can’t continue. In that case, we can replace the 0 by a small number ε and apply Routh test to ε. When we are done with the array, take the limit as ε0. More on this can be found in Example 3.33 in FPE.
  • For an entire row of zeros, the procedure is a more complicated (see Example 3.34 in FPE). We shall not worry about this too much.


PDF slides by Prof M. Raginsky and Prof D. Liberzon
Edited and HTML-ized by Yün Han

Last updated: 2018-02-06 Tue 13:10