{
  "id": "matrix-exponential",
  "title": "Matrix Exponential",
  "lang": "en",
  "source_lang": "en",
  "summary": "The matrix exponential extends the scalar exponential to square matrices and describes continuous linear evolution in differential equations, geometry, probability, and physics.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Exponential of a matrix"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/matrix-exponential/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/matrix-exponential/",
      "json": "https://aiwiki.page/zh/matrix-exponential.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The matrix exponential is a function that assigns to a square matrix \\(A\\) the matrix\n\n\\[e^A=\\exp(A)=\\sum_{k=0}^{\\infty}\\frac{A^k}{k!},\\]\n\nwhere \\(A^0=I\\), the identity matrix. It extends the ordinary exponential function while retaining many of its essential properties, including invertibility and a close connection with differentiation. Its defining series converges for every real or complex square matrix. Unlike an entrywise exponential, it incorporates the interactions represented by matrix multiplication.\n\nThe matrix exponential is the fundamental solution operator for a constant-coefficient linear differential equation: the solution of \\(x'(t)=Ax(t)\\) with initial value \\(x(0)=x_0\\) is \\(x(t)=e^{tA}x_0\\). This makes it central to continuous-time dynamics, transition probabilities, quantum evolution, and the numerical treatment of differential equations. It also connects infinitesimal transformations with finite transformations in the theory of Lie groups.\n\nAlthough its definition is elementary, the matrix exponential presents distinctive algebraic and computational difficulties. Matrix multiplication is generally noncommutative, eigenvalues do not fully determine transient behavior, and direct evaluation of the defining series can be numerically unreliable. Its theory therefore draws together algebraic structure, spectral analysis, differential calculus, and specialized numerical algorithms."
    },
    {
      "heading": "Definition, convergence, and basic constructions",
      "text": "Let \\(A\\in\\mathbb C^{n\\times n}\\), with real matrices included as a special case. The exponential is defined by the power series\n\n\\[e^A=I+A+\\frac{A^2}{2!}+\\frac{A^3}{3!}+\\cdots.\\]\n\nThe powers use ordinary matrix multiplication, not entrywise powers. Thus a diagonal matrix exponentiates entry by entry along its diagonal, but this rule does not extend to a general matrix. In particular, \\(e^0=I\\), whereas taking the scalar exponential of every entry of the zero matrix would produce a matrix of ones.\n\nConvergence follows from any submultiplicative matrix norm, for which \\(\\|AB\\|\\leq\\|A\\|\\|B\\|\\). For each term,\n\n\\[\\left\\|\\frac{A^k}{k!}\\right\\| \\leq \\frac{\\|A\\|^k}{k!},\\]\n\nso the series converges absolutely and satisfies\n\n\\[\\|e^A\\|\\leq e^{\\|A\\|}.\\]\n\nOn bounded sets of matrices, the same comparison gives uniform convergence. Consequently the exponential is an entire analytic function of the matrix entries. In finite dimensions, convergence is independent of the particular norm chosen.\n\nSome elementary examples display the range of behavior encoded by the definition. If \\(D=\\operatorname{diag}(d_1,\\ldots,d_n)\\), then\n\n\\[e^D=\\operatorname{diag}(e^{d_1},\\ldots,e^{d_n}).\\]\n\nIf \\(N\\) is nilpotent, meaning \\(N^m=0\\) for some positive integer \\(m\\), the series terminates:\n\n\\[e^N=\\sum_{k=0}^{m-1}\\frac{N^k}{k!}.\\]\n\nFor example,\n\n\\[N=\\begin{pmatrix}0&a\\\\0&0\\end{pmatrix} \\quad\\Longrightarrow\\quad e^N=\\begin{pmatrix}1&a\\\\0&1\\end{pmatrix}.\\]\n\nAn infinite-series definition can therefore produce a finite algebraic expression.\n\nAnother useful construction is the limit\n\n\\[e^A=\\lim_{m\\to\\infty}\\left(I+\\frac{A}{m}\\right)^m.\\]\n\nThis is the matrix counterpart of the scalar compound-interest limit. It interprets an exponential transformation as the accumulation of many small linear steps. The limit holds in every matrix norm, although it is not normally the preferred numerical method because a large number of multiplications may be required.\n\nThe Cayley–Hamilton theorem supplies a different finite representation. Because a square matrix satisfies its own characteristic polynomial, every power of \\(A\\) can be reduced to a linear combination of \\(I,A,\\ldots,A^{n-1}\\). Hence \\(e^A\\) can always be expressed as a polynomial in \\(A\\) of degree below \\(n\\), and often below the degree of the minimal polynomial. The coefficients depend on the matrix’s spectral data; this statement does not mean that truncating the exponential series after \\(n\\) terms is exact."
    },
    {
      "heading": "Algebraic identities and the role of noncommutativity",
      "text": "Several scalar exponential identities remain valid because all powers of a single matrix commute. In particular,\n\n\\[e^{sA}e^{tA}=e^{(s+t)A}, \\qquad (e^A)^{-1}=e^{-A}.\\]\n\nThus every matrix exponential is invertible, even when \\(A\\) itself is singular. The parameterized family \\(t\\mapsto e^{tA}\\) forms a one-parameter group under multiplication. The parameter may be real or complex; for real evolution equations it is usually interpreted as time.\n\nFor two different matrices, the familiar addition law requires care. If \\(AB=BA\\), then\n\n\\[e^{A+B}=e^Ae^B.\\]\n\nWithout this hypothesis the identity generally fails. For example, take\n\n\\[A=\\begin{pmatrix}0&1\\\\0&0\\end{pmatrix}, \\qquad B=\\begin{pmatrix}0&0\\\\1&0\\end{pmatrix}.\\]\n\nSince \\(A^2=B^2=0\\),\n\n\\[e^Ae^B= \\begin{pmatrix}2&1\\\\1&1\\end{pmatrix},\\]\n\nwhereas \\((A+B)^2=I\\), giving\n\n\\[e^{A+B}= \\begin{pmatrix}\\cosh 1&\\sinh 1\\\\\\sinh 1&\\cosh 1\\end{pmatrix}.\\]\n\nCommutation is a sufficient condition for the addition law, but equality at a particular pair of matrices does not, in general, imply commutation.\n\nThe exponential respects similarity transformations:\n\n\\[e^{SAS^{-1}}=Se^AS^{-1}.\\]\n\nIt therefore represents an intrinsic operation on a linear operator rather than an operation tied to a chosen coordinate system. It also respects direct sums, transposition, and conjugate transposition:\n\n\\[e^{A\\oplus B}=e^A\\oplus e^B,\\qquad (e^A)^T=e^{A^T},\\qquad (e^A)^*=e^{A^*}.\\]\n\nHere \\(A^*\\) denotes the conjugate transpose. These identities allow structural properties to be inferred without explicitly summing the series.\n\nA particularly important relation connects the determinant with the trace:\n\n\\[\\det(e^A)=e^{\\operatorname{tr}A}.\\]\n\nFor real \\(A\\), the determinant of \\(e^A\\) is therefore strictly positive. If \\(\\operatorname{tr}A=0\\), the exponential preserves oriented volume. The trace of the exponential, by contrast, is generally not the exponential of the trace.\n\nNoncommutative corrections are organized by the Baker–Campbell–Hausdorff formula. Near the zero matrices, a suitable logarithm of \\(e^Ae^B\\) begins\n\n\\[\\log(e^Ae^B) =A+B+\\frac12[A,B] +\\frac1{12}[A,[A,B]] +\\frac1{12}[B,[B,A]]+\\cdots,\\]\n\nwhere \\([A,B]=AB-BA\\). These commutator terms describe the leading error in replacing two successive transformations by the exponential of their sum. The expansion has convergence restrictions and is also used as a formal series."
    },
    {
      "heading": "Eigenvalues, Jordan structure, and explicit formulas",
      "text": "The exponential transforms spectral values in a simple way. If \\(Av=\\lambda v\\) with \\(v\\ne0\\), then\n\n\\[e^Av=e^\\lambda v.\\]\n\nMore generally, the spectral mapping theorem gives\n\n\\[\\sigma(e^A)=\\{e^\\lambda:\\lambda\\in\\sigma(A)\\},\\]\n\nwhere \\(\\sigma(A)\\) denotes the set of eigenvalues of \\(A\\). Algebraic multiplicities must be combined when different eigenvalues have the same scalar exponential, as can happen when they differ by an integer multiple of \\(2\\pi i\\).\n\nIf \\(A\\) admits diagonalization,\n\n\\[A=V\\Lambda V^{-1},\\]\n\nthen\n\n\\[e^A=V\\operatorname{diag}(e^{\\lambda_1},\\ldots,e^{\\lambda_n})V^{-1}.\\]\n\nThis formula is especially useful for normal matrices, which have a unitary eigenvector basis by the spectral theorem. For a general diagonalizable matrix, an ill-conditioned eigenvector matrix \\(V\\) can make direct numerical use of the formula inaccurate. A matrix may also fail to be diagonalizable altogether.\n\nThe Jordan normal form handles the latter case. For a Jordan block\n\n\\[J=\\lambda I+N,\\qquad N^m=0,\\]\n\nthe scalar part commutes with \\(N\\), so\n\n\\[e^{tJ}=e^{t\\lambda} \\left(I+tN+\\frac{t^2N^2}{2!} +\\cdots+\\frac{t^{m-1}N^{m-1}}{(m-1)!}\\right).\\]\n\nThus nondiagonalizable structure introduces polynomial factors in time. For a block of size two,\n\n\\[\\exp\\left(t \\begin{pmatrix}\\lambda&1\\\\0&\\lambda\\end{pmatrix}\\right) =e^{t\\lambda} \\begin{pmatrix}1&t\\\\0&1\\end{pmatrix}.\\]\n\nThis explains why eigenvalues alone do not capture all aspects of growth.\n\nExplicit formulas can also be constructed without forming Jordan coordinates. For distinct eigenvalues, polynomial interpolation produces a polynomial \\(p\\) satisfying \\(p(\\lambda_j)=e^{\\lambda_j}\\), with \\(e^A=p(A)\\) when \\(A\\) is diagonalizable. In the presence of nontrivial Jordan blocks, derivative conditions are also required: \\(p^{(r)}(\\lambda)=e^\\lambda\\) for the derivative orders dictated by the largest block at \\(\\lambda\\). These are Hermite interpolation conditions.\n\nFor a real \\(2\\times2\\) matrix, a compact formula follows by writing \\(A=\\tau I+B\\), where \\(\\tau=\\operatorname{tr}(A)/2\\). The Cayley–Hamilton theorem gives\n\n\\[B^2=\\delta^2I,\\qquad \\delta^2=\\tau^2-\\det A.\\]\n\nConsequently,\n\n\\[e^A=e^\\tau\\left(\\cosh\\delta\\,I+ \\frac{\\sinh\\delta}{\\delta}B\\right),\\]\n\nwith \\(\\sinh\\delta/\\delta\\) interpreted as \\(1\\) at \\(\\delta=0\\). When \\(\\delta\\) is imaginary, the formula can be rewritten using real sine and cosine. It displays directly the connection between exponential growth, shear, and oscillation."
    },
    {
      "heading": "Linear differential equations and stability",
      "text": "For the constant-coefficient ordinary differential equation\n\n\\[x'(t)=Ax(t),\\qquad x(0)=x_0,\\]\n\ntermwise differentiation gives\n\n\\[\\frac{d}{dt}e^{tA}=Ae^{tA}=e^{tA}A.\\]\n\nThe unique solution is therefore \\(x(t)=e^{tA}x_0\\). The columns of \\(e^{tA}\\) are the solutions starting from the coordinate basis vectors. More generally, the transition from time \\(s\\) to time \\(t\\) is \\(e^{(t-s)A}\\).\n\nFor an inhomogeneous equation,\n\n\\[x'(t)=Ax(t)+f(t),\\]\n\nthe variation-of-constants formula is\n\n\\[x(t)=e^{tA}x_0+ \\int_0^t e^{(t-s)A}f(s)\\,ds.\\]\n\nThe integral expresses the accumulated response to forcing: an input applied at time \\(s\\) subsequently evolves for \\(t-s\\) units of time. This formula underlies linear response theory and many methods for forced dynamical systems.\n\nLong-time behavior depends on both eigenvalues and Jordan structure. Every solution tends to zero as \\(t\\to\\infty\\) precisely when all eigenvalues have strictly negative real parts. Boundedness of \\(e^{tA}\\) for \\(t\\geq0\\) requires all eigenvalues to have nonpositive real parts and every Jordan block associated with an eigenvalue on the imaginary axis to have size one. A nontrivial block at a purely imaginary eigenvalue introduces an unbounded polynomial factor.\n\nEven when every eigenvalue lies in the open left half-plane, substantial transient amplification is possible. Consider\n\n\\[A=\\begin{pmatrix}-1&K\\\\0&-2\\end{pmatrix}.\\]\n\nIts exponential is\n\n\\[e^{tA}= \\begin{pmatrix} e^{-t}&K(e^{-t}-e^{-2t})\\\\ 0&e^{-2t} \\end{pmatrix}.\\]\n\nBoth eigenvalues are negative, but at \\(t=\\log2\\) the off-diagonal entry is \\(K/4\\). Large \\(K\\) therefore permits large intermediate responses before eventual decay. This is characteristic of nonnormal systems and matters in hydrodynamic stability, control, and numerical error analysis.\n\nThe constant-coefficient assumption is essential. For \\(x'=A(t)x\\), the expression\n\n\\[\\exp\\left(\\int_0^t A(s)\\,ds\\right)\\]\n\nis a solution operator when the matrices commute at different times, but not in general. The correct propagator can be represented by a time-ordered series of iterated integrals. The Magnus expansion, introduced by Wilhelm Magnus in 1954, instead writes it as \\(e^{\\Omega(t)}\\), with the first terms\n\n\\[\\Omega_1(t)=\\int_0^t A(s)\\,ds,\\]\n\n\\[\\Omega_2(t)=\\frac12\\int_0^t ds_1 \\int_0^{s_1}ds_2\\,[A(s_1),A(s_2)].\\]\n\nThe second term measures the failure of the coefficient matrices to commute."
    },
    {
      "heading": "Geometry, Lie groups, and matrix logarithms",
      "text": "In a matrix Lie group, the exponential connects an infinitesimal generator with a finite transformation. The associated Lie algebra consists of tangent directions at the identity, equipped with the matrix commutator. For an element \\(A\\) of this algebra, \\(t\\mapsto e^{tA}\\) is a one-parameter subgroup. This gives the exponential a geometric interpretation distinct from its power-series definition.\n\nIf a real matrix \\(K\\) is skew-symmetric, \\(K^T=-K\\), then\n\n\\[(e^K)^Te^K=e^{-K}e^K=I,\\]\n\nand \\(\\det(e^K)=1\\). Hence \\(e^K\\) is an orthogonal matrix representing a proper rotation. In two dimensions,\n\n\\[K=\\begin{pmatrix}0&-\\theta\\\\\\theta&0\\end{pmatrix} \\quad\\Longrightarrow\\quad e^K= \\begin{pmatrix}\\cos\\theta&-\\sin\\theta\\\\ \\sin\\theta&\\cos\\theta\\end{pmatrix}.\\]\n\nIn three dimensions, the analogous construction yields Rodrigues’ rotation formula. Similarly, skew-Hermitian matrices exponentiate to unitary matrices.\n\nOther structures follow from the same reasoning. A Hermitian matrix exponentiates to a Hermitian positive-definite matrix, because its real eigenvalues become strictly positive. Conversely, every Hermitian positive-definite matrix has a unique Hermitian logarithm. For real symmetric matrices, these statements hold entirely over the real numbers. They provide useful coordinates for covariance matrices and other positive-definite objects.\n\nA matrix logarithm of an invertible matrix \\(M\\) is a matrix \\(L\\) such that \\(e^L=M\\). Every invertible complex matrix has at least one complex logarithm, but logarithms are not generally unique. Even \\(I\\) has many logarithms: a two-dimensional rotation generator through \\(2\\pi\\), for example, exponentiates to \\(I\\). If \\(M\\) has no eigenvalues on the closed negative real axis, it has a unique principal logarithm whose eigenvalues have imaginary parts in \\((-\\pi,\\pi)\\).\n\nThe real case has additional restrictions. A real matrix has a real logarithm if and only if it is invertible and, for each negative real eigenvalue, Jordan blocks of every given size occur an even number of times. Positive determinant is necessary but not sufficient. The matrix \\(\\operatorname{diag}(-1,-2)\\) has positive determinant but no real logarithm, whereas \\(-I\\) in dimension two does have one.\n\nThese facts also show why a Lie-group exponential need not reach every group element. Every real matrix exponential belongs to the identity component of the general linear group, but not every element of that component is a single exponential. Locally near zero, however, the exponential is invertible onto a neighborhood of the identity, because its derivative at zero is the identity map."
    },
    {
      "heading": "Differentiation, perturbations, and conditioning",
      "text": "Differentiation with respect to a scalar time parameter is simple because \\(A\\) commutes with its own exponential. Differentiating with respect to the matrix itself is more subtle. If \\(A\\) is perturbed in a direction \\(E\\), the Fréchet derivative of the exponential is\n\n\\[L_{\\exp}(A,E) =\\int_0^1 e^{(1-s)A}E e^{sA}\\,ds.\\]\n\nIt is the linear term in\n\n\\[e^{A+E}=e^A+L_{\\exp}(A,E)+O(\\|E\\|^2).\\]\n\nThe derivative is linear in \\(E\\), but generally cannot be simplified to \\(e^AE\\), because \\(E\\) need not commute with \\(A\\).\n\nExpanding the defining series gives the equivalent expression\n\n\\[L_{\\exp}(A,E) =\\sum_{k=1}^{\\infty}\\frac1{k!} \\sum_{j=0}^{k-1}A^jEA^{k-1-j}.\\]\n\nEvery possible location of the perturbation among the factors contributes. If \\(AE=EA\\), all terms of each inner sum coincide, and the formula reduces to \\(L_{\\exp}(A,E)=e^AE\\). This distinction is important in automatic differentiation, parameter estimation, and optimization involving matrix exponentials.\n\nFor a differentiable matrix-valued function \\(A(t)\\), the correct chain rule is\n\n\\[\\frac{d}{dt}e^{A(t)} =L_{\\exp}(A(t),A'(t)).\\]\n\nA useful computational identity packages the exponential and its derivative into one block matrix:\n\n\\[\\exp\\begin{pmatrix}A&E\\\\0&A\\end{pmatrix} = \\begin{pmatrix} e^A&L_{\\exp}(A,E)\\\\ 0&e^A \\end{pmatrix}.\\]\n\nThis identity supports both theoretical derivations and algorithms for derivative evaluation, although specialized methods can avoid forming the full doubled matrix.\n\nThe norm of this linear derivative measures sensitivity. For \\(A\\ne0\\), a relative condition number can be defined by\n\n\\[\\operatorname{cond}_{\\exp}(A) =\\frac{\\|L_{\\exp}(A)\\|\\,\\|A\\|}{\\|e^A\\|},\\]\n\nwhere \\(\\|L_{\\exp}(A)\\|\\) is the induced operator norm on perturbation matrices. Large conditioning means that small relative changes in \\(A\\) can cause much larger relative changes in its exponential. This is a property of the mathematical problem, not of the chosen algorithm.\n\nAn exact perturbation identity makes the dependence explicit:\n\n\\[e^{A+E}-e^A =\\int_0^1 e^{(1-s)(A+E)}E e^{sA}\\,ds.\\]\n\nIt follows by differentiating \\(e^{(1-s)(A+E)}e^{sA}\\) with respect to \\(s\\). Norm estimates then give, for example,\n\n\\[\\|e^{A+E}-e^A\\| \\leq \\|E\\|e^{\\|A\\|+\\|E\\|}.\\]\n\nThis bound is general but can be pessimistic; sharper estimates account for normality, spectral location, and transient growth."
    },
    {
      "heading": "Dense numerical computation",
      "text": "For a moderate-sized dense matrix, the task is usually to compute every entry of \\(e^A\\) in floating-point arithmetic. Direct summation of the Taylor series is not uniformly reliable: many terms may be needed, and large intermediate terms may cancel to produce a much smaller answer. Direct diagonalization can also fail numerically when eigenvectors are ill-conditioned, even if the exact diagonalization formula is valid.\n\nA widely used approach is scaling and squaring, based on\n\n\\[e^A=\\left(e^{A/2^s}\\right)^{2^s}.\\]\n\nA nonnegative integer \\(s\\) is chosen so that the scaled matrix is suitable for accurate approximation. After computing an approximation \\(R\\approx e^{A/2^s}\\), the algorithm squares \\(R\\) repeatedly \\(s\\) times. The central decisions are how to approximate the small exponential and how much scaling is appropriate.\n\nThe Padé approximant supplies a rational approximation\n\n\\[r_m(z)=\\frac{p_m(z)}{q_m(z)}\\]\n\nwhose Taylor expansion agrees with \\(e^z\\) through degree \\(2m\\). For the diagonal \\([m/m]\\) approximant, one may take\n\n\\[p_m(z)= \\sum_{k=0}^m \\frac{(2m-k)!\\,m!}{(2m)!\\,(m-k)!\\,k!}z^k, \\qquad q_m(z)=p_m(-z).\\]\n\nThe matrix approximation is evaluated by solving\n\n\\[q_m(A)R=p_m(A),\\]\n\nrather than by explicitly forming an inverse. Efficient polynomial evaluation reduces the number of matrix multiplications.\n\nThe scaling parameter and approximation degree are selected using error bounds appropriate to the working precision. In double precision, diagonal Padé degrees such as \\(3,5,7,9,\\) and \\(13\\) occur in established implementations. Excessive scaling, called overscaling, adds cost and can increase rounding errors during repeated squaring. Modern schemes therefore use estimates involving powers of \\(A\\), not merely a crude bound based on \\(\\|A\\|\\).\n\nThe Schur decomposition provides another valuable framework:\n\n\\[A=QTQ^*,\\qquad e^A=Qe^TQ^*,\\]\n\nwith unitary \\(Q\\) and triangular \\(T\\). Unlike Jordan form, Schur form is numerically stable to compute. Triangular structure permits specialized recurrences, although nearly equal diagonal entries require careful treatment to avoid unstable divisions.\n\nThe development of these algorithms was surveyed by Cleve Moler and Charles Van Loan in their 1978 paper Nineteen Dubious Ways to Compute the Exponential of a Matrix, revisited in 2003. Nicholas Higham’s 2005 scaling-and-squaring analysis and subsequent work with Awad Al-Mohy refined error bounds and scaling selection. A central standard is backward error: whether the computed result can be interpreted as \\(e^{A+\\Delta A}\\) for a small perturbation \\(\\Delta A\\). Small backward error and good conditioning together support a small forward error."
    },
    {
      "heading": "Large sparse systems and exponential actions",
      "text": "In a large system, forming the full matrix exponential may be impractical and unnecessary. Even when \\(A\\) is sparse, \\(e^A\\) is usually dense. A differential-equation application often needs only\n\n\\[y=e^{tA}v\\]\n\nfor one vector \\(v\\), or the corresponding action on a small block of vectors. Algorithms for this exponential action exploit matrix-vector products without constructing all \\(n^2\\) entries of \\(e^{tA}\\).\n\nA major approach projects the problem onto a Krylov subspace\n\n\\[\\mathcal K_m(A,v)= \\operatorname{span}\\{v,Av,\\ldots,A^{m-1}v\\}.\\]\n\nThe Arnoldi process builds an orthonormal basis \\(V_m\\) and a small upper-Hessenberg matrix \\(H_m\\), satisfying\n\n\\[AV_m=V_mH_m+h_{m+1,m}v_{m+1}e_m^T.\\]\n\nIf \\(\\beta=\\|v\\|_2\\), the approximation is\n\n\\[e^{tA}v\\approx \\beta V_m e^{tH_m}e_1.\\]\n\nOnly the exponential of the much smaller matrix \\(H_m\\) must be formed.\n\nFor Hermitian \\(A\\), the Lanczos process produces a tridiagonal projected matrix, reducing storage and arithmetic in exact arithmetic. Convergence depends on spectral geometry, the time interval, and the relationship between \\(v\\) and the invariant subspaces of \\(A\\). Large time intervals may be split into shorter steps, with adaptive selection of step lengths and subspace dimensions. Residual-based estimates help monitor approximation quality, although nonnormality complicates the conversion of residual bounds into error bounds.\n\nPolynomial methods provide an alternative. A truncated Taylor polynomial can be applied recursively through matrix-vector products, combined with time scaling to keep each stage accurate. Such algorithms avoid storing a large Krylov basis and can work efficiently for several right-hand sides. Chebyshev polynomial expansions are particularly effective for Hermitian matrices with a known spectral interval. Rational Krylov methods use shifted linear solves and can outperform polynomial methods for some stiff problems, at the cost of solving systems involving \\(A\\).\n\nThe same machinery evaluates auxiliary functions used in exponential integrators. Define\n\n\\[\\varphi_k(z)=\\sum_{j=0}^{\\infty}\\frac{z^j}{(j+k)!}.\\]\n\nIn particular, \\(\\varphi_1(z)=(e^z-1)/z\\), continuously extended to \\(z=0\\). For constant forcing \\(b\\),\n\n\\[x(t+h)=e^{hA}x(t)+h\\varphi_1(hA)b.\\]\n\nThese functions remain well-defined when \\(A\\) is singular, unlike formulas requiring \\(A^{-1}\\). Exponential integrators use such actions to treat a stiff linear part exactly while approximating nonlinear or time-dependent terms."
    },
    {
      "heading": "Probability, control, and quantum evolution",
      "text": "For a finite-state continuous-time Markov chain, let \\(Q\\) be a generator in the row-vector convention: its off-diagonal entries are nonnegative and each row sums to zero. The transition matrix is\n\n\\[P(t)=e^{tQ}.\\]\n\nIt satisfies \\(P(0)=I\\), has nonnegative entries and row sums equal to one, and obeys\n\n\\[P(t+s)=P(t)P(s).\\]\n\nThis is the continuous-time semigroup form of the Chapman–Kolmogorov equations. A row probability vector evolves as \\(p(t)=p(0)e^{tQ}\\).\n\nUniformization makes the probabilistic meaning explicit. Choose\n\n\\[\\nu\\geq\\max_i(-q_{ii}),\\qquad \\nu>0,\\]\n\nand set \\(R=I+Q/\\nu\\). Then \\(R\\) is a stochastic matrix and\n\n\\[e^{tQ}=e^{-\\nu t} \\sum_{k=0}^{\\infty}\\frac{(\\nu t)^k}{k!}R^k.\\]\n\nThe continuous-time transition law is thus a mixture of discrete-time transitions, with the number of steps distributed according to a Poisson distribution of mean \\(\\nu t\\). This also gives a computational method with truncation errors controlled by Poisson tail probabilities.\n\nIn control theory, the continuous-time linear system\n\n\\[x'(t)=Ax(t)+Bu(t)\\]\n\nhas exact sampled dynamics under a piecewise-constant input:\n\n\\[x_{k+1}=A_dx_k+B_du_k,\\]\n\nwhere\n\n\\[A_d=e^{hA},\\qquad B_d=\\int_0^h e^{sA}B\\,ds.\\]\n\nBoth quantities can be obtained from one block exponential,\n\n\\[\\exp\\left( h\\begin{pmatrix}A&B\\\\0&0\\end{pmatrix} \\right) = \\begin{pmatrix}A_d&B_d\\\\0&I\\end{pmatrix}.\\]\n\nUnlike \\(A^{-1}(e^{hA}-I)B\\), this formula remains valid when \\(A\\) is singular.\n\nIn finite-dimensional quantum mechanics, a time-independent Hermitian Hamiltonian \\(H\\) generates the evolution\n\n\\[\\psi(t)=e^{-itH/\\hbar}\\psi(0).\\]\n\nThe exponent is skew-Hermitian, so the propagator is unitary and preserves the state norm. Its eigenvalues are phase factors \\(e^{-itE_j/\\hbar}\\), where \\(E_j\\) are energy eigenvalues. At inverse temperature \\(\\beta\\), the same Hamiltonian produces the equilibrium density matrix\n\n\\[\\rho=\\frac{e^{-\\beta H}}{\\operatorname{tr}(e^{-\\beta H})}.\\]\n\nHere the exponential is positive definite rather than unitary.\n\nSplitting formulas link these applications to computation. The Lie–Trotter product formula gives\n\n\\[e^{t(A+B)} =\\lim_{m\\to\\infty} \\left(e^{tA/m}e^{tB/m}\\right)^m.\\]\n\nFor fixed finite matrices and bounded time intervals, the symmetric step\n\n\\[e^{hA/2}e^{hB}e^{hA/2}\\]\n\nhas local error of order \\(h^3\\). Such constructions are useful when exponentials of the separate components are easier to compute or preserve structures such as unitarity."
    },
    {
      "heading": "Operator extensions, diffusion, and network interpretation",
      "text": "The finite-dimensional exponential belongs to a broader theory of operator evolution. If \\(A\\) is a bounded linear operator on a Banach space, the same power series converges in operator norm and defines \\(e^{tA}\\). The finite-dimensional derivation of the constant-coefficient evolution equation then carries over. For unbounded operators, however, the power series need not be defined on every vector, and domain questions become essential.\n\nThe heat equation provides a standard example. With suitable boundary conditions,\n\n\\[\\frac{\\partial u}{\\partial t}=\\Delta u\\]\n\nis written formally as \\(u(t)=e^{t\\Delta}u_0\\), where \\(\\Delta\\) is the Laplacian. This notation denotes an operator semigroup rather than an ordinary finite matrix exponential. When eigenfunctions satisfy\n\n\\[-\\Delta\\phi_j=\\mu_j\\phi_j,\\]\n\nthe solution has the spectral representation\n\n\\[u(t)=\\sum_j e^{-t\\mu_j} \\langle u_0,\\phi_j\\rangle\\phi_j,\\]\n\nunder the appropriate function-space assumptions.\n\nSpatial discretization by finite differences or finite elements produces a finite-dimensional system such as\n\n\\[M u'(t)+Ku(t)=0,\\]\n\nwhere \\(M\\) is a mass matrix and \\(K\\) a stiffness matrix. If \\(M\\) is invertible, the solution is\n\n\\[u(t)=e^{-tM^{-1}K}u(0).\\]\n\nPractical algorithms may apply \\(M^{-1}K\\) through linear solves rather than form it explicitly. Large eigenvalues associated with fine spatial scales make the system stiff, motivating exponential-action methods that handle the linear evolution without the stability restriction of an explicit Euler step.\n\nOn a finite graph, the exponential has a combinatorial interpretation. For an adjacency matrix \\(W\\), the entry \\((W^k)_{ij}\\) counts length-\\(k\\) walks from vertex \\(i\\) to vertex \\(j\\) in an unweighted graph. Therefore\n\n\\[(e^{tW})_{ij} =\\sum_{k=0}^{\\infty}\\frac{t^k}{k!}(W^k)_{ij}\\]\n\nis a weighted sum over walks of all lengths. Network communicability measures use this construction to include both direct and indirect connections. The result is not generally a transition-probability matrix, because an adjacency matrix need not have the conservation properties of a Markov generator.\n\nFor an undirected graph with Laplacian \\(L=D-W\\), the matrix \\(e^{-tL}\\) instead describes diffusion. The Laplacian is symmetric positive semidefinite, so its eigenmodes are multiplied by factors \\(e^{-t\\lambda_j}\\). Nonconstant modes decay while zero modes persist. On a connected graph with \\(n\\) vertices,\n\n\\[\\lim_{t\\to\\infty}e^{-tL} =\\frac1n\\mathbf1\\mathbf1^T.\\]\n\nThus diffusion approaches the average initial value at every vertex. For a disconnected graph, the limiting projection retains a separate constant value on each connected component."
    }
  ],
  "links": [
    "mathematical-function",
    "matrix",
    "identity-matrix",
    "exponential-function",
    "differential-equation",
    "power-series",
    "matrix-multiplication",
    "norm-mathematics",
    "uniform-convergence",
    "cayley-hamilton-theorem",
    "characteristic-polynomial",
    "matrix-similarity",
    "conjugate-transpose",
    "determinant",
    "matrix-trace",
    "baker-campbell-hausdorff-formula",
    "eigenvalues-and-eigenvectors",
    "matrix-diagonalization",
    "spectral-theorem",
    "jordan-normal-form",
    "interpolation",
    "ordinary-differential-equation",
    "lie-group",
    "lie-algebra",
    "orthogonal-matrix",
    "unitary-matrix",
    "positive-definite-matrix",
    "automatic-differentiation",
    "chain-rule",
    "condition-number",
    "floating-point-arithmetic",
    "inverse-matrix",
    "schur-decomposition",
    "sparse-matrix",
    "continuous-time-markov-chain",
    "chapman-kolmogorov-equations",
    "poisson-distribution",
    "control-theory",
    "quantum-mechanics",
    "banach-space",
    "heat-equation",
    "laplace-operator",
    "adjacency-matrix"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}