7 citations · 10 across the 4 of their papers we have counts for
7 papers · 1 filter
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix
George Labahn, Vincent Neiger, Thi Xuan Vu +1
Consider a matrix of univariate polynomials over a field . We study the problem of computing the column rank profile of $\ma…
Bohemian Matrix Geometry
Robert M. Corless, George Labahn, Dan Piponi +1
A Bohemian matrix family is a set of matrices all of whose entries are drawn from a fixed, usually discrete and hence bounded, subset of a field of characteristic zero. Originally…
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{…
Efficient q-Integer Linear Decomposition of Multivariate Polynomials
Mark Giesbrecht, Hui Huang, George Labahn +1
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hyper…
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…