A procedure for finding the k-th power of a matrix
Branko Malesevic, Ivana Jovovic
TL;DR
This paper introduces a new Maple-based procedure for efficiently computing the k-th power of a matrix, building upon existing algorithms.
Contribution
It presents a novel Maple implementation for matrix powering that improves upon previous methods.
Findings
Efficient computation of matrix powers in Maple.
Implementation of the new procedure in Maple software.
Potential improvements over existing algorithms.
Abstract
We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].
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
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Matrix Theory and Algorithms