This note presents an algorithm for finding the solution

of the matrix polynomial equation

. Since the solution, when it exists, is not unique we will find the solution for which the rows of

have a minimal possible degree. This procedure will result in a unique solution that is obtained by solving a set of linear equations. An example is given to illustrate the procedure.