Arbitrary positive powers of semicirculant and r-circulant matrices
Mohammed Moucouf

TL;DR
This paper introduces a new recursive approach for efficiently computing the entries of arbitrary positive powers of semicirculant and r-circulant matrices, expanding computational tools in matrix analysis.
Contribution
It presents the first recursive method that does not rely on assumptions to compute matrix powers for semicirculant and r-circulant matrices.
Findings
Recursive formulas for matrix powers derived
Method applicable without assumptions
Enhanced computational efficiency for matrix powers
Abstract
We provide a novel recursive method, which does not require any assumption, to compute the entries of the kth power of a semicirculant matrix. As an application, a method for computing the entries of the kth power of r-circulant matrices is also presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Mathematics and Applications
