While trying to compute the Matrix Exponential of an
nxn array I decided to take advantage of a Python function called
According to the documentation, this function adopts the Pade' Approximant to perform a calculation that, otherwise, is said to require a lot of resources and is still a matter of discussion in the mathematics community.
The documentation itself references a work by Al-Mohy and Higham (doi: 10.1137/04061101X), in which I was not able to find any indication regarding the Time Complexity (either T or Theta would work) of this procedure.
Has anyone come across the same problem? What is your suggestion for determining said Time Complexity?