High performance computing of the matrix exponential

• P. Ruiz ^[1] ; J. Sastre ^[1] ; J. Ibáñez ^[1] ; E. Defez ^[1]
  1. [1] Universidad Politécnica de Valencia

     Universidad Politécnica de Valencia

     Valencia, España

     
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 291, Nº 1 (1 January 2016), 2016, págs. 370-379
• Idioma: inglés
• DOI: 10.1016/j.cam.2015.04.001
• Enlaces
  • Texto completo
• Resumen

  • This work presents a new algorithm for matrix exponential computation that significantly simplifies a Taylor scaling and squaring algorithm presented previously by the authors, preserving accuracy. A Matlab version of the new simplified algorithm has been compared with the original algorithm, providing similar results in terms of accuracy, but reducing processing time. It has also been compared with two state-of-the-art implementations based on Padé approximations, one commercial and the other implemented in Matlab, getting better accuracy and processing time results in the majority of cases.