Algorithms for finding the minimal polynomials and inverses of resultant matrices
type: Item
instance of: scholarly article
title: Algorithms for finding the minimal polynomials and inverses of resultant matrices
zbMATH Open document ID: 1059.65038
DOI: 10.1007/BF02936166
author: Shuping Gao
author: Sanyang Liu
published in: Journal of Applied Mathematics and Computing
publication date: 2004-10-28T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A21
zbMATH DE Number: 2111254
zbMATH Keywords: resultant matrix
zbMATH Keywords: minimal polynomial
zbMATH Keywords: matrix inverse
zbMATH Keywords: algorithm
reviewed by: R. P. Tewarson
MaRDI profile type: Publication
cites work: Q4305609
cites work: Methods of Matrix Inversion
cites work: Matrix Analysis
cites work: Resultants and group matrices
cites work: Rotations and discriminants of quadratic spaces
cites work: Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix
cites work: On the history of the Bézoutian and the resultant matrix
cites work: Commutators and companion matrices over rings of stable rank 1
cites work: Linear construction of companion matrices
cites work: The infinite companion matrix
cites work: Generalized Lyapunov equations, matrices with displacement structure, and generalized Bézoutians
cites work: Generalized companion matrices and matrix representations for generalized Bézoutians
cites work: Pairs of companion matrices and their simultaneous reduction to complementary triangular forms
cites work: On Fisher's information matrix of an ARMAX process and Sylvester's resultant matrices
cites work: A Faddeev sequence method for solving Lyapunov and Sylvester equations
cites work: On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
cites work: Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
cites work: Extending the notions of companion and infinite companion to matrix polynomials
cites work: Ambiguity resistant polynomial matrices
cites work: Similarity of the companion matrix and its transpose (with an appendix by Robert M. Guralnick)
cites work: Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
cites work: Q4542909
cites work: A variant of block incomplete factorization preconditioners for a symmetric \(H\)-matrix
full work available at URL: https://doi.org/10.1007/bf02936166
OpenAlex ID: W1977010446
description: scientific article; zbMATH DE number 2111254