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…