In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. It is used to solve systems of linear differential equations. In the theory of Lie groups, the matrix exponential gives the exponential map between a matrix Lie algebra and the corresponding Lie group.

Let X be an n×n real or complex matrix. The exponential of X, denoted by e^X or exp(X), is the n×n matrix given by the power series

$${\displaystyle e^{X}=\sum _{k=0}^{\infty }{\frac {1}{k!))X^{k))$$

where ${\displaystyle X^{0))$ is defined to be the identity matrix ${\displaystyle I}$ with the same dimensions as ${\displaystyle X}$.^[1] The series always converges, so the exponential of X is well-defined.

Equivalently,

$${\displaystyle e^{X}=\lim _{k\rightarrow \infty }\left(I+{\frac {X}{k))\right)^{k))$$

When X is an n×n diagonal matrix then exp(X) will be an n×n diagonal matrix with each diagonal element equal to the ordinary exponential applied to the corresponding diagonal element of X.

Properties

Elementary properties

Let X and Y be n×n complex matrices and let a and b be arbitrary complex numbers. We denote the n×n identity matrix by I and the zero matrix by 0. The matrix exponential satisfies the following properties.^[2]

We begin with the properties that are immediate consequences of the definition as a power series:

• e⁰ = I
• exp(X^T) = (exp X)^T, where X^T denotes the transpose of X.
• exp(X^∗) = (exp X)^∗, where X^∗ denotes the conjugate transpose of X.
• If Y is invertible then e^YXY−1 = Ye^XY⁻¹.

The next key result is this one:

• If ${\displaystyle XY=YX}$ then ${\displaystyle e^{X}e^{Y}=e^{X+Y))$.

The proof of this identity is the same as the standard power-series argument for the corresponding identity for the exponential of real numbers. That is to say, as long as ${\displaystyle X}$ and ${\displaystyle Y}$ commute, it makes no difference to the argument whether ${\displaystyle X}$ and ${\displaystyle Y}$ are numbers or matrices. It is important to note that this identity typically does not hold if ${\displaystyle X}$ and ${\displaystyle Y}$ do not commute (see Golden-Thompson inequality below).

Consequences of the preceding identity are the following:

• e^aXe^bX = e^{(a + b)X}
• e^Xe^−X = I

Using the above results, we can easily verify the following claims. If X is symmetric then e^X is also symmetric, and if X is skew-symmetric then e^X is orthogonal. If X is Hermitian then e^X is also Hermitian, and if X is skew-Hermitian then e^X is unitary.

Finally, a Laplace transform of matrix exponentials amounts to the resolvent,

$${\displaystyle \int _{0}^{\infty }e^{-ts}e^{tX}\,dt=(sI-X)^{-1))$$

Linear differential equation systems

One of the reasons for the importance of the matrix exponential is that it can be used to solve systems of linear ordinary differential equations. The solution of

$${\displaystyle {\frac {d}{dt))y(t)=Ay(t),\quad y(0)=y_{0},}$$

$${\displaystyle y(t)=e^{At}y_{0}.}$$

The matrix exponential can also be used to solve the inhomogeneous equation

$${\displaystyle {\frac {d}{dt))y(t)=Ay(t)+z(t),\quad y(0)=y_{0}.}$$

There is no closed-form solution for differential equations of the form

$${\displaystyle {\frac {d}{dt))y(t)=A(t)\,y(t),\quad y(0)=y_{0},}$$

The determinant of the matrix exponential

By Jacobi's formula, for any complex square matrix the following trace identity holds:^[3]

In addition to providing a computational tool, this formula demonstrates that a matrix exponential is always an invertible matrix. This follows from the fact that the right hand side of the above equation is always non-zero, and so det(e^A) ≠ 0, which implies that e^A must be invertible.

In the real-valued case, the formula also exhibits the map

$${\displaystyle \exp \colon M_{n}(\mathbb {R} )\to \mathrm {GL} (n,\mathbb {R} )}$$

Real symmetric matrices

The matrix exponential of a real symmetric matrix is positive definite. Let ${\displaystyle S}$ be an n×n real symmetric matrix and ${\displaystyle x\in \mathbb {R} ^{n))$ a column vector. Using the elementary properties of the matrix exponential and of symmetric matrices, we have:

$${\displaystyle x^{T}e^{S}x=x^{T}e^{S/2}e^{S/2}x=x^{T}(e^{S/2})^{T}e^{S/2}x=(e^{S/2}x)^{T}e^{S/2}x=\lVert e^{S/2}x\rVert ^{2}\geq 0.}$$

Since ${\displaystyle e^{S/2))$ is invertible, the equality only holds for ${\displaystyle x=0}$, and we have ${\displaystyle x^{T}e^{S}x>0}$ for all non-zero ${\displaystyle x}$. Hence ${\displaystyle e^{S))$ is positive definite.

The exponential of sums

