A Heuristic Method for Solving Polynomial Matrix Equations

Abstract

We propose a heuristic method to solve polynomial matrix equations of the type ∑𝑚𝑘=1𝑎𝑘𝑋𝑘=𝐵 , where 𝑎𝑘 are scalar coefficients and X and B are square matrices of order n. The method is based on the decomposition of the B matrix as a linear combination of the identity matrix and an idempotent, involutive, or nilpotent matrix. We prove that this decomposition is always possible when 𝑛=2. Moreover, in some cases we can compute solutions when we have an infinite number of them (singular solutions). This method has been coded in MATLAB and has been compared to other methods found in the existing literature, such as the diagonalization and the interpolation methods. It turns out that the proposed method is considerably faster than the latter methods. Furthermore, the proposed method can calculate solutions when diagonalization and interpolation methods fail or calculate singular solutions when these methods are not capable of doing so.