A simple algorithm for computing the larger positive integer powers m ( >n ) of an nxn matrix is discussed in this paper. Most recent algorithms are mentioned, and comparison data on the theoretical complexity of these algorithms, and the runtime data are provided.