Computing minimal generators of integer matrix sequences (abstract only)


We describe a fraction free matrix Berlekamp/Massey algorithm. The algorithm behaves like a scalar algorithm by performing block eliminations through multiplication by adjoint matrices. The adjoints are computed using fraction free diagonalization. We also describe an interesting classification of the unique minimal generators of a linearly generated scalar… (More)
DOI: 10.1145/1394042.1394101


Cite this paper

@article{Yuhasz2008ComputingMG, title={Computing minimal generators of integer matrix sequences (abstract only)}, author={George Yuhasz and Erich Kaltofen}, journal={ACM Comm. Computer Algebra}, year={2008}, volume={42}, pages={91} }