Record Details

A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial
 
Creator AGASHE, SD
 
Subject poles and zeros
routh methods
 
Description A new Routh-like algorithm for determining the number of right-half plane (RHP) roots of a polynomial with real or complex coefficients is given. It includes the Routh algorithm for real polynomials as a special case. Moreover, the algorithm also applies directly to the singular case wherein the leading coefficient of a row, but not the entire row, vanishes, needing far fewer computations than the heuristicepsilon- method about which there was a vigorous discussion in these TRANSACTIONS a few years ago, and further not requiring investigation of an auxiliary polynomial. The algorithm is illustrated by a few examples. The proof of the algorithm is based on the Principle of the Argument, and thus also constitutes a simple proof of the Routh algorithm in the regular case.
 
Publisher IEEE
 
Date 2008-11-21T06:48:53Z
2011-11-25T12:33:46Z
2011-12-26T13:06:50Z
2011-12-27T05:54:48Z
2008-11-21T06:48:53Z
2011-11-25T12:33:46Z
2011-12-26T13:06:50Z
2011-12-27T05:54:48Z
1985
 
Type Article
 
Identifier IEEE Transactions on Automatic Control 30 (4), 406-09
0018-9286
http://hdl.handle.net/10054/78
http://dspace.library.iitb.ac.in/xmlui/handle/10054/78
 
Language en_US