An improved algorithm to compute the exponential of a matrix
From MaRDI portal
Publication:6293245
arXiv1710.10989MaRDI QIDQ6293245FDOQ6293245
Authors: P. Bader, Sergio Blanes, Fernando Casas 
Publication date: 30 October 2017
Abstract: In this work, we present a new way to compute the Taylor polynomial of the matrix exponential which reduces the number of matrix multiplications in comparison with the de-facto standard Patterson-Stockmeyer method. This reduction is sufficient to make the method superior in performance to Pad'e approximants by 10-30% over a range of values for the matrix norms and thus we propose its replacement in standard software kits. Numerical experiments show the performance of the method and illustrate its stability.
This page was built for publication: An improved algorithm to compute the exponential of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293245)
