z-logo
open-access-imgOpen Access
Stable Factorization of Strictly Hurwitz Polynomials
Author(s) -
Ömer Eğecioǧlu,
Binboğa Sıddık Yarman
Publication year - 2010
Publication title -
international journal of computers communications and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.422
H-Index - 33
eISSN - 1841-9844
pISSN - 1841-9836
DOI - 10.15837/ijccc.2010.5.2229
Subject(s) - factorization , hurwitz polynomial , factorization of polynomials , polynomial , mathematics , variable (mathematics) , set (abstract data type) , function (biology) , quadratic equation , dixon's factorization method , quadratic function , pure mathematics , algebra over a field , computer science , algorithm , matrix polynomial , mathematical analysis , geometry , evolutionary biology , biology , programming language
We propose a stable factorization procedure to generate a strictly Hurwitz polynomial from a given strictly positive even polynomial. This prob- lem typically arises in applications involving real frequency techniques. The proposed method does not require any root finding algorithm. Rather, the factorization process is directly carried out to find the solution of a set of quadratic equations in multiple variables employing Newton's method. The selection of the starting point for the iterations is not arbitrary, and involves interrelations among the coefficients of the set of solution polynomials differing only in the signs of their roots. It is hoped that this factorization technique will provide a motivation to perform the factorization of two-variable positive function to generate scattering Hurwitz polynomials in two variables for which root finding methods are not applicable.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom