Efficient evaluation of matrix polynomials

Efficient evaluation of matrix polynomials, Jorge Sastre, Linear Algebra Applications, Vol. 539, pp. 229-250, Feb. 2018. Preprint.

Abstract: This paper presents a new family of methods for evaluating matrix polynomials more efficiently than the state-of-the-art Paterson–Stockmeyer method. Examples of the application of the methods to the Taylor polynomial approximation of matrix functions like the matrix exponential and matrix cosine are given. Their efficiency is compared with that of the best existing evaluation schemes for general polynomial and rational approximations, and also with a recent method based on mixed rational and polynomial approximants. For many years, the Paterson–Stockmeyer method has been considered the most efficient general method for the evaluation of matrix polynomials. In this paper we show that this statement is no longer true. Moreover, for many years rational approximations have been considered more efficient than polynomial approximations, although recently it has been shown that often this is not the case in the computation of the matrix exponential and matrix cosine. In this paper we show that in fact polynomial approximations provide a higher order of approximation than the state-of-the-art computational methods for rational approximations for the same cost in terms of matrix products. Early version submitted on Feb. 18, 2016 to Appl. Math. Comput., see AMC-S-16-00951.pdf, rejected.

International Conference in Mathematical Models in Engineering & Human Behaviour 2016

Last accepted Conference Paper: