Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
