• Corpus ID: 43201764

# Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications)

@inproceedings{Neiger2016BasesOR,
title={Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications)},
author={Vincent Neiger},
year={2016}
}
In this thesis, we study algorithms for a problem of finding relations in one or several variables. It generalizes that of computing a solution to a system of linear modular equations over a polynomial ring, including in particular the computation of Hermite-Pade approximants and bivariate interpolants. Rather than a single solution, we aim at computing generators of the solution set which have good properties. Precisely, the input of our problem consists of a finite-dimensional module…

## Figures and Tables from this paper

A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
• Mathematics, Computer Science
ISSAC
• 2020
A divide-and-conquer algorithm is designed which can be interpreted as a generalization to several variables of Beckermann and Labahn's recursive approach for matrix Padé and rational interpolation problems and improves upon the best known complexity bounds.
Computing Canonical Bases of Modules of Univariate Relations
• Computer Science, Mathematics
ISSAC
• 2017
The triangular shape of M is exploited to generalize a divide-and-conquer approach which originates from fast minimal approximant basis algorithms and relies on high-order lifting to perform fast modular products of polynomial matrices of the form P F mod M.
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions
• Computer Science
ISSAC
• 2022
The Hermite normal form of that matrix yields the sought lexicographic Gröbner basis, under assumptions which cover the shape position case, which improves upon both state-of-the-art complexity bounds O~(tD2) and O ~(Dω, since ω<3 and t≤D), and confirms the high practical benefit.
Certification of Minimal Approximant Bases
• Computer Science, Mathematics
ISSAC
• 2018
A certificate is proposed which, for typical instances of the problem, is computed by the prover using O(mømega D/m) additional field operations and allows verification of the approximant basis by a Monte Carlo algorithm with cost bound O( mømega + m D).
Efficient algorithms and implementation in exact linear algebra. (Algorithmes et implantations efficaces en algèbre linéaire exacte)
This paper provides an algorithm that reduces the complexity to matrix multiplication and that allows to outperform in practice the best asymptotic algorithms on a wide range of values and designs a novel approach that aims to minimize the number of synchronizations inherent to fine grained parallel computing.
Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings
• Computer Science
ArXiv
• 2022
A fast divide-and-conquer variant of K¨otter–Nielsen–Høholdt (KNH) interpolation algorithm that inputs a list of linear functionals on skew polynomial vectors, and outputs a reduced Gr¨obner basis of their kernel intersection and matches the previous best speeds for these tasks.
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices
• Mathematics, Computer Science
ISSAC
• 2018
Deterministic, fast algorithms for rectangular input matrices for normal forms for matrices over the univariate polynomials are presented.
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix
• Computer Science, Mathematics
ISSAC
• 2022
This work gives an algorithm which improves the minimal kernel basis algorithm of Zhou, Labahn, and Storjohann and provides a second algorithm which computes the column rank profile of F with a rank-sensitive complexity of O~ (rw-2n(m+d) operations in K.
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
• Computer Science
IEEE Transactions on Information Theory
• 2021
A skew-analogue of the existing PM-Basis algorithm for matrices over ordinary polynomials is described, which captures the bulk of the work in multiplication of skew polynomial rings and the complexity benefit comes from existing algorithms performing this faster than in classical quadratic complexity.

## References

SHOWING 1-10 OF 243 REFERENCES
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
• Mathematics, Computer Science
Applicable Algebra in Engineering, Communication and Computing
• 2003
This work addresses the question of speeding up the linear algebra phase for the computation of minimal polynomials and rational parametrizations in A using the A-module structure of the dual space $\widehat{A}$.
Computing minimal interpolation bases
• Computer Science
J. Symb. Comput.
• 2017
Polynomial Systems Solving by Fast Linear Algebra
• Computer Science, Mathematics
ArXiv
• 2013
The complexity of solving a polynomial system is decreased from $\widetilde{O}(D^3)$ to $D(d^\omega)$ where $D$ is the number of solutions of the system and new algorithms which rely on fast linear algebra are proposed.
A uniform approach for the fast computation of Matrix-type Padé approximants
A recurrence relation is presented for the computation of a basis for the corresponding linear solution space of these approximants, which generalizes previous work by Van Barel and Bultheel and, in a more general form, by Beckermann.
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
• Computer Science
ISSAC '11
• 2011
This work investigates the particular but important shape position case and obtains an implementation which is able to manipulate 0-dimensional ideals over a prime field of degree greater than 30000 and outperforms the Magma/Singular/FGb implementations of FGLM.
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
• Mathematics, Computer Science
SIAM J. Matrix Anal. Appl.
• 2000
A new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors, suitable for computation in exact arithmetic domains where growth of coefficients in intermediate computations is a central concern.
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
• Computer Science
IEEE Transactions on Information Theory
• 2015
This paper reduces this multivariate interpolation problem to a problem of simultaneous polynomial approximations, which is solved using fast structured linear algebra and improves the best known complexity bounds for the interpolation step of the list-decoding of Reed-Solomon codes, Parvaresh-Vardy codes, and folded Reed- Solomon codes.
Normal forms for general polynomial matrices
• Mathematics, Computer Science
J. Symb. Comput.
• 2006