Fast parallel computation of hermite and smith forms of polynomial matrices
SIAM Journal on Algebraic and Discrete Methods
Computation of the Smith normal form of polynomial matrices
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Fast parallel computation of the Smith normal form of polynomial matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Generalized subresultants for computing the Smith normal form of polynomial matrices
Journal of Symbolic Computation
SIAM Journal on Matrix Analysis and Applications
Applied numerical linear algebra
Applied numerical linear algebra
Inversion of Analytic Matrix Functions That are Singular at the Origin
SIAM Journal on Matrix Analysis and Applications
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]
Journal of Symbolic Computation
λ-matrix formulation applied to the Hertz contact problem with finite friction
Computers & Mathematics with Applications
Fast computation of Smith forms of sparse matrices over local rings
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
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.