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

## 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.

## Key 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].