Dr. Joseph Haraldson

PhD in Computer Science, Symbolic Computation Group, from the University of Waterloo.

Research

  1. Matrix Polynomials and their Lower Rank Approximations – PhD Thesis
  2. Computing Nearby Non-Trivial Smith Forms – Journal Preprint (ISSAC'18) Slides
  3. Lower Rank Approximations of Matrix Polynomials – Journal of Symbolic Computation Slides
  4. Computing the Nearest Singular Matrix Polynomial – ISSAC'17
  5. Computing Approximate Greatest Common Right Divisors of Differential Polynomials – Masters Thesis (Foundations of Computational Mathematics) (SNC'14)

Implementations

  1. PhD Thesis Code Some examples appearing in my PhD thesis.
  2. Computing the Nearest Singular Matrix Polynomial Some examples appearing in the conference paper.
  3. Computing Nearby Non-Trivial Smith Forms – Some examples appearing in the conference paper.
  4. Approximate GCRD – Some examples appearing in my M.Math thesis.