2 papers
cs.SC2018
Computing Nearby Non-trivial Smith Forms
Mark Giesbrecht, Joseph Haraldson, George Labahn
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to…
cs.SC2017
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…