A Fast Fraction-free Method to Solve the Routh-hurwitz Problem
Wan Jin-feng · Journal of Shanxi Teachers University · 2005
In this paper, we provide a fast franction-free method to solve the Routh-Hurwitz problem for integer polynomial f(x) of degree, where the polynomial is squarefree and monic, we will use O(n~2) arithmetic operations and involves integers having at most O(n log nc bits, where is an upper bound of the module of the integer entries of a Bezout matrix. In order to address the stability problems, we use exact arithmetic only.