On Bernoulli series approximation for the matrix cosine

This paper presents a new series expansion based on Bernoulli matrix polynomials to approximate the matrix cosine function. An approximation based on this series is not a straightforward exercise since there exist different options to implement such a solution. We dive into these options and include a thorough comparative of performance and accuracy in the experimental results section that shows benefits and downsides of each one. Also, a comparison with the Pade approximation is included. The algorithms have been implemented in MATLAB and in CUDA for NVIDIA GPUs.