The problem of evaluating a polynomial

in a matrix

arises in many applications, e.g., the Taylor approximation of e
A. The

algorithm of Paterson and Stockmeyer has the drawback that it requires

storage, where

is the degree of

and

is the dimension of

. An algorithm which greatly reduces this storage requirement without undue loss of speed is presented.