2003
DOI: 10.1137/s00361445024180
|View full text |Cite
|
Sign up to set email alerts
|

Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later

Abstract: In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polynomial have been proposed. In practice, consideration of computational stability and efficiency indicates that some of the methods are preferable to others, but that none are completely satisfactory.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
1,451
0
17

Year Published

2008
2008
2014
2014

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 1,979 publications
(1,513 citation statements)
references
References 85 publications
2
1,451
0
17
Order By: Relevance
“…This can be computed by methods described by Moler and Van Loan (2003); Kalbfleisch and Lawless (1985) and Jackson (2011) discuss algorithms for the computation and maximization of (3). The msm package in R (Jackson 2011) is one of several that will do this, and it also handles piecewise-constant models.…”
Section: Maximum Likelihood Estimationmentioning
confidence: 99%
“…This can be computed by methods described by Moler and Van Loan (2003); Kalbfleisch and Lawless (1985) and Jackson (2011) discuss algorithms for the computation and maximization of (3). The msm package in R (Jackson 2011) is one of several that will do this, and it also handles piecewise-constant models.…”
Section: Maximum Likelihood Estimationmentioning
confidence: 99%
“…The computation of matrix exponentials is not an easy task (Moler and Loan, 2003). Fortunately, a software package designed for Markov chain models, expokit (Sidje, 1998), has been implemented in MatLab.…”
Section: Matrix Exponential Methodsmentioning
confidence: 99%
“…Specifically, W i = v i y T i , where v j is the right eigenvector corresponding to the jth eigenvalue and y T j is the jth row of V −1 where V is the matrix whose columns are the right eigenvectors ofB (Moler and Van Loan, 2003). It then follows from the orthogonality of the eigenvectors that W i W j = 0 for i j.…”
Section: Early Time Approximationmentioning
confidence: 99%