A simple proof of the Routh test

Citation
A. Ferrante et al., A simple proof of the Routh test, IEEE AUTO C, 44(6), 1999, pp. 1306-1309
Citations number
8
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN journal
00189286 → ACNP
Volume
44
Issue
6
Year of publication
1999
Pages
1306 - 1309
Database
ISI
SICI code
0018-9286(199906)44:6<1306:ASPOTR>2.0.ZU;2-H
Abstract
An elementary proof of the classic Routh method for counting the number of left half-plane and right half-plane zeroes of a real coefficient polynomia l P-n(s) of degree n is given. Such a proof refers to the polynomials P-i(s ) of degree i less than or equal to n formed from the entries of the rows o f order i and i - 1 of the relevant Routh array. In particular, it is based on the consideration of an auxiliary polynomial (P) over cap(i)(s; q), lin early dependent on a real parameter q, which reduces to either polynomial P -i(s) or to polynomial Pi-1(s) for particular values of q. In this way, it is easy to show that i - 1 zeroes of P-i(s) lie in the same half-plane as t he zeroes of Pi-1(s), and the remaining zero lies in the left or in the rig ht half-plane according to the sign of the ratio of the leading coefficient s of P-i(s) and Pi-1(s). By successively applying this property to all pair s of polynomials in the sequence, starting from P-0(s) and P-1(s), the stan dard rule for determining the zero distribution of P-n(s) is immediately de rived.