Algorithms for finding the minimal polynomials and inverses of resultant matrices
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.
scientific article; zbMATH DE number 2111254