A robust solution of the generalized polynomial Bézout identity (Q1827508)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A robust solution of the generalized polynomial Bézout identity |
scientific article; zbMATH DE number 2083517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust solution of the generalized polynomial Bézout identity |
scientific article; zbMATH DE number 2083517 |
Statements
A robust solution of the generalized polynomial Bézout identity (English)
0 references
6 August 2004
0 references
The authors present a robust algorithm for the computation of all matrices of the generalized polynomial Bézout identity, together with an algorithm for the computation of minimal polynomial basis for the null space of polynomial matrices. This algorithm exploits singular value decompositions of certain real matrices. Two interesting examples enlighten in detail the effectiveness of the proposed algorithms.
0 references
matrix polynomials, minimal polynomial basis
0 references
matrix fraction description
0 references
generalized Bézout identity
0 references
numerical examples
0 references
robust algorithm
0 references
singular value decompositions
0 references
0 references
0 references
0 references
0.9465426
0 references
0.86329794
0 references
0 references
0.85674536
0 references
0.85615456
0 references
0.8552438
0 references
