A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (Q1334229): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A compound matrix algorithm for the computation of the Smith form of a polynomial matrix |
scientific article |
Statements
A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (English)
0 references
17 October 1994
0 references
This paper presents a numerical method for the exact reduction of a single-variable polynomial matrix to its Smith canonical form without finding roots and without applying unimodular transformations. This technique uses the notion of compound matrices and produces a stable and accurate numerical algorithm working satisfactorily for any polynomial matrix of any degree. Numerical results of several examples are given.
0 references
MATLAB
0 references
numerical results
0 references
polynomial matrix
0 references
Smith canonical form
0 references
compound matrices
0 references
numerical algorithm
0 references
