4 papers
Faster modular composition using two relation matrices
Vincent Neiger, Bruno Salvy, Éric Schost +1
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem…
Computing Krylov iterates in the time of matrix multiplication
Vincent Neiger, Clément Pernet, Gilles Villard
Krylov methods rely on iterated matrix-vector products for an matrix and vectors . The space spanned by all iterates admits a pa…
Faster Modular Composition
Vincent Neiger, Bruno Salvy, Éric Schost +1
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by ,…
Computing the Kalman form
Clément Pernet, Aude Rondepierre, Gilles Villard
We present two algorithms for the computation of the Kalman form of a linear control system. The first one is based on the technique developed by Keller-Gehrig for the computation…