Hybrid algorithm for the computation of the matrix polynomial I+A+/spl middot//spl middot//spl middot/+A/sup N-1/

A new method for computing the matrix polynomial is proposed. The comparison demonstrates that this is the most efficient technique at the moment. Furthermore, it is argued that the approach is optimal in the framework of the discussed algorithms. The algorithm is recursive and it can be viewed as resulting from a new number system.<
>