J4

• Original Articles • Previous Articles     Next Articles

Euclid algorithm for finding the inverse and generalized inverse of the permutation factor circulant matrix

JIANG Zhao-lin1,2;LIU San-yang1

  

  1. (1. School of Science, Xidian Univ., Xi'an 710071, China;
    2. Dept. of Mathematics, Linyi Teachers College, Linyi 276005, China)

  • Received:1900-01-01 Revised:1900-01-01 Online:2004-02-20 Published:2004-02-20

Abstract: A new algorithm for finding the inverse of a nonsingular permutation factor circulant matrix is presented by teh Euclid algirytm of polynomial. Extension is made to compute the Moore-Penrose inverse of a singular permutation factor circulant matrix. Finally, numerical examples show the effectiveness of the algorithm.

Key words: permutation factor circulant matrix, inverse, Moore-Penrose inverse, polynomial ring, Euclid algorithm

CLC Number: 

  • O151.21