Algorithms for linearly recurrent sequences of truncated polynomials
From MaRDI portal
Cites work
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A polynomial-division-based algorithm for computing linear recurrence relations
- A probabilistic remark on algebraic program testing
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Algorithms for zero-dimensional ideals using linear recurrent sequences
- Certification of minimal approximant bases
- Computing \(J\)-ideals of a matrix over a principal ideal domain
- Computing column bases of polynomial matrices
- Computing syzygies in finite dimension using fast linear algebra
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Fast algorithm for border bases of Artinian Gorenstein algebras
- Fast computation of approximant bases in canonical form
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- 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
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1504611 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Ideal basis and primary decompositions: case of two variables
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- Invariant Description of Linear, Time-Invariant Controllable Systems
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Linear multivariable systems
- Matrix multiplication via arithmetic progressions
- Modern algebra and polynomial odeals.
- Null Ideals of Matrices
- Null ideals of matrices over residue class rings of principal ideal domains
- Powers of tensors and fast matrix multiplication
- Shift-register synthesis and BCH decoding
- Solving a multivariable congruence by change of term order
- Solving sparse linear equations over finite fields
- Solving structured linear systems with large displacement rank
- The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
- The BMS Algorithm
- Using Algebraic Geometry
- Über irreduzible Ideale in kommutativen Ringen.
Cited in
(3)
This page was built for publication: Algorithms for linearly recurrent sequences of truncated polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666538)
