Computation of coprime factorizations of rational matrices (Q1379084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1116046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of coprime factorizations of rational matrices |
scientific article; zbMATH DE number 1116046 |
Statements
Computation of coprime factorizations of rational matrices (English)
0 references
11 August 1998
0 references
This paper deals with the coprime decompositions of rational matrices. Numerically reliable state-space algorithms are proposed. These new algorithms are based on a recursive pole dislocation technique which can be seen as refinement of the general recursive pole dislocation approach described by \textit{P. Van Dooren} [ibid. 137/138, 663-697 (1990; Zbl 0709.15011)]. These new procedures are generally applicable whether the original descriptor state-space representation is minimal or not, and whether it is stabilizable/detectable or not. They are well suited for robust software implementations.
0 references
recursive algorithm
0 references
coprime decompositions
0 references
rational matrices
0 references
pole dislocation
0 references
0.931426763534546
0 references
0.8876732587814331
0 references
0.8607900738716125
0 references
0.8492564558982849
0 references
0.835464596748352
0 references