An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)

A simple method is presented for finding the solution (B(s)A(s)) of the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s), procedure, which involves solving a set of linear equations, and results in a unique solution for which the rows of (B(s)A(s)) have a minimal possible degree if the solution exists. An example is given to illustrate the procedure. >