A fraction free matrix Berlekamp/Massey algorithm

DOI10.1016/j.laa.2013.06.016zbMath1380.16050OpenAlexW2075855683WikidataQ57425279 ScholiaQ57425279MaRDI QIDQ2435413

George Yuhasz, Erich L. Kaltofen

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.06.016

zbMATH Keywords

integer sequenceslinear recurrencesblock Toeplitz systemsblock Hankel systemsmatrix recurrencesexact division

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Computational aspects of associative rings (general theory) (16Z05)

Related Items

Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Common factors in fraction-free matrix decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of computing determinants
• Early termination in sparse interpolation algorithms
• Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
• On the matrix berlekamp-massey algorithm
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• The Subresultant PRS Algorithm
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• A minimal realization algorithm for matrix sequences
• Subresultants and Reduced Polynomial Remainder Sequences
• Shift-register synthesis and BCH decoding
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants