Computer Science – Symbolic Computation
Scientific paper
2008-09-17
Computer Science
Symbolic Computation
26 pages, 6 figures; introduction expanded, 10 references added, two additional tests performed
Scientific paper
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.
Wilkening Jon
Yu Jia
No associations
LandOfFree
A local construction of the Smith normal form of a matrix polynomial does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A local construction of the Smith normal form of a matrix polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A local construction of the Smith normal form of a matrix polynomial will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-661921