A computationally faster algorithm to test the stability of characteristic polynomials Online publication date: Sat, 12-Jul-2014
by Panneerselvam Kavitha; Ayyagari Ramakalyan
International Journal of Systems, Control and Communications (IJSCC), Vol. 5, No. 2, 2013
Abstract: In system theory and control, stability of a given system is an important specification; often we design controllers with stability as the highest priority. It was James Maxwell in 1867, who first showed that an examination of the coefficients of differential equations governing the system, would reveal the stability of a given system. About a decade later an English Mathematician Edward Routh and, independently after two more decades a Swiss mathematician Adolf Hurwitz attempted the problem and provided both sufficient and necessary conditions, which we popularly call today as the Routh-Hurwitz criterion. This paper examines the problem of testing the stability of a given characteristic polynomial from a purely computational perspective. More precisely, we present a computationally faster algorithm which runs in O(n), saving the running time by an order when compared to the conventional R-H criterion.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook