A New Algorithm for Computing the Inverse and Generalized Inverse of the Scaled Factor Circulant Matrix
Year: 2008
Journal of Computational Mathematics, Vol. 26 (2008), Iss. 1 : pp. 112–122
Abstract
A new algorithm for finding the inverse of a nonsingular scaled factor circulant matrix is presented by the Euclid's algorithm. Extension is made to compute the group inverse and the Moore-Penrose inverse of the singular scaled factor circulant matrix. Numerical examples are presented to demonstrate the implementation of the proposed algorithm.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2008-JCM-8614
Journal of Computational Mathematics, Vol. 26 (2008), Iss. 1 : pp. 112–122
Published online: 2008-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 11
Keywords: Scaled factor circulant matrix Inverse Group inverse Moore-Penrose inverse.