Algorithms for polynomial multidimensional spectral factorization and sum of squares
Harry L. Trentelman, D. Napp Avelli · 2007
In this paper, algorithms are developed for the problems of spectral factorization and sum of squares of polynomial matrices with n indeterminates. These algorithms are based on the calculus of 2n-variable polynomial matrices and their associated quadratic differential forms, and share the common feature that the problems are lifted from the original n-variable polynomial context to a 2n-variable polynomial context. This allows to reduce the spectral factorization problem and the sum of squares problem to linear matrix inequalities (LMI's) and factorizations of a constant matrices.