Liénard–Chipart criterion

From HandWiki
Revision as of 07:00, 27 June 2023 by LinXED (talk | contribs) (add)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Criterion on Control System Theory

In control system theory, the Liénard–Chipart criterion is a stability criterion modified from the Routh–Hurwitz stability criterion, proposed by A. Liénard and M. H. Chipart.[1] This criterion has a computational advantage over the Routh–Hurwitz criterion because it involves only about half the number of determinant computations.[2]

Algorithm

The Routh–Hurwitz stability criterion says that a necessary and sufficient condition for all the roots of the polynomial with real coefficients

[math]\displaystyle{ f(z) = a_0 z^n + a_1 z^{n-1} + \cdots + a_n \, (a_0 \gt 0) }[/math]

to have negative real parts (i.e. [math]\displaystyle{ f }[/math] is Hurwitz stable) is that

[math]\displaystyle{ \Delta_1 \gt 0,\, \Delta_2 \gt 0, \ldots, \Delta_n \gt 0, }[/math]

where [math]\displaystyle{ \Delta_i }[/math] is the i-th leading principal minor of the Hurwitz matrix associated with [math]\displaystyle{ f }[/math].

Using the same notation as above, the Liénard–Chipart criterion is that [math]\displaystyle{ f }[/math] is Hurwitz stable if and only if any one of the four conditions is satisfied:

  1. [math]\displaystyle{ a_n\gt 0,a_{n-2}\gt 0, \ldots;\, \Delta_{1}\gt 0,\Delta_3\gt 0,\ldots }[/math]
  2. [math]\displaystyle{ a_n\gt 0,a_{n-2}\gt 0, \ldots;\, \Delta_{2}\gt 0,\Delta_4\gt 0,\ldots }[/math]
  3. [math]\displaystyle{ a_n\gt 0,a_{n-1}\gt 0,a_{n-3} \gt 0, \ldots;\, \Delta_1\gt 0,\Delta_3\gt 0,\ldots }[/math]
  4. [math]\displaystyle{ a_n\gt 0,a_{n-1}\gt 0,a_{n-3} \gt 0, \ldots;\, \Delta_2\gt 0,\Delta_4\gt 0,\ldots }[/math]

Hence one can see that by choosing one of these conditions, the number of determinants required to be evaluated is reduced.

Alternatively Fuller formulated this as follows for (noticing that [math]\displaystyle{ \Delta_1\gt 0 }[/math] is never needed to be checked):

[math]\displaystyle{ a_n\gt 0,a_{1}\gt 0, a_{3}\gt 0, a_{5}\gt 0, \ldots; }[/math]

[math]\displaystyle{ \Delta_{n-1}\gt 0,\Delta_{n-3}\gt 0,\Delta_{n-5}\gt 0,\ldots,\{\Delta_3\gt 0 \ (n \ even)\, \Delta_2\gt 0 \ (n \ odd)\}. }[/math]

This means if n is even, the second line ends in [math]\displaystyle{ \Delta_3\gt 0 }[/math] and if n is odd, it ends in [math]\displaystyle{ \Delta_2\gt 0 }[/math] and so this is just 1. condition for odd n and 4. condition for even n from above. The first line always ends in [math]\displaystyle{ a_n }[/math], but [math]\displaystyle{ a_{n-1}\gt 0 }[/math] is also needed for even n.

References

  1. Liénard, A.; Chipart, M. H. (1914). "Sur le signe de la partie réelle des racines d'une équation algébrique". J. Math. Pures Appl. 10 (6): 291–346. 
  2. Felix Gantmacher (2000). The Theory of Matrices. 2. American Mathematical Society. pp. 221–225. ISBN 0-8218-2664-6. 

External links