Numerical computation of minimal polynomial bases: a generalized resultant approach (Q2484243)
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: Numerical computation of minimal polynomial bases: a generalized resultant approach |
scientific article; zbMATH DE number 2189262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical computation of minimal polynomial bases: a generalized resultant approach |
scientific article; zbMATH DE number 2189262 |
Statements
Numerical computation of minimal polynomial bases: a generalized resultant approach (English)
0 references
1 August 2005
0 references
A new resultant based method for the computation of minimal polynomial bases of a polynomial matrix is proposed. The algorithm utilizes the left null space structure of successive generalized Sylvester resultants of a polynomial matrix to obtain the coefficients of the minimal polynomial bases of the left kernel of the given polynomial matrix. The entire procedure can be implemented using only orthogonal decompositions and the coefficients of the resulting minimal polynomial basis have the appealing property of being orthonomal.
0 references
resultant based method
0 references
polynomial matrix
0 references
minimal polynomial basis
0 references
matrix fraction description
0 references
algorithm
0 references
Sylvester resultants
0 references
0 references
0 references
0 references
0.8090128898620605
0 references
0.8081707954406738
0 references
0.8025802373886108
0 references
0.7985916137695312
0 references
0.7963257431983948
0 references
