15 citations · 33 across the 5 of their papers we have counts for
13 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…
Faster change of order algorithm for Gröbner bases under shape and stability assumptions
Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din
Solving zero-dimensional polynomial systems using Gröbner bases is usually done by, first, computing a Gröbner basis for the degree reverse lexicographic order, and next computing…
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer…
Deterministic computation of the characteristic polynomial in the time of matrix multiplication
Vincent Neiger, Clément Pernet
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multip…
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
Vincent Neiger, Johan Rosenkilde, Grigory Solomatov
Suppose is a large enough field and is a fixed, generic set of points which is available for precomputation. We introduce a techniqu…
A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension
Simone Naldi, Vincent Neiger
Let be elements in a quotient which has finite dimension as a -vector space, where and is an -submodule of . We ad…