Symbolic iterative algorithm for generalized inversion of rational polynomial matrices (Q580902)
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: Symbolic iterative algorithm for generalized inversion of rational polynomial matrices |
scientific article; zbMATH DE number 4018240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symbolic iterative algorithm for generalized inversion of rational polynomial matrices |
scientific article; zbMATH DE number 4018240 |
Statements
Symbolic iterative algorithm for generalized inversion of rational polynomial matrices (English)
0 references
1985
0 references
After a short background on generalized inverses of matrices, one uses Hensel's lemma and the Newton-Schultz method to calculate the generalized inversion of rational polynomial matrices. Conversion to Padé rational is considered and the various algorithms so defined are extended to multivariable polynomial matrices.
0 references
symbolic iterative algorithm
0 references
generalized inverses
0 references
Hensel's lemma
0 references
Newton-Schultz method
0 references
rational polynomial matrices
0 references
Padé rational
0 references
multivariable polynomial matrices
0 references
0.859190821647644
0 references
0.8504634499549866
0 references
0.8385607600212097
0 references
0.835751473903656
0 references
0.835751473903656
0 references
