30 citations · 70 across the 24 of their papers we have counts for
Showing 2009 · cs.SCShow all
2 papers · 2 filters
cs.SC2009★ 6 cited
On computing the Hermite form of a matrix of differential polynomials
Mark Giesbrecht, Myung Sub Kim
Given an n x n matrix over the ring of differential polynomials F(t)[\D;δ], we show how to compute the Hermite form H of A, and a unimodular matrix U such that UA=H. The algorithm…
cs.SC2009★ 1 cited
Detecting lacunary perfect powers and computing their roots
Mark Giesbrecht, Daniel S. Roche
We consider solutions to the equation f = h^r for polynomials f and h and integer r > 1. Given a polynomial f in the lacunary (also called sparse or super-sparse) representation, w…