18 citations · 23 across the 5 of their papers we have counts for
7 papers
Fast computation of approximant bases in canonical form
Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard
In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our…
On matrices with displacement structure: generalized operators and faster algorithms
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron +1
For matrices with displacement structure, basic operations like multiplication, inversion, and linear system solving can all be expressed in terms of the following task: evaluate t…
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
Claude-Pierre Jeannerod, Vincent Neiger, Eric Schost +1
We compute minimal bases of solutions for a general interpolation problem, which encompasses Hermite-Padé approximation and constrained multivariate interpolation, and has applicat…
Computing minimal interpolation bases
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost +1
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are…
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations
Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger +2
The interpolation step in the Guruswami-Sudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear al…
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann
Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of c…