Joseph Haraldson

According to our database, Joseph Haraldson authored at least 5 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Computing lower rank approximations of matrix polynomials.

Mark Giesbrecht, Joseph Haraldson, George Labahn

J. Symb. Comput., 2020

Computing Approximate Greatest Common Right Divisors of Differential Polynomials.

Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen

Found. Comput. Math., 2020

2018

Computing Nearby Non-trivial Smith Forms.

Mark Giesbrecht, Joseph Haraldson, George Labahn

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

Computing the Nearest Rank-Deficient Matrix Polynomial.

Mark Giesbrecht, Joseph Haraldson, George Labahn

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2014

Computing GCRDs of approximate differential polynomials.

Mark Giesbrecht, Joseph Haraldson

Proceedings of the Symbolic-Numeric Computation 2014, 2014