Computing Lower Rank Approximations of Matrix Polynomials

Mark Giesbrecht, Joseph Haraldson, George Labahn

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified…