Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts

by   Claude-Pierre Jeannerod, et al.

We compute minimal bases of solutions for a general interpolation problem, which encompasses Hermite-Padé approximation and constrained multivariate interpolation, and has applications in coding theory and security. This problem asks to find univariate polynomial relations between m vectors of size σ; these relations should have small degree with respect to an input degree shift. For an arbitrary shift, we propose an algorithm for the computation of an interpolation basis in shifted Popov normal form with a cost of O(m^ω-1σ) field operations, where ω is the exponent of matrix multiplication and the notation O(·) indicates that logarithmic terms are omitted. Earlier works, in the case of Hermite-Padé approximation and in the general interpolation case, compute non-normalized bases. Since for arbitrary shifts such bases may have size Θ(m^2 σ), the cost bound O(m^ω-1σ) was feasible only with restrictive assumptions on the shift that ensure small output sizes. The question of handling arbitrary shifts with the same complexity bound was left open. To obtain the target cost for any shift, we strengthen the properties of the output bases, and of those obtained during the course of the algorithm: all the bases are computed in shifted Popov form, whose size is always O(m σ). Then, we design a divide-and-conquer scheme. We recursively reduce the initial interpolation problem to sub-problems with more convenient shifts by first computing information on the degrees of the intermediate bases.


page 1

page 2

page 3

page 4


Computing minimal interpolation bases

We consider the problem of computing univariate polynomial matrices over...

Fast computation of approximant bases in canonical form

In this article, we design fast algorithms for the computation of approx...

Computing Canonical Bases of Modules of Univariate Relations

We study the computation of canonical bases of sets of univariate relati...

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings and its Application in Coding Theory

Skew polynomials are a class of non-commutative polynomials that have se...

A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension

Let f_1,…,f_m be elements in a quotient R^n / N which has finite dimensi...

Certification of minimal approximant bases

Considering a given computational problem, a certificate is a piece of a...

Computer-Aided Generation of N-shift RWS

Generating schedules for shift workers is essential for many employers, ...

Please sign up or login with your details

Forgot password? Click here to reset