A local construction of the Smith normal form of a matrix polynomial
Symbolic Computation
2015-03-13 v2
Abstract
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant separately and then combines them into a global Smith form, whereas other algorithms apply a sequence of unimodular row and column operations to the original matrix. The performance of the algorithm in exact arithmetic is reported for several test cases.
Keywords
Cite
@article{arxiv.0809.2978,
title = {A local construction of the Smith normal form of a matrix polynomial},
author = {Jon Wilkening and Jia Yu},
journal= {arXiv preprint arXiv:0809.2978},
year = {2015}
}
Comments
26 pages, 6 figures; introduction expanded, 10 references added, two additional tests performed