
128 4 System Response Analysis
As you can observe, when studying system stability, sometimes it is not needed
to know where the poles are exactly placed, but to know whether all the poles are
on the left part of the s-plane. Moreover, if you do not have a computer program
(like Matlab) to solve high-order equations, it can be difficult to decide about the
stability of a given system. For that, there are some simple rules, given by the
Routh-Hürwitz theorem, which yields the number of poles that are placed in the
“wrong” place, that is, on the right part of the s-plane. The steps to easily check
the stability of a system are:
1.
Obtain the characteristic equation of the system.
(4.64)
2.
Assuming that a
0
≠0, if there is one (or more) term a
i
<0 when another
term a
j
>0 then one of the roots of the equation, at least, are positive (the
system is unstable) or complex conjugated in the form s=0±j
ω (critical
stability). This condition is necessary but not sufficient.
3.
If a characteristic equation passes step 2, there is a possibility of being
unstable yet. To completely check the stability of the system we proceed
as follows. We construct a table like the one shown in fig. 4.33 where the
first two rows are filled up with the coefficients of the characteristic
equation: the first row lists the odd coefficients starting from a
n
while the
second row lists the even coefficients starting from a
n-1
. The rest of cells
of this table are calculated as:
(4.65)
…
…
t(3,1) t(3,2) t(3,3) t(3,4) …
… … … … …
t(n+1,1) t(n+1,2) t(n+1,3) t(n+1,4) …
Fig. 4.33 Routh-Hürwitz table. First two rows are filled up with the coefficients of the
characteristic equation, while the rest are computed through the expression (4.65).
The Routh-Hürwitz theorem assures that the number of poles located at the
right part of the s-plane coincides with the changes of signs of the elements of the
first column of the table. Thus, a system is stable if and only such elements are all
positive or all negative.
10
...
n
n
as as a++ +
()()
( 1,1) * ( 2, 1) ( 1, 1) * ( 2,1)
(, )
(1,1)
ti ti j ti j ti
ti j
ti
−−+−−+−
=
−
n
a
2n
a
− 4n
a
− 6n
a
−
1n
a
− 3n
a
− 5n
a
− 7n
a
−