Hybrid algorithm for the computation of the matrix polynomial using a fractal number system

In the paper a new and interesting algorithm for computing the matrix polynomial is proposed. The comparison demonstrates that this is the most efficient algorithm among the existing algorithms. Furthermore we argue that the approach is optimal in the framework of the discussed algorithms. A new interesting number system is proposed in order to derive the approach.<
>