A New Algorithm for Computing the Inverse and Generalized Inverse of the Scaled Factor Circulant Matrix
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.
About this article
Abstract View
Pdf View
How to Cite
A New Algorithm for Computing the Inverse and Generalized Inverse of the Scaled Factor Circulant Matrix. (2018). Journal of Computational Mathematics, 26(1), 112-122. https://gsp.tricubic.dev/JCM/article/view/11871