Pages that link to "Item:Q1825176"
From MaRDI portal
The following pages link to A simple Hankel interpretation of the Berlekamp-Massey algorithm (Q1825176):
Displaying 16 items.
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field (Q412213) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- A fast method to diagonalize a Hankel matrix (Q1124767) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- A look-ahead algorithm for the solution of general Hankel systems (Q1326405) (← links)
- An algorithm for constructing a minimal partial realization in the multivariable case (Q1391043) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- Recursive partial realization from the combined sequence of Markov parameters and moments (Q1823203) (← links)
- Linear feedback shift registers and the minimal realization problem (Q2002558) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Block diagonalization and LU-equivalence of Hankel matrices (Q2576218) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.) (Q3026910) (← links)
- Minimal partial realization by descriptor systems (Q5932202) (← links)
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} (Q6161965) (← links)
