30 citations · 70 across the 24 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SC2017
Computing Lower Rank Approximations of Matrix Polynomials
Mark Giesbrecht, Joseph Haraldson, George Labahn
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified…
cs.SC2017
Computing Approximate Greatest Common Right Divisors of Differential Polynomials
Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen
Differential (Ore) type polynomials with "approximate" polynomial coefficients are introduced. These provide an effective notion of approximate differential operators, with a stron…