Back close

A computationally faster algorithm to test the stability of characteristic polynomials

Publication Type : Journal Article

Publisher : Int. J. Systems, Control and Communications

Source : Int. J. Systems, Control and Communications ( Vol. 5, No. 2, pp.166 -176), 2013

Url : https://www.researchgate.net/publication/262277582_A_computationally_faster_algorithm_to_test_the_stability_of_characteristic_polynomials

Campus : Chennai

School : School of Engineering

Department : Mechanical Engineering

Year : 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 saving the running time by an order when compared to the conventional R-H criterion.

Cite this Research Publication : Kavitha, P. and Ramakalyan, A. “A computationally faster algorithm to test the stability of characteristic polynomials”, Int. J. Systems, Control and Communications ( Vol. 5, No. 2, pp.166 -176), 2013

Admissions Apply Now