z-logo
Premium
A fast and reliable computer program for the accurate hurwitz factorization of a polynomial
Author(s) -
Eckelmann Gerd
Publication year - 1979
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490070106
Subject(s) - hurwitz polynomial , routh–hurwitz stability criterion , polynomial , factorization of polynomials , factorization , decomposition , product (mathematics) , matrix polynomial , stable polynomial , computer program , computer science , square free polynomial , reciprocal polynomial , algebra over a field , mathematics , algorithm , pure mathematics , programming language , mathematical analysis , geometry , ecology , biology
A method is explained for the decomposition of an even polynomial into the product of a Hurwitz polynomial and an Anti‐Hurwitz polynomial. This problem arises, for instance, in network synthesis. A computer program is presented and its application is explained. Several examples show the properties of the proposed method.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here