Factorization and the Schur-Cohn matrix of a matrix polynomial (Q1187750)

The authors consider their Schur-Cohn theorem for matrix polynomials [Proc. Edinb. Math. Soc., II. Ser. 33, No. 3, 337-366 (1990; Zbl 0727.15009)] and the matrices associated with it. The main part of the paper is devoted to the development of a rational algorithm for finding a reflection of a column reduced matrix polynomial. The algorithm is based on the solution of two factorization problems; the reversal of matrix polynomials [see the second author, Syst. Control Lett. 14, No. 2, 103-112 (1990; Zbl 0692.93009)] and the unimodular spectral factorization of matrix trigonometric polynomials. The authors also obtain the uniqueness of the Schur-Cohn matrix in the case of non-conjugate zeros with respect to unit circle. We notice the expository introduction to the Schur-Cohn matrix theorem and the detailed exemplification of the main devices.