scientific article; zbMATH DE number 4118432

MaRDI QIDQ4732508zbMATH OpenFDO

Authors Patrick Fitzpatrick, G. H. Norton

Publication date 1989

zbMATH Keywords

minimal polynomialfactorial domainlinear recurring sequencesalgorithm MINPOLCollins subresultant algorithmextended polynomial remainder sequence (XPRS) algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over commutative rings (13B25) Recurrences (11B37) Integral domains (13G05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
• On shortest linear recurrences
• Gröbner bases of characteristic ideals of LRS over UFD
• On constructing a shortest linear recurrence relation
• On the minimal realizations of a finite sequence

Cited in

(6)

• Vectorization of Linear Recurrence Relations
• The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
• An algorithm for proving arbitrary identities involving linear recurrence sequences
• Linear recurring sequences for computing the resultant of multivariate polynomials
• Efficient computation of terms of linear recurrence sequences of any order
• An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732508)