A robust solution of the generalized polynomial Bézout identity (Q1827508): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2003.11.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984423026 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A robust solution of the generalized polynomial Bézout identity |
scientific article |
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
