Computing GCRDs of approximate differential polynomials. - Mark Giesbrecht; Joseph Haraldson (SNC, 2014)

Computing the Nearest Rank-Deficient Matrix Polynomial. - Mark Giesbrecht; Joseph Haraldson; George Labahn (ISSAC, 2017)

Computing Nearby Non-trivial Smith Forms. - Mark Giesbrecht; Joseph Haraldson; George Labahn (ISSAC, 2018)

Computing Approximate Greatest Common Right Divisors of Differential Polynomials. - Mark Giesbrecht; Joseph Haraldson; Erich L. Kaltofen (Found. Comput. Math., 2020)

Computing lower rank approximations of matrix polynomials. - Mark Giesbrecht; Joseph Haraldson; George Labahn (J. Symb. Comput., 2020)