_expm_multiply_interval(A, B, start=None, stop=None, num=None, endpoint=None, balance=False, status_only=False)
This is algorithm (5.2) in Al-Mohy and Higham (2011).
There seems to be a typo, where line 15 of the algorithm should be moved to line 6.5 (between lines 6 and 7).
The operator whose exponential is of interest.
The matrix to be multiplied by the matrix exponential of A.
The starting time point of the sequence.
The end time point of the sequence, unless :None:None:`endpoint` is set to False. In that case, the sequence consists of all but the last of num + 1
evenly spaced time points, so that :None:None:`stop` is excluded. Note that the step size changes when :None:None:`endpoint` is False.
Number of time points to use.
If True, :None:None:`stop` is the last time point. Otherwise, it is not included.
Indicates whether or not to apply balancing.
A flag that is set to True for some debugging and testing operations.
Compute the action of the matrix exponential at multiple time points.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them