• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.593-607
• /
• 2014

Let R be an I-semiring and S(R) be the set of all identity-summand elements of R. In this paper we introduce the total graph of R with respect to identity-summand elements, denoted by T(${\Gamma}(R)$), and investigate basic properties of S(R) which help us to gain interesting results about T(${\Gamma}(R)$) and its subgraphs.