On the evaluation of matrix polynomials using several GPGPUs

Abstract

Computing a matrix polynomial is the basic process in the calculation of functions of matrices by the Taylor method. One of the most efficient techniques for computing matrix polynomials is based on the Paterson– Stockmeyer method. Inspired by this method, we propose in this work a recursive algorithm and an efficient implementation that exploit the heterogeneous nature of current computers to evaluate large scale matrix polynomials is the shortest possible time. Heterogeneous computers are those which have any type of hardware accelerator(s). For these type of computers, we propose a method to easily implement efficient algorithms that use several hardware accelerators in parallel. This methodology is built on the last versions of the OpenMP standard for implementing paral- lel algorithms on shared memory multiprocessors. In particular, we have used NVIDIA© cards, but the proposal can be readily generalized to other type of devices acting as coprocessors. In addition, we provide a high-level interface in Matlab© to be used by any researcher who is not aware of parallelism nor of other programming issues.Alonso Jordá, P.; Boratto, M.; Peinado Pinilla, J.; Ibáñez González, JJ.; Sastre Martinez, J. (2014). On the evaluation of matrix polynomials using several GPGPUs. http://hdl.handle.net/10251/3961