Spectral factorization of non-symmetric polynomial matrices

✍ Scribed by Jovan Stefanovski

• Publisher: Elsevier Science
• Year: 2006
• Tongue: English
• Weight: 275 KB
• Volume: 412
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/j.laa.2005.07.009

✦ Synopsis

The topic of the paper is spectral factorization of rectangular and possibly non-full-rank polynomial matrices. To each polynomial matrix we associate a matrix pencil by direct assignment of the coefficients. The associated matrix pencil has its finite generalized eigenvalues equal to the zeros of the polynomial matrix. The matrix dimensions of the pencil we obtain by solving an integer linear programming (ILP) minimization problem. Then by extracting a deflating subspace of the pencil we come to the required spectral factorization. We apply the algorithm to most general-case of inner-outer factorization, regardless continuous or discrete time case, and to finding the greatest common divisor of polynomial matrices.