RouthProof2

RouthProof2 - 1306 IEEE TRANSACTIONS ON AUTOMATIC CONTROL...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1306 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO. 6, JUNE 1999 A Simple Proof of the Routh Test A. Ferrante, A. Lepschy, and U. Viaro Abstract— An elementary proof of the classic Routh method for count- ing the number of left half-plane and right half-plane zeroes of a real coefficient polynomial P n @ s A of degree n is given. Such a proof refers to the polynomials P i @ s A of degree i n formed from the entries of the rows of order i and i I of the relevant Routh array. In particular, it is based on the consideration of an auxiliary polynomial P i @ s Y q A , linearly dependent on a real parameter q , which reduces to either polynomial P i @ s A or to polynomial P i I @ s A for particular values of q . In this way, it is easy to show that i I zeroes of P i @ s A lie in the same half-plane as the zeroes of P i I @ s A , and the remaining zero lies in the left or in the right half-plane according to the sign of the ratio of the leading coefficients of P i @ s A and P i I @ s A . By successively applying this property to all pairs of polynomials in the sequence, starting from P H @ s A and P I @ s A , the standard rule for determining the zero distribution of P n @ s A is immediately derived. Index Terms— Continuous curves, Routh test, stability, zeroes of poly- nomials. I. INTRODUCTION Most undergraduate control courses, and the related textbooks, include the Routh–Hurwitz stability criterion. A recent survey [1], conducted by the Working Group on Curriculum Development of the IEEE Control Systems Society, shows that this topic is covered in 93% of Electrical Engineering departments and 89% of Mechanical Engineering departments. The proof of the criterion, however, is very often omitted, or it is limited to the “stability” condition, stating that the sign of the leading elements of all rows in the Routh array must be the same; very seldomly is it proved that the number of the left half-plane (LHP) zeroes of the considered polynomial is equal to the number of sign permanencies between consecutive entries encountered along the first column of the table and that the number of the right half-plane (RHP) zeroes to that of the sign variations. The classical proofs available in the literature are diverse; the main approaches are based on Cauchy’s indexes and Sturm sequences, on continued fraction expansions, on the Hermite–Biehler theorem, and on the second method of Lyapunov (cf., e.g., [2]–[4]). The importance of the topic and the complexity of the mathematical tools required in most of the above proofs motivate the continual interest in the subject (see, e.g., [5]). Furthermore, the critical cases in the construction of the Routh table are usually treated in a fashion that bears no relation to the proof. Another reason why the proofs are often omitted in standard textbooks is that they give little insight into the nature of the algorithm.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/10/2010 for the course MAE 19170 taught by Professor Bobrow during the Fall '08 term at UC Irvine.

Page1 / 4

RouthProof2 - 1306 IEEE TRANSACTIONS ON AUTOMATIC CONTROL...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online