A procedure for finding the k-th power of a matrix

We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].

💡 Research Summary

The paper introduces a novel Maple‑based procedure for computing the k‑th power of a matrix, addressing the inefficiencies of traditional approaches. Existing methods—repeated multiplication, eigenvalue decomposition, and Jordan canonical form—suffer from high computational cost, numerical instability, or restrictive applicability. The authors build on the theoretical framework of minimal polynomials (as presented in reference