Abstract
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 form of the basic recursion is derived, and a stability test is presented in table form. A geometrical proof of the rules for finding the right half-plane and left half-plane zeros of the original polynomial is given. The relationship with the Routh algorithm is pointed out. The possible use of the suggested algorithm for flexible model reduction is also outlined.
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.
