Algorithms for finding the minimal polynomials and inverses of resultant matrices (Q1885082)
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: Algorithms for finding the minimal polynomials and inverses of resultant matrices |
scientific article; zbMATH DE number 2111254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding the minimal polynomials and inverses of resultant matrices |
scientific article; zbMATH DE number 2111254 |
Statements
Algorithms for finding the minimal polynomials and inverses of resultant matrices (English)
0 references
28 October 2004
0 references
Algorithms for computing the minimal polynomial and common minimal polynomial of resultant matrices over any field are presented. Two algorithms for finding the inverses of such matrices are given. An algorithm for the inverse of partitioned matrix with resultant blocks over any field is presented. A variety of lemmas and six theorems are given. The paper contains three illustrative examples.
0 references
resultant matrix
0 references
minimal polynomial
0 references
matrix inverse
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
