A compound matrix algorithm for the computation of the Smith form of a polynomial matrix |
| |
Authors: | M Mitrouli G Kalogeropoulos |
| |
Institution: | (1) Department of Mathematics, University of Athens, Panepistimiopolis, GR-157 84 Athens, Greece |
| |
Abstract: | In the present paper is presented a numerical method for the exact reduction of a singlevariable polynomial matrix to its Smith form without finding roots and without applying unimodular transformations. Using the notion of compound matrices, the Smith canonical form of a polynomial matrixM(s)![isin](/content/u200581gr0w74u95/xxlarge8712.gif) nxns] is calculated directly from its definition, requiring only the construction of all thep-compound matricesC
p
(M(s)) ofM(s), 1<p n. This technique produces a stable and accurate numerical algorithm working satisfactorily for any polynomial matrix of any degree. |
| |
Keywords: | Smith canonical form compound matrices matrix algorithms MATLAB |
本文献已被 SpringerLink 等数据库收录! |