For any real numbers (scalars) x and y we know that the exponential function satisfies e^x+y = e^x e^y. The same is true for commuting matrices. If matrices X and Y commute (meaning that XY = YX), then,

$${\displaystyle e^{X+Y}=e^{X}e^{Y}.}$$

However, for matrices that do not commute the above equality does not necessarily hold.

The Lie product formula

Even if X and Y do not commute, the exponential e^{X + Y} can be computed by the Lie product formula^[4]

$${\displaystyle e^{X+Y}=\lim _{k\to \infty }\left(e^((\frac {1}{k))X}e^((\frac {1}{k))Y}\right)^{k}.}$$

Using a large finite k to approximate the above is basis of the Suzuki-Trotter expansion, often used in numerical time evolution.

The Baker–Campbell–Hausdorff formula

In the other direction, if X and Y are sufficiently small (but not necessarily commuting) matrices, we have

$${\displaystyle e^{X}e^{Y}=e^{Z},}$$

$${\displaystyle Z=X+Y+{\frac {1}{2))[X,Y]+{\frac {1}{12))[X,[X,Y]]-{\frac {1}{12))[Y,[X,Y]]+\cdots ,}$$

Inequalities for exponentials of Hermitian matrices

For Hermitian matrices there is a notable theorem related to the trace of matrix exponentials.

If A and B are Hermitian matrices, then^[6]

$${\displaystyle \operatorname {tr} \exp(A+B)\leq \operatorname {tr} \left[\exp(A)\exp(B)\right].}$$

There is no requirement of commutativity. There are counterexamples to show that the Golden–Thompson inequality cannot be extended to three matrices – and, in any event, tr(exp(A)exp(B)exp(C)) is not guaranteed to be real for Hermitian A, B, C. However, Lieb proved^[7][8] that it can be generalized to three matrices if we modify the expression as follows

$${\displaystyle \operatorname {tr} \exp(A+B+C)\leq \int _{0}^{\infty }\mathrm {d} t\,\operatorname {tr} \left[e^{A}\left(e^{-B}+t\right)^{-1}e^{C}\left(e^{-B}+t\right)^{-1}\right].}$$

The exponential map

The exponential of a matrix is always an invertible matrix. The inverse matrix of e^X is given by e^−X. This is analogous to the fact that the exponential of a complex number is always nonzero. The matrix exponential then gives us a map

$${\displaystyle \exp \colon M_{n}(\mathbb {C} )\to \mathrm {GL} (n,\mathbb {C} )}$$

For any two matrices X and Y,

$${\displaystyle \left\|e^{X+Y}-e^{X}\right\|\leq \|Y\|e^{\|X\|}e^{\|Y\|},}$$

where ‖ · ‖ denotes an arbitrary matrix norm. It follows that the exponential map is continuous and Lipschitz continuous on compact subsets of M_n(C).

The map

$${\displaystyle t\mapsto e^{tX},\qquad t\in \mathbb {R} }$$

In fact, this gives a one-parameter subgroup of the general linear group since

$${\displaystyle e^{tX}e^{sX}=e^{(t+s)X}.}$$

The derivative of this curve (or tangent vector) at a point t is given by

$${\displaystyle {\frac {d}{dt))e^{tX}=Xe^{tX}=e^{tX}X.}$$

(1)

The derivative at t = 0 is just the matrix X, which is to say that X generates this one-parameter subgroup.

More generally,^[10] for a generic t-dependent exponent, X(t),

Taking the above expression e^X(t) outside the integral sign and expanding the integrand with the help of the Hadamard lemma one can obtain the following useful expression for the derivative of the matrix exponent,^[11]

$${\displaystyle \left({\frac {d}{dt))e^{X(t)}\right)e^{-X(t)}={\frac {d}{dt))X(t)+{\frac {1}{2!))\left[X(t),{\frac {d}{dt))X(t)\right]+{\frac {1}{3!))\left[X(t),\left[X(t),{\frac {d}{dt))X(t)\right]\right]+\cdots }$$

The coefficients in the expression above are different from what appears in the exponential. For a closed form, see derivative of the exponential map.

Directional derivatives when restricted to Hermitian matrices

Let ${\displaystyle X}$ be a ${\displaystyle n\times n}$ Hermitian matrix with distinct eigenvalues. Let ${\displaystyle X=E{\textrm {diag))(\Lambda )E^{*))$ be its eigen-decomposition where ${\displaystyle E}$ is a unitary matrix whose columns are the eigenvectors of ${\displaystyle X}$, ${\displaystyle E^{*))$ is its conjugate transpose, and ${\displaystyle \Lambda =\left(\lambda _{1},\ldots ,\lambda _{n}\right)}$ the vector of corresponding eigenvalues. Then, for any ${\displaystyle n\times n}$ Hermitian matrix ${\displaystyle V}$, the directional derivative of ${\displaystyle \exp :X\to e^{X))$ at ${\displaystyle X}$ in the direction ${\displaystyle V}$ is ^{[12] [13]}

