7 citations · 7 across the 2 of their papers we have counts for
4 papers
Computing critical points for invariant algebraic systems
Jean-Charles Faugère, George Labahn, Mohab Safey El Din +2
Let be a field and , in be multivariate polynomials (with ) invariant under the action of $\m…
Homotopy techniques for solving sparse column support determinantal polynomial systems
George Labahn, Mohab Safey El Din, Éric Schost +1
Let be a field of characteristic zero with its algebraic closure. Given a sequence of polynomials $\mathbf{g} = (g_1, \ldots, g_s) \in \mathbf{…
Computing Nearby Non-trivial Smith Forms
Mark Giesbrecht, Joseph Haraldson, George Labahn
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to…
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…