An iterative approach to solving the polynomial Bezout identity

Using the generalized state-space concepts, a simple and iterative algorithm for finding the polynomial matrix solutions to the well known polynomial Bezout identity is developed. The polynomial Bezout identity plays a central role in systems design and analysis while using polynomial fractional approaches. The initial values needed in this algorithm are only two constant matrices which can be selected at random. From the computational point of view, the method presented seems to be easier than the approaches in the literature. Illustrative examples are included.<
>