Pages that link to "Item:Q820938"
From MaRDI portal
The following pages link to Polynomial-division-based algorithms for computing linear recurrence relations (Q820938):
Displaying 8 items.
- Finding recursions for multidimensional arrays (Q1854502) (← links)
- Recursive computation of discrete Legendre polynomial coefficients (Q1915489) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations (Q4974030) (← links)
- Fast Algorithm for Border Bases of Artinian Gorenstein Algebras (Q5119958) (← links)
- A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations (Q5120181) (← links)