In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
From MaRDI portal
Publication:2188986
Abstract: The Berlekamp--Massey--Sakata algorithm and the Scalar-FGLM algorithm both compute the ideal of relations of a multidimensional linear recurrent sequence.Whenever quering a single sequence element is prohibitive, the bottleneck of these algorithms becomes the computation of all the needed sequence terms. As such, having adaptive variants of these algorithms, reducing the number of sequence queries, becomes mandatory.A native adaptive variant of the Scalar-FGLM algorithm was presented by its authors, the so-called Adaptive Scalar-FGLM algorithm.In this paper, our first contribution is to make the Berlekamp--Massey--Sakata algorithm more efficient by making it adaptive to avoid some useless relation test-ings. This variant allows us to divide by four in dimension 2 and by seven in dimension 3 the number of basic operations performed on some sequence family.Then, we compare the two adaptive algorithms. We show that their behaviors differ in a way that it is not possible to tweak one of the algorithms in order to mimic exactly the behavior of the other. We detail precisely the differences and the similarities of both algorithms and conclude that in general the Adaptive Scalar-FGLM algorithm needs fewer queries and performs fewer basic operations than the Adaptive Berlekamp--Massey--Sakata algorithm.We also show that these variants are always more efficient than the original algorithms.
Recommendations
- On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms
- Polynomial-division-based algorithms for computing linear recurrence relations
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Guessing Gröbner bases of structured ideals of relations of sequences
- The Berlekamp-Massey algorithm revisited
Cites work
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- A fraction free matrix Berlekamp/Massey algorithm
- A polynomial-division-based algorithm for computing linear recurrence relations
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- Basic analytic combinatorics of directed lattice paths
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- Decoding of differential AG codes
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel–Pellikaan Bound
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Guessing linear recurrence relations of sequence tuplesand P-recursive sequences with linear algebra
- Ideals, Varieties, and Algorithms
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- On 3-dimensional lattice walks confined to the positive octant
- On a class of error correcting binary group codes
- On the matrix Berlekamp-Massey algorithm
- Shift-register synthesis and BCH decoding
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Sparse FGLM algorithms
- The BMS Algorithm
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- The dynamic dictionary of mathematical functions (DDMF)
- Using Algebraic Geometry
- Walks confined in a quadrant are not always D-finite
- Walks with small steps in the quarter plane
Cited in
(3)
This page was built for publication: In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188986)
