Discursive dilemma: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Gregbard
 
en>ChrisGualtieri
m Remove stub template(s). Page is start class or higher. Also check for and do General Fixes + Checkwiki fixes using AWB
 
Line 1: Line 1:
{{No footnotes|date=February 2011}}


The Routh array is a [[Routh-Hurwitz_stability_criterion#Higher-order_example|tabular method]] permitting one to establish the [[stable polynomial|stability]] of a system using only the coefficients of the characteristic [[polynomial]].  Central to the field of [[control theory|control systems design]], the [[Routh–Hurwitz theorem]] and Routh array emerge by using the [[Euclidean algorithm]] and [[Sturm's theorem]] in evaluating [[cauchy index|Cauchy indices]].


It involves expertise and knowledge of various tools and technologies used for creating websites. It is thus, on these grounds that compel various web service provider companies to integrate the same in their packages too. Your parishioners and certainly interested audience can come in to you for further information from the group and sometimes even approaching happenings and systems with the church. Keep reading for some great Word - Press ideas you can start using today. The number of options offered here is overwhelming, but once I took the time to begin to review the video training, I was amazed at how easy it was to create a squeeze page and a membership site. <br><br>Any business enterprise that is certainly worth its name should really shell out a good deal in making sure that they have the most effective website that provides related info to its prospect. Best of all, you can still have all the functionality that you desire when you use the Word - Press platform. Well Managed Administration  The Word - Press can easily absorb the high numbers of traffic by controlling the server load to make sure that the site works properly. From my very own experiences, I will let you know why you should choose WPZOOM Live journal templates. But in case you want some theme or plugin in sync with your business needs, it is advisable that you must seek some professional help. <br><br>But before choosing any one of these, let's compare between the two. By using Word - Press MLM websites or blogs, you and your companies presence on the internet can be created swiftly and simply. all the necessary planning and steps of conversion is carried out in this phase, such as splitting, slicing, CSS code, adding images, header footer etc. The animation can be quite subtle these as snow falling gently or some twinkling start in the track record which are essentially not distracting but as an alternative gives some viewing enjoyment for the visitor of the internet site. Customization of web layout is easy due to the availability of huge selection of templates. <br><br>Additionally Word - Press add a default theme named Twenty Fourteen. The SEOPressor Word - Press SEO Plugin works by analysing each page and post against your chosen keyword (or keyword phrase) and giving a score, with instructions on how to improve it. This allows for keeping the content editing toolbar in place at all times no matter how far down the page is scrolled. The company gains commission from the customers' payment. Digital digital cameras now function gray-scale configurations which allow expert photographers to catch images only in black and white. <br><br>A sitemap is useful for enabling web spiders and also on rare occasions clients, too, to more easily and navigate your website. I don't want that for my visitors and I'm quite sure they don't either. Useful Plugins Uber - Menu Top Megamenu  Now it is the time of sticky Top navbar. Working with a Word - Press blog and the appropriate cost-free Word - Press theme, you can get a professional internet site up and published in no time at allShould you cherished this informative article along with you want to get details relating to [http://2am.eu/wordpressbackupplugin124389 wordpress backup] kindly go to the internet site. You can check out the statistics of page of views for your web pages using free tools that are available on the internet.
== The Cauchy index ==
 
 
Given the system:
 
 
: <math>\begin{align}
f(x) & {} = a_0x^n+a_1x^{n-1}+\cdots+a_n & {} \quad (1) \\
      & {} = (x-r_1)(x-r_2)\cdots(x-r_n) & {} \quad (2) \\
\end{align}</math>
 
 
Assuming no roots of <math>f(x) = 0\,</math> lie on the imaginary axis, and letting
 
 
: <math>N\,</math> = The number of roots of <math>f(x) = 0\,</math> with negative real parts, and
: <math>P\,</math> = The number of roots of <math>f(x) = 0\,</math> with positive real parts
 
 
then we have
 
 
: <math>N+P=n  \quad (3) \,</math>
 
 
Expressing <math>f(x)\,</math> in polar form, we have
 
 
: <math>f(x) = \rho(x)e^{j\theta(x)}    \quad (4) \,</math>
 
 
where
 
 
: <math>\rho(x) = \sqrt{\mathfrak{Re}^2[f(x)]+\mathfrak{Im}^2[f(x)]}  \quad (5) </math>
 
 
and
 
 
: <math>\theta(x) = \tan^{-1}\big(\mathfrak{Im}[f(x)]/\mathfrak{Re}[f(x)]\big)  \quad (6) </math>
 
 
from (2) note that
 
 
: <math>\theta(x) = \theta_{r_1}(x)+\theta_{r_2}(x)+\cdots+\theta_{r_n}(x)  \quad (7)\,</math>
 
 
where
 
 
: <math>\theta_{r_i}(x) = \angle(x-r_i)  \quad (8)\,</math>
 
 
Now if the i<sup>th</sup> root of <math>f(x) = 0\,</math> has a positive real part, then (<small>using the notation y=(RE[y],IM[y])</small>)
 
 
:  <math>\begin{align}
\theta_{r_i}(x)\big|_{x=j\infty} & = \angle(x-r_i)\big|_{x=j\infty} \\
                                & = \angle(0-\mathfrak{Re}[r_i],\infty-\mathfrak{Im}[r_i]) \\
                                & = \angle(-\mathfrak{Re}[r_i],\infty) \\
                                & = \lim_{\phi \to -\infty}\tan^{-1}\phi=-\frac{\pi}{2}  \quad (9)\\
\end{align}</math>
 
 
and
 
 
: <math>\theta_{r_i}(x)\big|_{x=-j\infty} = \angle(-\mathfrak{Re}[r_i],-\infty) = \lim_{\phi \to \infty}\tan^{-1}\phi=\frac{\pi}{2}  \quad (10)\,</math>
 
 
Similarly, if the i<sup>th</sup> root of <math>f(x)=0\,</math> has a negative real part,
 
 
: <math>\theta_{r_i}(x)\big|_{x=j\infty} = \angle(-\mathfrak{Re}[r_i],\infty) = \lim_{\phi \to \infty}\tan^{-1}\phi=\frac{\pi}{2}\,  \quad (11)</math>
 
 
and
 
 
: <math>\theta_{r_i}(x)\big|_{x=-j\infty} = \angle(-\mathfrak{Re}[r_i],-\infty) = \lim_{\phi \to -\infty}\tan^{-1}\phi=-\frac{\pi}{2}\,  \quad (12)</math>
 
 
Therefore, <math>\theta_{r_i}(x)\Big|_{x=-j\infty}^{x=j\infty} = -\pi\,</math> when the i<sup>th</sup> root of <math>f(x)\,</math> has a positive real part, and <math>\theta_{r_i}(x)\Big|_{x=-j\infty}^{x=j\infty} = \pi\,</math> when the i<sup>th</sup> root of <math>f(x)\,</math> has a negative real part. Alternatively,
 
 
: <math>\theta(x)\big|_{x=j\infty} = \angle(x-r_1)\big|_{x=j\infty}+\angle(x-r_2)\big|_{x=j\infty}+\cdots+\angle(x-r_n)\big|_{x=j\infty} = \frac{\pi}{2}N-\frac{\pi}{2}P  \quad (13)\,</math>
 
 
and
 
 
: <math>\theta(x)\big|_{x=-j\infty} = \angle(x-r_1)\big|_{x=-j\infty}+\angle(x-r_2)\big|_{x=-j\infty}+\cdots+\angle(x-r_n)\big|_{x=-j\infty} = -\frac{\pi}{2}N+\frac{\pi}{2}P  \quad (14)\,</math>
 
 
So, if we define
 
 
: <math>\Delta=\frac{1}{\pi}\theta(x)\Big|_{-j\infty}^{j\infty}  \quad (15)\,</math>
 
 
then we have the relationship
 
 
:<math>N - P = \Delta  \quad (16)\,</math>
 
 
and combining (3) and (16) gives us
 
 
: <math>N = \frac{n+\Delta}{2}\,</math> and <math>P = \frac{n-\Delta}{2}    \quad (17)\,</math>
 
 
Therefore, given an equation of <math>f(x)\,</math> of degree <math>n\,</math> we need only evaluate this function <math>\Delta\,</math> to determine <math>N\,</math>, the number of roots with negative real parts and <math>P\,</math>, the number of roots with positive real parts.
 
 
{| align=right border="0" cellpadding="0"
|[[Image:Tan(theta).jpg|Graph of θ versus tan(θ)]]
|-
|<center>Figure 1</center>
|-
|<center><math>\tan(\theta)\,</math> versus <math>\theta\,</math></center>
|}
 
 
Equations (13) and (14) show that at <math>x=\pm\infty\,</math>, <math>\theta=\theta(x)\,</math> is an integer multiple of <math>\pi/2\,</math>. Note now, in accordance with (6) and Figure 1, the graph of <math>\tan(\theta)\,</math> vs <math>\theta\,</math>, that varying <math>x\,</math> over an interval (a,b) where <math>\theta_a=\theta(x)|_{x=ja}\,</math> and <math>\theta_b=\theta(x)|_{x=jb}\,</math> are integer multiples of <math>\pi\,</math>, this variation causing the function <math>\theta(x)\,</math> to have increased by <math>\pi\,</math>, indicates that in the course of travelling from point a to point b, <math>\theta\,</math> has "jumped" from <math>+\infty\,</math> to <math>-\infty\,</math> one more time than it has jumped from <math>-\infty\,</math> to <math>+\infty\,</math>.  Similarly, if we vary <math>x\,</math> over an interval (a,b) this variation causing <math>\theta(x)\,</math> to have decreased by <math>\pi\,</math>, where again <math>\theta\,</math> is a multiple of <math>\pi\,</math> at both <math>x = ja\,</math> and <math>x = jb\,</math>, implies that <math>\tan \theta (x) = \mathfrak{Im}[f(x)]/\mathfrak{Re}[f(x)]\,</math> has jumped from <math>-\infty\,</math> to <math>+\infty\,</math> one more time than it has jumped from <math>+\infty\,</math> to <math>-\infty\,</math> as <math>x\,</math> was varied over the said interval.
 
 
Thus, <math>\theta(x)\Big|_{-j\infty}^{j\infty}\,</math> is <math>\pi\,</math> times the difference between the number of points at which <math>\mathfrak{Im}[f(x)]/\mathfrak{Re}[f(x)]\,</math> jumps from <math>-\infty\,</math> to <math>+\infty\,</math> and the number of points at which <math>\mathfrak{Im}[f(x)]/\mathfrak{Re}[f(x)]\,</math> jumps from <math>+\infty\,</math> to <math>-\infty\,</math> as <math>x\,</math> ranges over the interval <math>(-j\infty,+j\infty\,)</math> provided that at <math>x=\pm j\infty</math>, <math>\tan[\theta(x)]\,</math> is defined.
 
 
{| align=right border="0" cellpadding="0" style="background:none"
|[[Image:Cot(theta).svg|Graph of &theta; versus &minus;cotan(&theta;)]]
|-
|<center>Figure 2</center>
|-
|<center><math>-\cot(\theta)\,</math> versus <math>\theta\,</math></center>
|}
 
 
In the case where the starting point is on an incongruity (i.e. <math>\theta_a=\pi/2 \pm i\pi\,</math>, ''i'' = 0, 1, 2, ...) the ending point will be on an incongruity as well, by equation (16) (since <math>N\,</math> is an integer and <math>P\,</math> is an integer, <math>\Delta\,</math> will be an integer).  In this case, we can achieve this same index (difference in positive and negative jumps) by shifting the axes of the tangent function by <math>\pi/2\,</math>, through adding <math>\pi/2\,</math> to <math>\theta\,</math>. Thus, our index is now fully defined for any combination of coefficients in <math>f(x)\,</math> by evaluating <math>\tan[\theta]=\mathfrak{Im}[f(x)]/\mathfrak{Re}[f(x)]\,</math>  over the interval (a,b) = <math>(+j\infty, -j\infty)\,</math> when our starting (and thus ending) point is not an incongruity, and by evaluating
 
 
: <math>\tan[\theta'(x)]=\tan[\theta + \pi/2] = -\cot[\theta(x)] = -\mathfrak{Re}[f(x)]/\mathfrak{Im}[f(x)]  \quad (18)\,</math>
 
 
over said interval when our starting point is at an incongruity.
 
 
This difference, <math>\Delta\,</math>, of negative and positive jumping incongruities encountered while traversing <math>x\,</math> from <math>-j\infty\,</math> to <math>+j\infty\,</math> is called the Cauchy Index of the tangent of the phase angle, the phase angle being <math>\theta(x)\,</math> or <math>\theta'(x)\,</math>, depending as <math>\theta_a\,</math> is an integer multiple of <math>\pi\,</math> or not.
 
== The Routh criterion ==
 
 
To derive Routh's criterion, first we'll use a different notation to differentiate between the even and odd terms of <math>f(x)\,</math>:
 
 
: <math>f(x) = a_0x^n + b_0x^{n-1} + a_1x^{n-2} + b_1x^{n-3} + \cdots  \quad (19)\,</math>
 
 
Now we have:
 
 
: <math>\begin{align}
f(j\omega) & = a_0(j\omega)^n+b_0(j\omega)^{n-1}+a_1(j\omega)^{n-2}+b_1(j\omega)^{n-3}+\cdots & {}  \quad (20)\\
            & = a_0(j\omega)^n+a_1(j\omega)^{n-2}+a_2(j\omega)^{n-4}+\cdots & {} \quad (21)\\
            & + b_0(j\omega)^{n-1}+b_1(j\omega)^{n-3}+b_2(j\omega)^{n-5}+\cdots \\
\end{align}</math>
 
 
Therefore, if <math>n\,</math> is even,
 
 
:<math>\begin{align}
f(j\omega) & = (-1)^{n/2}\big[a_0\omega^n+a_1\omega^{n-2}+a_2\omega^{n-4}+\cdots \big] & {}  \quad (22)\\
            & + j(-1)^{(n/2)-1}\big[b_0\omega^{n-1}+b_1\omega^{n-3}+b_2\omega^{n-5}+\cdots \big] & {} \\
\end{align}</math>
 
 
and if <math>n\,</math> is odd:
 
 
: <math>\begin{align}
f(j\omega) & = j(-1)^{(n-1)/2}\big[a_0\omega^n+a_1\omega^{n-2}+a_2\omega^{n-4}+\cdots \big] & {}  \quad (23)\\
            & + (-1)^{(n-1)/2}\big[b_0\omega^{n-1}+b_1\omega^{n-3}+b_2\omega^{n-5}+\cdots \big] & {}\\
\end{align}</math>
 
 
Now observe that if <math>n\,</math> is an odd integer, then by (3) <math>N+P\,</math> is odd. If <math>N+P\,</math> is an odd integer, then <math>N-P\,</math> is odd as well.  Similarly, this same argument shows that when <math>n\,</math> is even, <math>N-P\,</math> will be even.  Equation (13) shows that if <math>N-P\,</math> is even, <math>\theta\,</math> is an integer multiple of <math>\pi\,</math>.  Therefore, <math>\tan(\theta)\,</math> is defined for <math>n\,</math> even, and is thus the proper index to use when n is even, and similarly <math>\tan(\theta') = \tan(\theta+\pi) = -\cot(\theta)\,</math> is defined for <math>n\,</math> odd, making it the proper index in this latter case.
 
 
Thus, from (6) and (22), for <math>n\,</math> even:
 
 
: <math>\Delta = I_{-\infty}^{+\infty}\frac{-\mathfrak{Im}[f(x)]}{\mathfrak{Re}[f(x)]}= I_{-\infty}^{+\infty}\frac{b_0\omega^{n-1}-b_1\omega^{n-3}+\cdots}{a_0\omega^n-a_1\omega^{n-2}+\ldots}  \quad (24)\,</math>
 
 
and from (18) and (23), for <math>n\,</math> odd:
 
 
:<math>\Delta = I_{-\infty}^{+\infty}\frac{\mathfrak{Re}[f(x)]}{\mathfrak{Im}[f(x)]}= I_{-\infty}^{+\infty}\frac{b_0\omega^{n-1}-b_1\omega^{n-3}+\ldots}{a_0\omega^n-a_1\omega^{n-2}+\ldots}  \quad (25)\,</math>
 
 
Lo and behold we are evaluating the same Cauchy index for both:
 
 
<math>\Delta = I_{-\infty}^{+\infty}\frac{b_0\omega^{n-1}-b_1\omega^{n-3}+\ldots}{a_0\omega^n-a_1\omega^{n-2}+\ldots}    \quad (26)\,</math>
 
== Sturm's theorem ==
 
 
[[Sturm theorem|Sturm]] gives us a method for evaluating <math>\Delta = I_{-\infty}^{+\infty}\frac{f_2(x)}{f_1(x)}\,</math>.  His theorem states as follows:
 
 
Given a sequence of polynomials <math>f_1(x),f_2(x), \dots, f_m(x)\,</math> where:
 
 
1)  If <math>f_k(x) = 0\,</math> then <math>f_{k-1}(x) \neq 0\,</math>, <math>f_{k+1}(x) \neq 0\,</math>, and <math> \operatorname{sign}[f_{k-1}(x)] = - \operatorname{sign}[f_{k+1}(x)]\,</math>
 
 
2)  <math>f_m(x) \neq 0 \,</math> for <math>-\infty < x < \infty\,</math>
 
 
and we define <math>V(x)\,</math> as the number of changes of sign in the sequence <math>f_1(x),f_2(x), \dots, f_m(x)\,</math> for a fixed value of <math>x\,</math>, then:
 
 
: <math>\Delta = I_{-\infty}^{+\infty}\frac{f_2(x)}{f_1(x)}= V(-\infty) - V(+\infty)    \quad (27)\,</math>
 
 
A sequence satisfying these requirements is obtained using the [[Euclid's algorithm|Euclidean algorithm]], which is as follows:
 
 
Starting with <math>f_1(x)\,</math> and <math>f_2(x)\,</math>, and denoting the remainder of <math>f_1(x)/f_2(x)\,</math> by <math>f_3(x)\,</math> and similarly denoting the remainder of <math>f_2(x)/f_3(x)\,</math> by <math>f_4(x)\,</math>, and so on, we obtain the relationships:
 
 
:<math>\begin{align}
&f_1(x)= q_1(x)f_2(x) - f_3(x)    \quad (28)\\
&f_2(x)= q_2(x)f_3(x) - f_4(x) \\
&    \ldots \\
&f_{m-1}(x)= q_{m-1}(x)f_m(x) \\
\end{align}</math>
 
 
or in general
 
 
: <math>f_{k-1}(x)= q_{k-1}(x)f_k(x) - f_{k+1}(x)\,</math>
 
 
where the last non-zero remainder, <math>f_m(x)\,</math> will therefore be the highest common factor of <math>f_1(x),f_2(x), \dots, f_{m-1}(x)\,</math>. It can be observed that the sequence so constructed will satisfy the conditions of Sturm's theorem, and thus an algorithm for determining the stated index has been developed.
 
 
It is in applying Sturm's theorem (28) to (26), through the use of the Euclidean algorithm above that the Routh matrix is formed.
 
 
We get
 
 
:<math>f_3(\omega) = \frac {a_0}{b_0}f_2(\omega) - f_1(\omega)  \quad (29) \,</math>
 
 
and identifying the coefficients of this remainder by <math>c_0\,</math>, <math>-c_1\,</math>, <math>c_2\,</math>, <math>-c_3\,</math>, and so forth, makes our formed remainder
 
 
:<math>f_3(\omega) = c_0\omega^{n-2} - c_1\omega^{n-4} + c_2\omega^{n-6} - \cdots  \quad (30)\,</math>
 
 
where
 
 
:<math>c_0 = a_1 - \frac{a_0}{b_0}b_1 = \frac{b_0a_1 - a_1b_0}{b_0}; c_1 = a_2 - \frac{a_0}{b_0}b_2 = \frac{b_0a_2 - a_0b_2}{b_0};\ldots  \quad (31)\,</math>
 
 
Continuing with the Euclidean algorithm on these new coefficients gives us
 
 
:<math>f_4(\omega) = \frac {b_0}{c_0}f_3(\omega) - f_2(\omega)  \quad (32)\,</math>
 
 
where we again denote the coefficients of the remainder <math>f_4(\omega)\,</math> by <math>d_0\,</math>, <math>-d_1\,</math>, <math>d_2\,</math>, <math>-d_3\,</math>,
 
 
making our formed remainder
 
 
:<math>f_4(\omega) = d_0\omega^{n-3} - d_1\omega^{n-5} + d_2\omega^{n-7} - \cdots  \quad (33)\,</math>
 
 
and giving us
 
 
:<math>d_0 = b_1 - \frac{b_0}{c_0}c_1 = \frac{c_0b_1 - b_1c_0}{c_0}; d_1 = b_2 - \frac{b_0}{c_0}c_2 = \frac{c_0b_2 - b_0c_2}{c_0};\ldots  \quad (34)\,</math>
 
 
The rows of the Routh array are determined exactly by this algorithm when applied to the coefficients of (19). An observation worthy of note is that in the regular case the polynomials <math>f_1(\omega)\,</math> and <math>f_2(\omega)\,</math> have as the highest common factor <math>f_{n+1}(\omega)\,</math> and thus there will be <math>n\,</math> polynomials in the chain <math>f_1(x),f_2(x), \dots, f_m(x)\,</math>.
 
 
Note now, that in determining the signs of the members of the sequence of polynomials <math>f_1(x),f_2(x), \dots,f_m(x)\,</math> that at <math>\omega = \pm \infty\,</math> the dominating power of <math>\omega\,</math> will be the first term of each of these polynomials, and thus only these coefficients corresponding to the highest powers of <math>\omega\,</math> in <math>f_1(x),f_2(x), \dots</math>, and <math>f_m(x)\,</math>, which are <math>a_0\,</math>, <math>b_0\,</math>, <math>c_0\,</math>, <math>d_0\,</math>, ... determine the signs of <math>f_1(x)\,</math>, <math>f_2(x)\,</math>, ..., <math>f_m(x)\,</math> at <math>\omega = \pm\infty\,</math>.
 
 
So we get <math>V(+\infty)=V(a_0, b_0, c_0, d_0, \dots)\,</math> that is, <math>V(+\infty)\,</math> is the number of changes of sign in the sequence <math>a_0\infty^n\,</math>, <math>b_0\infty^{n-1}\,</math>, <math>c_0\infty^{n-2}\,</math>, ... which is the number of sign changes in the sequence <math>a_0\,</math>, <math>b_0\,</math>, <math>c_0\,</math>, <math>d_0\,</math>, ... and <math>V(-\infty)=V(a_0, -b_0, c_0, -d_0, ...)\,</math>; that is <math>V(-\infty)\,</math> is the number of changes of sign in the sequence <math>a_0(-\infty)^n\,</math>, <math>b_0(-\infty)^{n-1}\,</math>, <math>c_0(-\infty)^{n-2}\,</math>, ... which is the number of sign changes in the sequence <math>a_0\,</math>, <math>-b_0\,</math>, <math>c_0\,</math>, <math>-d_0\,</math>, ...
 
 
Since our chain <math>a_0\,</math>, <math>b_0\,</math>, <math>c_0\,</math>, <math>d_0\,</math>, ... will have <math>n\,</math> members it is clear that <math>V(+\infty) + V(-\infty) = n\,</math> since within <math>V(a_0, b_0, c_0, d_0, \dots)\,</math> if going from <math>a_0\,</math> to <math>b_0\,</math> a sign change has not occurred, within
<math>V(a_0, -b_0, c_0, -d_0, \dots)\,</math> going from <math>a_0\,</math> to <math>-b_0\,</math> one has, and likewise for all <math>n\,</math> transitions (there will be no terms equal to zero) giving us <math>n\,</math> total sign changes.
 
 
As <math>\Delta = V(-\infty) - V(+\infty)\,</math> and <math>n = V(+\infty) + V(-\infty)\,</math>, and from (17) <math>P = (n - \Delta/2)\,</math>, we have that <math>P = V(+\infty) = V(a_0, b_0, c_0, d_0, \dots)\,</math> and have derived Routh's theorem -
 
 
'''''The number of roots of a real polynomial <math>f(z)\,</math> which lie in the right half plane <math>\mathfrak{Re}(r_i) > 0\,</math> is equal to the number of changes of sign in the first column of the Routh scheme.'''''
 
 
And for the stable case where <math>P = 0\,</math> then <math>V(a_0, b_0, c_0, d_0, \dots) = 0\,</math> by which we have Routh's famous criterion:
 
 
'''''In order for all the roots of the polynomial <math>f(z)\,</math> to have negative real parts, it is necessary and sufficient that all of the elements in the first column of the Routh scheme be different from zero and of the same sign.'''''
 
 
 
 
==References==
*Hurwitz, A., "On the Conditions under which an Equation has only Roots with Negative Real Parts", Rpt. in Selected Papers on Mathematical Trends in Control Theory, Ed. R. T. Ballman et alNew York: Dover 1964
*Routh, E. J., A Treatise on the Stability of a Given State of Motion.  London: Macmillan, 1877.  Rpt. in Stability of Motion, Ed. A. T. Fuller.  London: Taylor & Francis, 1975
*Gantmacher, F.R., Applications of the Theory of Matrices.  Trans. J. L. Brenner et al.  New York: Interscience, 1959
 
[[Category:Article proofs]]
[[Category:Control theory]]
[[Category:Signal processing]]
[[Category:Polynomials]]

Latest revision as of 01:51, 20 December 2013

Template:No footnotes

The Routh array is a tabular method permitting one to establish the stability of a system using only the coefficients of the characteristic polynomial. Central to the field of control systems design, the Routh–Hurwitz theorem and Routh array emerge by using the Euclidean algorithm and Sturm's theorem in evaluating Cauchy indices.

The Cauchy index

Given the system:


f(x)=a0xn+a1xn1++an(1)=(xr1)(xr2)(xrn)(2)


Assuming no roots of f(x)=0 lie on the imaginary axis, and letting


N = The number of roots of f(x)=0 with negative real parts, and
P = The number of roots of f(x)=0 with positive real parts


then we have


N+P=n(3)


Expressing f(x) in polar form, we have


f(x)=ρ(x)ejθ(x)(4)


where


ρ(x)=Re2[f(x)]+Im2[f(x)](5)


and


θ(x)=tan1(Im[f(x)]/Re[f(x)])(6)


from (2) note that


θ(x)=θr1(x)+θr2(x)++θrn(x)(7)


where


θri(x)=(xri)(8)


Now if the ith root of f(x)=0 has a positive real part, then (using the notation y=(RE[y],IM[y]))


θri(x)|x=j=(xri)|x=j=(0Re[ri],Im[ri])=(Re[ri],)=limϕtan1ϕ=π2(9)


and


θri(x)|x=j=(Re[ri],)=limϕtan1ϕ=π2(10)


Similarly, if the ith root of f(x)=0 has a negative real part,


θri(x)|x=j=(Re[ri],)=limϕtan1ϕ=π2(11)


and


θri(x)|x=j=(Re[ri],)=limϕtan1ϕ=π2(12)


Therefore, θri(x)|x=jx=j=π when the ith root of f(x) has a positive real part, and θri(x)|x=jx=j=π when the ith root of f(x) has a negative real part. Alternatively,


θ(x)|x=j=(xr1)|x=j+(xr2)|x=j++(xrn)|x=j=π2Nπ2P(13)


and


θ(x)|x=j=(xr1)|x=j+(xr2)|x=j++(xrn)|x=j=π2N+π2P(14)


So, if we define


Δ=1πθ(x)|jj(15)


then we have the relationship


NP=Δ(16)


and combining (3) and (16) gives us


N=n+Δ2 and P=nΔ2(17)


Therefore, given an equation of f(x) of degree n we need only evaluate this function Δ to determine N, the number of roots with negative real parts and P, the number of roots with positive real parts.


Graph of θ versus tan(θ)
Figure 1
tan(θ) versus θ


Equations (13) and (14) show that at x=±, θ=θ(x) is an integer multiple of π/2. Note now, in accordance with (6) and Figure 1, the graph of tan(θ) vs θ, that varying x over an interval (a,b) where θa=θ(x)|x=ja and θb=θ(x)|x=jb are integer multiples of π, this variation causing the function θ(x) to have increased by π, indicates that in the course of travelling from point a to point b, θ has "jumped" from + to one more time than it has jumped from to +. Similarly, if we vary x over an interval (a,b) this variation causing θ(x) to have decreased by π, where again θ is a multiple of π at both x=ja and x=jb, implies that tanθ(x)=Im[f(x)]/Re[f(x)] has jumped from to + one more time than it has jumped from + to as x was varied over the said interval.


Thus, θ(x)|jj is π times the difference between the number of points at which Im[f(x)]/Re[f(x)] jumps from to + and the number of points at which Im[f(x)]/Re[f(x)] jumps from + to as x ranges over the interval (j,+j) provided that at x=±j, tan[θ(x)] is defined.


Graph of θ versus −cotan(θ)
Figure 2
cot(θ) versus θ


In the case where the starting point is on an incongruity (i.e. θa=π/2±iπ, i = 0, 1, 2, ...) the ending point will be on an incongruity as well, by equation (16) (since N is an integer and P is an integer, Δ will be an integer). In this case, we can achieve this same index (difference in positive and negative jumps) by shifting the axes of the tangent function by π/2, through adding π/2 to θ. Thus, our index is now fully defined for any combination of coefficients in f(x) by evaluating tan[θ]=Im[f(x)]/Re[f(x)] over the interval (a,b) = (+j,j) when our starting (and thus ending) point is not an incongruity, and by evaluating


tan[θ(x)]=tan[θ+π/2]=cot[θ(x)]=Re[f(x)]/Im[f(x)](18)


over said interval when our starting point is at an incongruity.


This difference, Δ, of negative and positive jumping incongruities encountered while traversing x from j to +j is called the Cauchy Index of the tangent of the phase angle, the phase angle being θ(x) or θ(x), depending as θa is an integer multiple of π or not.

The Routh criterion

To derive Routh's criterion, first we'll use a different notation to differentiate between the even and odd terms of f(x):


f(x)=a0xn+b0xn1+a1xn2+b1xn3+(19)


Now we have:


f(jω)=a0(jω)n+b0(jω)n1+a1(jω)n2+b1(jω)n3+(20)=a0(jω)n+a1(jω)n2+a2(jω)n4+(21)+b0(jω)n1+b1(jω)n3+b2(jω)n5+


Therefore, if n is even,


f(jω)=(1)n/2[a0ωn+a1ωn2+a2ωn4+](22)+j(1)(n/2)1[b0ωn1+b1ωn3+b2ωn5+]


and if n is odd:


f(jω)=j(1)(n1)/2[a0ωn+a1ωn2+a2ωn4+](23)+(1)(n1)/2[b0ωn1+b1ωn3+b2ωn5+]


Now observe that if n is an odd integer, then by (3) N+P is odd. If N+P is an odd integer, then NP is odd as well. Similarly, this same argument shows that when n is even, NP will be even. Equation (13) shows that if NP is even, θ is an integer multiple of π. Therefore, tan(θ) is defined for n even, and is thus the proper index to use when n is even, and similarly tan(θ)=tan(θ+π)=cot(θ) is defined for n odd, making it the proper index in this latter case.


Thus, from (6) and (22), for n even:


Δ=I+Im[f(x)]Re[f(x)]=I+b0ωn1b1ωn3+a0ωna1ωn2+(24)


and from (18) and (23), for n odd:


Δ=I+Re[f(x)]Im[f(x)]=I+b0ωn1b1ωn3+a0ωna1ωn2+(25)


Lo and behold we are evaluating the same Cauchy index for both:


Δ=I+b0ωn1b1ωn3+a0ωna1ωn2+(26)

Sturm's theorem

Sturm gives us a method for evaluating Δ=I+f2(x)f1(x). His theorem states as follows:


Given a sequence of polynomials f1(x),f2(x),,fm(x) where:


1) If fk(x)=0 then fk1(x)0, fk+1(x)0, and sign[fk1(x)]=sign[fk+1(x)]


2) fm(x)0 for <x<


and we define V(x) as the number of changes of sign in the sequence f1(x),f2(x),,fm(x) for a fixed value of x, then:


Δ=I+f2(x)f1(x)=V()V(+)(27)


A sequence satisfying these requirements is obtained using the Euclidean algorithm, which is as follows:


Starting with f1(x) and f2(x), and denoting the remainder of f1(x)/f2(x) by f3(x) and similarly denoting the remainder of f2(x)/f3(x) by f4(x), and so on, we obtain the relationships:


f1(x)=q1(x)f2(x)f3(x)(28)f2(x)=q2(x)f3(x)f4(x)fm1(x)=qm1(x)fm(x)


or in general


fk1(x)=qk1(x)fk(x)fk+1(x)


where the last non-zero remainder, fm(x) will therefore be the highest common factor of f1(x),f2(x),,fm1(x). It can be observed that the sequence so constructed will satisfy the conditions of Sturm's theorem, and thus an algorithm for determining the stated index has been developed.


It is in applying Sturm's theorem (28) to (26), through the use of the Euclidean algorithm above that the Routh matrix is formed.


We get


f3(ω)=a0b0f2(ω)f1(ω)(29)


and identifying the coefficients of this remainder by c0, c1, c2, c3, and so forth, makes our formed remainder


f3(ω)=c0ωn2c1ωn4+c2ωn6(30)


where


c0=a1a0b0b1=b0a1a1b0b0;c1=a2a0b0b2=b0a2a0b2b0;(31)


Continuing with the Euclidean algorithm on these new coefficients gives us


f4(ω)=b0c0f3(ω)f2(ω)(32)


where we again denote the coefficients of the remainder f4(ω) by d0, d1, d2, d3,


making our formed remainder


f4(ω)=d0ωn3d1ωn5+d2ωn7(33)


and giving us


d0=b1b0c0c1=c0b1b1c0c0;d1=b2b0c0c2=c0b2b0c2c0;(34)


The rows of the Routh array are determined exactly by this algorithm when applied to the coefficients of (19). An observation worthy of note is that in the regular case the polynomials f1(ω) and f2(ω) have as the highest common factor fn+1(ω) and thus there will be n polynomials in the chain f1(x),f2(x),,fm(x).


Note now, that in determining the signs of the members of the sequence of polynomials f1(x),f2(x),,fm(x) that at ω=± the dominating power of ω will be the first term of each of these polynomials, and thus only these coefficients corresponding to the highest powers of ω in f1(x),f2(x),, and fm(x), which are a0, b0, c0, d0, ... determine the signs of f1(x), f2(x), ..., fm(x) at ω=±.


So we get V(+)=V(a0,b0,c0,d0,) that is, V(+) is the number of changes of sign in the sequence a0n, b0n1, c0n2, ... which is the number of sign changes in the sequence a0, b0, c0, d0, ... and V()=V(a0,b0,c0,d0,...); that is V() is the number of changes of sign in the sequence a0()n, b0()n1, c0()n2, ... which is the number of sign changes in the sequence a0, b0, c0, d0, ...


Since our chain a0, b0, c0, d0, ... will have n members it is clear that V(+)+V()=n since within V(a0,b0,c0,d0,) if going from a0 to b0 a sign change has not occurred, within V(a0,b0,c0,d0,) going from a0 to b0 one has, and likewise for all n transitions (there will be no terms equal to zero) giving us n total sign changes.


As Δ=V()V(+) and n=V(+)+V(), and from (17) P=(nΔ/2), we have that P=V(+)=V(a0,b0,c0,d0,) and have derived Routh's theorem -


The number of roots of a real polynomial f(z) which lie in the right half plane Re(ri)>0 is equal to the number of changes of sign in the first column of the Routh scheme.


And for the stable case where P=0 then V(a0,b0,c0,d0,)=0 by which we have Routh's famous criterion:


In order for all the roots of the polynomial f(z) to have negative real parts, it is necessary and sufficient that all of the elements in the first column of the Routh scheme be different from zero and of the same sign.



References

  • Hurwitz, A., "On the Conditions under which an Equation has only Roots with Negative Real Parts", Rpt. in Selected Papers on Mathematical Trends in Control Theory, Ed. R. T. Ballman et al. New York: Dover 1964
  • Routh, E. J., A Treatise on the Stability of a Given State of Motion. London: Macmillan, 1877. Rpt. in Stability of Motion, Ed. A. T. Fuller. London: Taylor & Francis, 1975
  • Gantmacher, F.R., Applications of the Theory of Matrices. Trans. J. L. Brenner et al. New York: Interscience, 1959