$${\displaystyle D\exp(X)[V]\triangleq \lim _{\epsilon \to 0}{\frac {1}{\epsilon ))\left(\displaystyle e^{X+\epsilon V}-e^{X}\right)=E(G\odot {\bar {V)))E^{*))$$

${\displaystyle {\bar {V))=E^{*}VE}$

${\displaystyle \odot }$

${\displaystyle 1\leq i,j\leq n}$

${\displaystyle G}$

$${\displaystyle G_{i,j}=\left\((\begin{aligned}&{\frac {e^{\lambda _{i))-e^{\lambda _{j))}{\lambda _{i}-\lambda _{j))}&{\text{ if ))i\neq j,\\&e^{\lambda _{i))&{\text{ otherwise)).\\\end{aligned))\right.}$$

${\displaystyle n\times n}$

${\displaystyle U}$

${\displaystyle U}$

${\displaystyle V}$

$${\displaystyle D^{2}\exp(X)[U,V]\triangleq \lim _{\epsilon _{u}\to 0}\lim _{\epsilon _{v}\to 0}{\frac {1}{4\epsilon _{u}\epsilon _{v))}\left(\displaystyle e^{X+\epsilon _{u}U+\epsilon _{v}V}-e^{X-\epsilon _{u}U+\epsilon _{v}V}-e^{X+\epsilon _{u}U-\epsilon _{v}V}+e^{X-\epsilon _{u}U-\epsilon _{v}V}\right)=EF(U,V)E^{*))$$

${\displaystyle F}$

${\displaystyle 1\leq i,j\leq n}$

$${\displaystyle F(U,V)_{i,j}=\sum _{k=1}^{n}\phi _{i,j,k}({\bar {U))_{ik}{\bar {V))_{jk}^{*}+{\bar {V))_{ik}{\bar {U))_{jk}^{*})}$$

$${\displaystyle \phi _{i,j,k}=\left\((\begin{aligned}&{\frac {G_{ik}-G_{jk)){\lambda _{i}-\lambda _{j))}&{\text{ if ))i\neq j,\\&{\frac {G_{ii}-G_{ik)){\lambda _{i}-\lambda _{k))}&{\text{ if ))i=j{\text{ and ))k\neq i,\\&{\frac {G_{ii)){2))&{\text{ if ))i=j=k.\\\end{aligned))\right.}$$

Computing the matrix exponential

Finding reliable and accurate methods to compute the matrix exponential is difficult, and this is still a topic of considerable current research in mathematics and numerical analysis. Matlab, GNU Octave, R, and SciPy all use the Padé approximant.^{[14][15][16][17]} In this section, we discuss methods that are applicable in principle to any matrix, and which can be carried out explicitly for small matrices.^[18] Subsequent sections describe methods suitable for numerical evaluation on large matrices.

Diagonalizable case

If a matrix is diagonal:

$${\displaystyle A={\begin{bmatrix}a_{1}&0&\cdots &0\\0&a_{2}&\cdots &0\\\vdots &\vdots &\ddots &\vdots \\0&0&\cdots &a_{n}\end{bmatrix)),}$$

$${\displaystyle e^{A}={\begin{bmatrix}e^{a_{1))&0&\cdots &0\\0&e^{a_{2))&\cdots &0\\\vdots &\vdots &\ddots &\vdots \\0&0&\cdots &e^{a_{n))\end{bmatrix)).}$$

This result also allows one to exponentiate diagonalizable matrices. If

and D is diagonal, then

Application of Sylvester's formula yields the same result. (To see this, note that addition and multiplication, hence also exponentiation, of diagonal matrices is equivalent to element-wise addition and multiplication, and hence exponentiation; in particular, the "one-dimensional" exponentiation is felt element-wise for the diagonal case.)

Example : Diagonalizable

For example, the matrix

$${\displaystyle A={\begin{bmatrix}1&4\\1&1\\\end{bmatrix))}$$

$${\displaystyle {\begin{bmatrix}-2&2\\1&1\\\end{bmatrix)){\begin{bmatrix}-1&0\\0&3\\\end{bmatrix)){\begin{bmatrix}-2&2\\1&1\\\end{bmatrix))^{-1}.}$$

Thus,

$${\displaystyle e^{A}={\begin{bmatrix}-2&2\\1&1\\\end{bmatrix))e^{\begin{bmatrix}-1&0\\0&3\\\end{bmatrix)){\begin{bmatrix}-2&2\\1&1\\\end{bmatrix))^{-1}={\begin{bmatrix}-2&2\\1&1\\\end{bmatrix)){\begin{bmatrix}{\frac {1}{e))&0\\0&e^{3}\\\end{bmatrix)){\begin{bmatrix}-2&2\\1&1\\\end{bmatrix))^{-1}={\begin{bmatrix}{\frac {e^{4}+1}{2e))&{\frac {e^{4}-1}{e))\\{\frac {e^{4}-1}{4e))&{\frac {e^{4}+1}{2e))\\\end{bmatrix)).}$$

Nilpotent case

A matrix N is nilpotent if N^q = 0 for some integer q. In this case, the matrix exponential e^N can be computed directly from the series expansion, as the series terminates after a finite number of terms:

$${\displaystyle e^{N}=I+N+{\frac {1}{2))N^{2}+{\frac {1}{6))N^{3}+\cdots +{\frac {1}{(q-1)!))N^{q-1}~.}$$

Since the series has a finite number of steps, it is a matrix polynomial, which can be computed efficiently.

General case

Using the Jordan–Chevalley decomposition

By the Jordan–Chevalley decomposition, any ${\displaystyle n\times n}$ matrix X with complex entries can be expressed as

$${\displaystyle X=A+N}$$

• A is diagonalizable
• N is nilpotent
• A commutes with N

This means that we can compute the exponential of X by reducing to the previous two cases:

$${\displaystyle e^{X}=e^{A+N}=e^{A}e^{N}.}$$

Note that we need the commutativity of A and N for the last step to work.

Using the Jordan canonical form

A closely related method is, if the field is algebraically closed, to work with the Jordan form of X. Suppose that X = PJP⁻¹ where J is the Jordan form of X. Then

$${\displaystyle e^{X}=Pe^{J}P^{-1}.}$$

Also, since

$${\displaystyle {\begin{aligned}J&=J_{a_{1))(\lambda _{1})\oplus J_{a_{2))(\lambda _{2})\oplus \cdots \oplus J_{a_{n))(\lambda _{n}),\\e^{J}&=\exp {\big (}J_{a_{1))(\lambda _{1})\oplus J_{a_{2))(\lambda _{2})\oplus \cdots \oplus J_{a_{n))(\lambda _{n}){\big )}\\&=\exp {\big (}J_{a_{1))(\lambda _{1}){\big )}\oplus \exp {\big (}J_{a_{2))(\lambda _{2}){\big )}\oplus \cdots \oplus \exp {\big (}J_{a_{n))(\lambda _{n}){\big )}.\end{aligned))}$$

Therefore, we need only know how to compute the matrix exponential of a Jordan block. But each Jordan block is of the form

$${\displaystyle {\begin{aligned}&&J_{a}(\lambda )&=\lambda I+N\\&\Rightarrow &e^{J_{a}(\lambda )}&=e^{\lambda I+N}=e^{\lambda }e^{N}.\end{aligned))}$$

where N is a special nilpotent matrix. The matrix exponential of J is then given by

$${\displaystyle e^{J}=e^{\lambda _{1))e^{N_{a_{1))}\oplus e^{\lambda _{2))e^{N_{a_{2))}\oplus \cdots \oplus e^{\lambda _{n))e^{N_{a_{n))))$$

Projection case

If P is a projection matrix (i.e. is idempotent: P² = P), its matrix exponential is:

Deriving this by expansion of the exponential function, each power of P reduces to P which becomes a common factor of the sum:

$${\displaystyle e^{P}=\sum _{k=0}^{\infty }{\frac {P^{k)){k!))=I+\left(\sum _{k=1}^{\infty }{\frac {1}{k!))\right)P=I+(e-1)P~.}$$

Rotation case

For a simple rotation in which the perpendicular unit vectors a and b specify a plane,^[19] the rotation matrix R can be expressed in terms of a similar exponential function involving a generator G and angle θ.^[20][21]

$${\displaystyle {\begin{aligned}G&=\mathbf {ba} ^{\mathsf {T))-\mathbf {ab} ^{\mathsf {T))&P&=-G^{2}=\mathbf {aa} ^{\mathsf {T))+\mathbf {bb} ^{\mathsf {T))\\P^{2}&=P&PG&=G=GP~,\end{aligned))}$$

$${\displaystyle {\begin{aligned}R\left(\theta \right)=e^{G\theta }&=I+G\sin(\theta )+G^{2}(1-\cos(\theta ))\\&=I-P+P\cos(\theta )+G\sin(\theta )~.\\\end{aligned))}$$

The formula for the exponential results from reducing the powers of G in the series expansion and identifying the respective series coefficients of G² and G with −cos(θ) and sin(θ) respectively. The second expression here for e^Gθ is the same as the expression for R(θ) in the article containing the derivation of the generator, R(θ) = e^Gθ.

In two dimensions, if ${\displaystyle a=\left[{\begin{smallmatrix}1\\0\end{smallmatrix))\right]}$ and ${\displaystyle b=\left[{\begin{smallmatrix}0\\1\end{smallmatrix))\right]}$, then ${\displaystyle G=\left[{\begin{smallmatrix}0&-1\\1&0\end{smallmatrix))\right]}$, ${\displaystyle G^{2}=\left[{\begin{smallmatrix}-1&0\\0&-1\end{smallmatrix))\right]}$, and

$${\displaystyle R(\theta )={\begin{bmatrix}\cos(\theta )&-\sin(\theta )\\\sin(\theta )&\cos(\theta )\end{bmatrix))=I\cos(\theta )+G\sin(\theta )}$$

The matrix P = −G² projects a vector onto the ab-plane and the rotation only affects this part of the vector. An example illustrating this is a rotation of 30° = π/6 in the plane spanned by a and b,

$${\displaystyle {\begin{aligned}\mathbf {a} &={\begin{bmatrix}1\\0\\0\\\end{bmatrix))&\mathbf {b} &={\frac {1}{\sqrt {5))}{\begin{bmatrix}0\\1\\2\\\end{bmatrix))\end{aligned))}$$

$${\displaystyle {\begin{aligned}G={\frac {1}{\sqrt {5))}&{\begin{bmatrix}0&-1&-2\\1&0&0\\2&0&0\\\end{bmatrix))&P=-G^{2}&={\frac {1}{5)){\begin{bmatrix}5&0&0\\0&1&2\\0&2&4\\\end{bmatrix))\\P{\begin{bmatrix}1\\2\\3\\\end{bmatrix))={\frac {1}{5))&{\begin{bmatrix}5\\8\\16\\\end{bmatrix))=\mathbf {a} +{\frac {8}{\sqrt {5))}\mathbf {b} &R\left({\frac {\pi }{6))\right)&={\frac {1}{10)){\begin{bmatrix}5{\sqrt {3))&-{\sqrt {5))&-2{\sqrt {5))\\{\sqrt {5))&8+{\sqrt {3))&-4+2{\sqrt {3))\\2{\sqrt {5))&-4+2{\sqrt {3))&2+4{\sqrt {3))\\\end{bmatrix))\\\end{aligned))}$$

Let N = I - P, so N² = N and its products with P and G are zero. This will allow us to evaluate powers of R.

$${\displaystyle {\begin{aligned}R\left({\frac {\pi }{6))\right)&=N+P{\frac {\sqrt {3)){2))+G{\frac {1}{2))\\R\left({\frac {\pi }{6))\right)^{2}&=N+P{\frac {1}{2))+G{\frac {\sqrt {3)){2))\\R\left({\frac {\pi }{6))\right)^{3}&=N+G\\R\left({\frac {\pi }{6))\right)^{6}&=N-P\\R\left({\frac {\pi }{6))\right)^{12}&=N+P=I\\\end{aligned))}$$

Evaluation by Laurent series

By virtue of the Cayley–Hamilton theorem the matrix exponential is expressible as a polynomial of order n−1.

If P and Q_t are nonzero polynomials in one variable, such that P(A) = 0, and if the meromorphic function

$${\displaystyle f(z)={\frac {e^{tz}-Q_{t}(z)}{P(z)))}$$

$${\displaystyle e^{tA}=Q_{t}(A).}$$

Such a polynomial Q_t(z) can be found as follows−see Sylvester's formula. Letting a be a root of P, Q_a,t(z) is solved from the product of P by the principal part of the Laurent series of f at a: It is proportional to the relevant Frobenius covariant. Then the sum S_t of the Q_a,t, where a runs over all the roots of P, can be taken as a particular Q_t. All the other Q_t will be obtained by adding a multiple of P to S_t(z). In particular, S_t(z), the Lagrange-Sylvester polynomial, is the only Q_t whose degree is less than that of P.

Example: Consider the case of an arbitrary 2×2 matrix,

$${\displaystyle A:={\begin{bmatrix}a&b\\c&d\end{bmatrix)).}$$

The exponential matrix e^tA, by virtue of the Cayley–Hamilton theorem, must be of the form

$${\displaystyle e^{tA}=s_{0}(t)\,I+s_{1}(t)\,A.}$$

(For any complex number z and any C-algebra B, we denote again by z the product of z by the unit of B.)

Let α and β be the roots of the characteristic polynomial of A,

$${\displaystyle P(z)=z^{2}-(a+d)\ z+ad-bc=(z-\alpha )(z-\beta )~.}$$

Then we have

$${\displaystyle S_{t}(z)=e^{\alpha t}{\frac {z-\beta }{\alpha -\beta ))+e^{\beta t}{\frac {z-\alpha }{\beta -\alpha ))~,}$$

$${\displaystyle {\begin{aligned}s_{0}(t)&={\frac {\alpha \,e^{\beta t}-\beta \,e^{\alpha t)){\alpha -\beta )),&s_{1}(t)&={\frac {e^{\alpha t}-e^{\beta t)){\alpha -\beta ))\end{aligned))}$$

if α ≠ β; while, if α = β,

$${\displaystyle S_{t}(z)=e^{\alpha t}(1+t(z-\alpha ))~,}$$

so that

$${\displaystyle {\begin{aligned}s_{0}(t)&=(1-\alpha \,t)\,e^{\alpha t},&s_{1}(t)&=t\,e^{\alpha t}~.\end{aligned))}$$

Defining

$${\displaystyle {\begin{aligned}s&\equiv {\frac {\alpha +\beta }{2))={\frac {\operatorname {tr} A}{2))~,&q&\equiv {\frac {\alpha -\beta }{2))=\pm {\sqrt {-\det \left(A-sI\right))),\end{aligned))}$$

we have

$${\displaystyle {\begin{aligned}s_{0}(t)&=e^{st}\left(\cosh(qt)-s{\frac {\sinh(qt)}{q))\right),&s_{1}(t)&=e^{st}{\frac {\sinh(qt)}{q)),\end{aligned))}$$

where sin(qt)/q is 0 if t = 0, and t if q = 0.

Thus,

Thus, as indicated above, the matrix A having decomposed into the sum of two mutually commuting pieces, the traceful piece and the traceless piece,

$${\displaystyle A=sI+(A-sI)~,}$$

the matrix exponential reduces to a plain product of the exponentials of the two respective pieces. This is a formula often used in physics, as it amounts to the analog of Euler's formula for Pauli spin matrices, that is rotations of the doublet representation of the group SU(2).

The polynomial S_t can also be given the following "interpolation" characterization. Define e_t(z) ≡ e^tz, and n ≡ deg P. Then S_t(z) is the unique degree < n polynomial which satisfies S_t^(k)(a) = e_t^(k)(a) whenever k is less than the multiplicity of a as a root of P. We assume, as we obviously can, that P is the minimal polynomial of A. We further assume that A is a diagonalizable matrix. In particular, the roots of P are simple, and the "interpolation" characterization indicates that S_t is given by the Lagrange interpolation formula, so it is the Lagrange−Sylvester polynomial.

At the other extreme, if P = (z - a)ⁿ, then

$${\displaystyle S_{t}=e^{at}\ \sum _{k=0}^{n-1}\ {\frac {t^{k)){k!))\ (z-a)^{k}~.}$$

The simplest case not covered by the above observations is when ${\displaystyle P=(z-a)^{2}\,(z-b)}$ with a ≠ b, which yields

$${\displaystyle S_{t}=e^{at}\ {\frac {z-b}{a-b))\ \left(1+\left(t+{\frac {1}{b-a))\right)(z-a)\right)+e^{bt}\ {\frac {(z-a)^{2)){(b-a)^{2))}.}$$

Evaluation by implementation of Sylvester's formula

A practical, expedited computation of the above reduces to the following rapid steps. Recall from above that an n×n matrix exp(tA) amounts to a linear combination of the first n−1 powers of A by the Cayley–Hamilton theorem. For diagonalizable matrices, as illustrated above, e.g. in the 2×2 case, Sylvester's formula yields exp(tA) = B_α exp(tα) + B_β exp(tβ), where the Bs are the Frobenius covariants of A.

It is easiest, however, to simply solve for these Bs directly, by evaluating this expression and its first derivative at t = 0, in terms of A and I, to find the same answer as above.

But this simple procedure also works for defective matrices, in a generalization due to Buchheim.^[22] This is illustrated here for a 4×4 example of a matrix which is not diagonalizable, and the Bs are not projection matrices.

Consider

$${\displaystyle A={\begin{bmatrix}1&1&0&0\\0&1&1&0\\0&0&1&-{\frac {1}{8))\\0&0&{\frac {1}{2))&{\frac {1}{2))\end{bmatrix))~,}$$

Consider the exponential of each eigenvalue multiplied by t, exp(λ_it). Multiply each exponentiated eigenvalue by the corresponding undetermined coefficient matrix B_i. If the eigenvalues have an algebraic multiplicity greater than 1, then repeat the process, but now multiplying by an extra factor of t for each repetition, to ensure linear independence.

(If one eigenvalue had a multiplicity of three, then there would be the three terms: ${\displaystyle B_{i_{1))e^{\lambda _{i}t},~B_{i_{2))te^{\lambda _{i}t},~B_{i_{3))t^{2}e^{\lambda _{i}t))$. By contrast, when all eigenvalues are distinct, the Bs are just the Frobenius covariants, and solving for them as below just amounts to the inversion of the Vandermonde matrix of these 4 eigenvalues.)

Sum all such terms, here four such,

$${\displaystyle {\begin{aligned}e^{At}&=B_{1_{1))e^{\lambda _{1}t}+B_{1_{2))te^{\lambda _{1}t}+B_{2_{1))e^{\lambda _{2}t}+B_{2_{2))te^{\lambda _{2}t},\\e^{At}&=B_{1_{1))e^((\frac {3}{4))t}+B_{1_{2))te^((\frac {3}{4))t}+B_{2_{1))e^{1t}+B_{2_{2))te^{1t}~.\end{aligned))}$$

To solve for all of the unknown matrices B in terms of the first three powers of A and the identity, one needs four equations, the above one providing one such at t = 0. Further, differentiate it with respect to t,

$${\displaystyle Ae^{At}={\frac {3}{4))B_{1_{1))e^((\frac {3}{4))t}+\left({\frac {3}{4))t+1\right)B_{1_{2))e^((\frac {3}{4))t}+1B_{2_{1))e^{1t}+\left(1t+1\right)B_{2_{2))e^{1t}~,}$$

and again,

$${\displaystyle {\begin{aligned}A^{2}e^{At}&=\left({\frac {3}{4))\right)^{2}B_{1_{1))e^((\frac {3}{4))t}+\left(\left({\frac {3}{4))\right)^{2}t+\left({\frac {3}{4))+1\cdot {\frac {3}{4))\right)\right)B_{1_{2))e^((\frac {3}{4))t}+B_{2_{1))e^{1t}+\left(1^{2}t+(1+1\cdot 1)\right)B_{2_{2))e^{1t}\\&=\left({\frac {3}{4))\right)^{2}B_{1_{1))e^((\frac {3}{4))t}+\left(\left({\frac {3}{4))\right)^{2}t+{\frac {3}{2))\right)B_{1_{2))e^((\frac {3}{4))t}+B_{2_{1))e^{t}+\left(t+2\right)B_{2_{2))e^{t}~,\end{aligned))}$$

and once more,

$${\displaystyle {\begin{aligned}A^{3}e^{At}&=\left({\frac {3}{4))\right)^{3}B_{1_{1))e^((\frac {3}{4))t}+\left(\left({\frac {3}{4))\right)^{3}t+\left(\left({\frac {3}{4))\right)^{2}+\left({\frac {3}{2))\right)\cdot {\frac {3}{4))\right)\right)B_{1_{2))e^((\frac {3}{4))t}+B_{2_{1))e^{1t}+\left(1^{3}t+(1+2)\cdot 1\right)B_{2_{2))e^{1t}\\&=\left({\frac {3}{4))\right)^{3}B_{1_{1))e^((\frac {3}{4))t}\!+\left(\left({\frac {3}{4))\right)^{3}t\!+{\frac {27}{16))\right)B_{1_{2))e^((\frac {3}{4))t}\!+B_{2_{1))e^{t}\!+\left(t+3\cdot 1\right)B_{2_{2))e^{t}~.\end{aligned))}$$

(In the general case, n−1 derivatives need be taken.)

Setting t = 0 in these four equations, the four coefficient matrices Bs may now be solved for,

$${\displaystyle {\begin{aligned}I&=B_{1_{1))+B_{2_{1))\\A&={\frac {3}{4))B_{1_{1))+B_{1_{2))+B_{2_{1))+B_{2_{2))\\A^{2}&=\left({\frac {3}{4))\right)^{2}B_{1_{1))+{\frac {3}{2))B_{1_{2))+B_{2_{1))+2B_{2_{2))\\A^{3}&=\left({\frac {3}{4))\right)^{3}B_{1_{1))+{\frac {27}{16))B_{1_{2))+B_{2_{1))+3B_{2_{2))~,\end{aligned))}$$

to yield

$${\displaystyle {\begin{aligned}B_{1_{1))&=128A^{3}-366A^{2}+288A-80I\\B_{1_{2))&=16A^{3}-44A^{2}+40A-12I\\B_{2_{1))&=-128A^{3}+366A^{2}-288A+80I\\B_{2_{2))&=16A^{3}-40A^{2}+33A-9I~.\end{aligned))}$$

Substituting with the value for A yields the coefficient matrices

$${\displaystyle {\begin{aligned}B_{1_{1))&={\begin{bmatrix}0&0&48&-16\\0&0&-8&2\\0&0&1&0\\0&0&0&1\end{bmatrix))\\B_{1_{2))&={\begin{bmatrix}0&0&4&-2\\0&0&-1&{\frac {1}{2))\\0&0&{\frac {1}{4))&-{\frac {1}{8))\\0&0&{\frac {1}{2))&-{\frac {1}{4))\end{bmatrix))\\B_{2_{1))&={\begin{bmatrix}1&0&-48&16\\0&1&8&-2\\0&0&0&0\\0&0&0&0\end{bmatrix))\\B_{2_{2))&={\begin{bmatrix}0&1&8&-2\\0&0&0&0\\0&0&0&0\\0&0&0&0\end{bmatrix))\end{aligned))}$$

so the final answer is

$${\displaystyle e^{tA}={\begin{bmatrix}e^{t}&te^{t}&\left(8t-48\right)e^{t}\!+\left(4t+48\right)e^((\frac {3}{4))t}&\left(16-2\,t\right)e^{t}\!+\left(-2t-16\right)e^((\frac {3}{4))t}\\0&e^{t}&8e^{t}\!+\left(-t-8\right)e^((\frac {3}{4))t}&-2e^{t}+{\frac {t+4}{2))e^((\frac {3}{4))t}\\0&0&{\frac {t+4}{4))e^((\frac {3}{4))t}&-{\frac {t}{8))e^((\frac {3}{4))t}\\0&0&{\frac {t}{2))e^((\frac {3}{4))t}&-{\frac {t-4}{4))e^((\frac {3}{4))t}~.\end{bmatrix))}$$

The procedure is much shorter than Putzer's algorithm sometimes utilized in such cases.

Illustrations

Suppose that we want to compute the exponential of

$${\displaystyle B={\begin{bmatrix}21&17&6\\-5&-1&-6\\4&4&16\end{bmatrix)).}$$

Its Jordan form is

$${\displaystyle J=P^{-1}BP={\begin{bmatrix}4&0&0\\0&16&1\\0&0&16\end{bmatrix)),}$$

$${\displaystyle P={\begin{bmatrix}-{\frac {1}{4))&2&{\frac {5}{4))\\{\frac {1}{4))&-2&-{\frac {1}{4))\\0&4&0\end{bmatrix)).}$$

Let us first calculate exp(J). We have

$${\displaystyle J=J_{1}(4)\oplus J_{2}(16)}$$

The exponential of a 1×1 matrix is just the exponential of the one entry of the matrix, so exp(J₁(4)) = [e⁴]. The exponential of J₂(16) can be calculated by the formula e^{(λI + N)} = e^λ e^N mentioned above; this yields^[23]

$${\displaystyle {\begin{aligned}&\exp \left({\begin{bmatrix}16&1\\0&16\end{bmatrix))\right)=e^{16}\exp \left({\begin{bmatrix}0&1\\0&0\end{bmatrix))\right)=\\[6pt]{}={}&e^{16}\left({\begin{bmatrix}1&0\\0&1\end{bmatrix))+{\begin{bmatrix}0&1\\0&0\end{bmatrix))+{1 \over 2!}{\begin{bmatrix}0&0\\0&0\end{bmatrix))+\cdots {}\right)={\begin{bmatrix}e^{16}&e^{16}\\0&e^{16}\end{bmatrix)).\end{aligned))}$$

Therefore, the exponential of the original matrix B is

$${\displaystyle {\begin{aligned}\exp(B)&=P\exp(J)P^{-1}=P{\begin{bmatrix}e^{4}&0&0\\0&e^{16}&e^{16}\\0&0&e^{16}\end{bmatrix))P^{-1}\\[6pt]&={1 \over 4}{\begin{bmatrix}13e^{16}-e^{4}&13e^{16}-5e^{4}&2e^{16}-2e^{4}\\-9e^{16}+e^{4}&-9e^{16}+5e^{4}&-2e^{16}+2e^{4}\\16e^{16}&16e^{16}&4e^{16}\end{bmatrix)).\end{aligned))}$$

Applications

Linear differential equations

The matrix exponential has applications to systems of linear differential equations. (See also matrix differential equation.) Recall from earlier in this article that a homogeneous differential equation of the form

$${\displaystyle \mathbf {y} '=A\mathbf {y} }$$

If we consider the vector

$${\displaystyle \mathbf {y} (t)={\begin{bmatrix}y_{1}(t)\\\vdots \\y_{n}(t)\end{bmatrix))~,}$$

$${\displaystyle \mathbf {y} '(t)=A\mathbf {y} (t)+\mathbf {b} (t).}$$

$${\displaystyle {\begin{aligned}&&e^{-At}\mathbf {y} '-e^{-At}A\mathbf {y} &=e^{-At}\mathbf {b} \\&\Rightarrow &e^{-At}\mathbf {y} '-Ae^{-At}\mathbf {y} &=e^{-At}\mathbf {b} \\&\Rightarrow &{\frac {d}{dt))\left(e^{-At}\mathbf {y} \right)&=e^{-At}\mathbf {b} ~.\end{aligned))}$$

The second step is possible due to the fact that, if AB = BA, then e^AtB = Be^At. So, calculating e^At leads to the solution to the system, by simply integrating the third step with respect to t.

A solution to this can be obtained by integrating and multiplying by ${\displaystyle e^((\textbf {A))t))$ to eliminate the exponent in the LHS. Notice that while ${\displaystyle e^((\textbf {A))t))$ is a matrix, given that it is a matrix exponential, we can say that ${\displaystyle e^((\textbf {A))t}e^{-{\textbf {A))t}=I}$. In other words, ${\displaystyle \exp ((\textbf {A))t}=\exp (((-{\textbf {A))t)}^{-1))}$.

Example (homogeneous)

Consider the system

$${\displaystyle {\begin{matrix}x'&=&2x&-y&+z\\y'&=&&3y&-1z\\z'&=&2x&+y&+3z\end{matrix))~.}$$

The associated defective matrix is

$${\displaystyle A={\begin{bmatrix}2&-1&1\\0&3&-1\\2&1&3\end{bmatrix))~.}$$

The matrix exponential is