A local construction of the Smith normal form of a matrix polynomial [electronic resource]
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,...
Saved in:
| Online Access: |
Online Access |
|---|---|
| Corporate Author: | |
| Format: | Government Document Electronic eBook |
| Language: | English |
| Published: |
Berkeley, Calif. : Oak Ridge, Tenn. :
Lawrence Berkeley National Laboratory ; distributed by the Office of Scientific and Technical Information, U.S. Department of Energy,
2008.
|
| Subjects: |
| Summary: | 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 operations to the original matrix row by row (or column by column). The performance of the algorithm in exact arithmetic is reported for several test cases. |
|---|---|
| Item Description: | Published through SciTech Connect. 09/01/2008. "lbnl-1294e" Journal of Symbolic Computation FT. Yu, Jia; Wilkening, Jon. Computational Research Division. |