The procedures of Routh-Hurwitz and Schur-Cohn for determining the zero-distribution of
polynomials with respect to the imaginary axis and the unit circle, respectively, serve, at the …

A general theory of tabular form root distribution procedures based on LDL* factorization of
Bezoutians has been presented in this paper. In particular, we have concentrated on the …

A number of stability-test algorithms for linear continuous-time systems are presented in a
unified manner, which is based on a general recursive relation for generating a sequence of …

A simple geometrical proof of the classical Routh test is presented. It is based on the
application of the root locus technique to suitable additive polynomial decompositions. The …

Triangular factorization, solution to linear equations, inversion, computation of rank profile
and inertia (in the Hermitian case) etc. of general $ n\times\n $ matrices require O ($ n\sp3 $) …

Some classic s-domain algorithms are first expressed in a unified form. From this, all
possible split forms are then derived and classified. In particular, attention is focused on two …

A general theory of tabular form root distribution procedures based on LDL* factorization of
Bezoutians is presented. In particular, the authors concentrate on the singular cases arising …

It is shown how a stability test, alternative to the classical Routh test, can profitably be
applied to check the presence of polynomial roots inside half-planes or even sectors of the …

An algorithm for generating a sequence of polynomials of descending degree is illustrated.
This algorithm becomes the usual Euclid algorithm for particular parameter values. A split …

Most stability-test procedures are based on a recursion relation that, starting from a given
characteristic polynomial, generates a sequence of polynomials Pi (s) of descending degree …