A local construction of the Smith normal form of a matrix polynomial
Journal Article
·
· Journal of Symbolic Computation
OSTI ID:944574
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.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- Computational Research Division
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 944574
- Report Number(s):
- LBNL-1294E; TRN: US200902%%868
- Journal Information:
- Journal of Symbolic Computation, Journal Name: Journal of Symbolic Computation
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing the Smith normal form of a matrix. [Computer greatest common divisor of n polynomials]
Algorithm for the exact reduction of a matrix to Frobenius form using modular arithmetic. I
On general row merging schemes for sparse Givens transformations
Conference
·
Thu Jan 01 00:00:00 EST 1976
·
OSTI ID:944574
Algorithm for the exact reduction of a matrix to Frobenius form using modular arithmetic. I
Journal Article
·
Mon Oct 01 00:00:00 EDT 1973
· Math. Comput., v. 27, no. 124, pp. 887-904
·
OSTI ID:944574
On general row merging schemes for sparse Givens transformations
Journal Article
·
Wed Oct 01 00:00:00 EDT 1986
· SIAM J. Sci. Stat. Comput.; (United States)
·
OSTI ID:944574