A finite algorithm for generalized inverses of polynomial and rational matrices (Q1405054): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite algorithm for generalized inverses of polynomial and rational matrices |
scientific article |
Statements
A finite algorithm for generalized inverses of polynomial and rational matrices (English)
0 references
25 August 2003
0 references
The author derives two dual algorithms for symbolic computation of outer inverses of a given one-variable rational matrix, including reflexive g-inverses, the Moore-Penrose inverse and the Drazin inverse. The algorithms are based on different modifications of the Leverrier-Faddeev algorithm. The implementation of the algorithm corresponding to rational matrices in the package MATHEMATICA is described.
0 references
polynomial matrix
0 references
Leverrier-Faddeev algorithm
0 references
generalized inverses
0 references
symbolic computation.
0 references
dual algorithms
0 references
outer inverses
0 references
rational matrix
0 references
reflexive \(g\)-inverses
0 references
Moore-Penrose inverse
0 references
Drazin inverse
0 references
package MATHEMATICA
0 references
