Dr. Joseph Haraldson
PhD in Computer Science, Symbolic Computation Group, from the University of Waterloo.
Research

Matrix Polynomials and their Lower Rank Approximations – PhD Thesis

Computing Nearby NonTrivial Smith Forms – Journal Preprint (ISSAC'18) Slides

Lower Rank Approximations of Matrix Polynomials – Journal of Symbolic Computation Slides

Computing the Nearest Singular Matrix Polynomial – ISSAC'17
 Computing Approximate Greatest Common Right Divisors of Differential Polynomials –
Masters Thesis
(Foundations of Computational Mathematics)
(SNC'14)
Implementations

PhD Thesis Code Some examples appearing in my PhD thesis.

Computing the Nearest Singular Matrix Polynomial Some examples appearing in the conference paper.

Computing Nearby NonTrivial Smith Forms – Some examples appearing in the conference paper.

Approximate GCRD – Some examples appearing in my M.Math thesis.