Splitting of some s-domain stability-test algorithms

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 families of algorithms, which include the standard Routh algorithm and an s-domain Levinson-like algorithm respectively. The related split forms are analysed and compared. Their complexity can be reduced by suitably choosing some scaling factors. It turns out that the usual form of the Routh algorithm, which is intrinsically split, and the simplified version of the split Levinson-like algorithm are substantially equivalent and superior to any other possible split algorithm.