Submitted Successfully!
To reward your contribution, here is a gift for you: A free trial for our video production service.
Thank you for your contribution! You can also upload a video entry or images related to this topic.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki -- 2057 2022-10-13 01:35:36

Do you have a full video?

# Confirm

Are you sure to Delete?
Cite
HandWiki. Magnus Expansion. Encyclopedia. Available online: https://encyclopedia.pub/entry/30666 (accessed on 09 September 2024).
HandWiki. Magnus Expansion. Encyclopedia. Available at: https://encyclopedia.pub/entry/30666. Accessed September 09, 2024.
HandWiki. "Magnus Expansion" Encyclopedia, https://encyclopedia.pub/entry/30666 (accessed September 09, 2024).
HandWiki. (2022, October 21). Magnus Expansion. In Encyclopedia. https://encyclopedia.pub/entry/30666
HandWiki. "Magnus Expansion." Encyclopedia. Web. 21 October, 2022.
Magnus Expansion

In mathematics and physics, the Magnus expansion, named after Wilhelm Magnus (1907–1990), provides an exponential representation of the solution of a first-order homogeneous linear differential equation for a linear operator. In particular, it furnishes the fundamental matrix of a system of linear ordinary differential equations of order n with varying coefficients. The exponent is aggregated as an infinite series, whose terms involve multiple integrals and nested commutators.

fundamental matrix differential equation physics

## 1. The Deterministic Case

### 1.1. Magnus Approach and Its Interpretation

Given the n × n coefficient matrix A(t), one wishes to solve the initial-value problem associated with the linear ordinary differential equation

$\displaystyle{ Y'(t) = A(t) Y(t), \quad Y(t_0) = Y_0 }$

for the unknown n-dimensional vector function Y(t).

When n = 1, the solution simply reads

$\displaystyle{ Y(t) = \exp \left( \int_{t_0}^t A(s)\,ds \right) Y_0. }$

This is still valid for n > 1 if the matrix A(t) satisfies A(t1) A(t2) = A(t2) A(t1) for any pair of values of t, t1 and t2. In particular, this is the case if the matrix A is independent of t. In the general case, however, the expression above is no longer the solution of the problem.

The approach introduced by Magnus to solve the matrix initial-value problem is to express the solution by means of the exponential of a certain n × n matrix function Ω(t, t0):

$\displaystyle{ Y(t) = \exp\big(\Omega(t, t_0)\big) \, Y_0, }$

which is subsequently constructed as a series expansion:

$\displaystyle{ \Omega(t) = \sum_{k=1}^\infty \Omega_k(t), }$

where, for simplicity, it is customary to write Ω(t) for Ω(t, t0) and to take t0 = 0.

Magnus appreciated that, since d/dt (eΩ) e−Ω = A(t), using a Poincaré−Hausdorff matrix identity, he could relate the time derivative of Ω to the generating function of Bernoulli numbers and the adjoint endomorphism of Ω,

$\displaystyle{ \Omega' = \frac{\operatorname{ad}_\Omega}{\exp(\operatorname{ad}_\Omega) - 1} A, }$

to solve for Ω recursively in terms of A "in a continuous analog of the CBH expansion", as outlined in a subsequent section.

The equation above constitutes the Magnus expansion, or Magnus series, for the solution of matrix linear initial-value problem. The first four terms of this series read

\displaystyle{ \begin{align} \Omega_1(t) &= \int_0^t A(t_1)\,dt_1, \\ \Omega_2(t) &= \frac{1}{2} \int_0^t dt_1 \int_0^{t_1} dt_2 \, [A(t_1), A(t_2)], \\ \Omega_3(t) &= \frac{1}{6} \int_0^t dt_1 \int_0^{t_1} dt_2 \int_0^{t_2} dt_3 \, \Bigl(\big[A(t_1), [A(t_2), A(t_3)]\big] + \big[A(t_3), [A(t_2), A(t_1)]\big]\Bigr), \\ \Omega_4(t) &= \frac{1}{12} \int_0^t dt_1 \int_0^{t_1}d t_2 \int_0^{t_2} dt_3 \int_0^{t_3} dt_4\, \left(\Big[\big[[A_1, A_2], A_3\big], A_4\Big]\right. \\ &\qquad + \Big[A_1, \big[[A_2, A_3], A_4\big]\Big] + \Big[A_1, \big[A_2, [A_3, A_4]\big]\Big] +\left. \Big[A_2, \big[A_3, [A_4, A_1]\big]\Big]\right), \end{align} }

where [A, B] ≡ A BB A is the matrix commutator of A and B.

These equations may be interpreted as follows: Ω1(t) coincides exactly with the exponent in the scalar (n = 1) case, but this equation cannot give the whole solution. If one insists in having an exponential representation (Lie group), the exponent needs to be corrected. The rest of the Magnus series provides that correction systematically: Ω or parts of it are in the Lie algebra of the Lie group on the solution.

In applications, one can rarely sum exactly the Magnus series, and one has to truncate it to get approximate solutions. The main advantage of the Magnus proposal is that the truncated series very often shares important qualitative properties with the exact solution, at variance with other conventional perturbation theories. For instance, in classical mechanics the symplectic character of the time evolution is preserved at every order of approximation. Similarly, the unitary character of the time evolution operator in quantum mechanics is also preserved (in contrast, e.g., to the Dyson series solving the same problem).

### 1.2. Convergence of the Expansion

From a mathematical point of view, the convergence problem is the following: given a certain matrix A(t), when can the exponent Ω(t) be obtained as the sum of the Magnus series?

A sufficient condition for this series to converge for t ∈ [0,T) is

$\displaystyle{ \int_0^T \|A(s)\|_2 \, ds \lt \pi, }$

where $\displaystyle{ \| \cdot \|_2 }$ denotes a matrix norm. This result is generic in the sense that one may construct specific matrices A(t) for which the series diverges for any t > T.

### 1.3. Magnus Generator

A recursive procedure to generate all the terms in the Magnus expansion utilizes the matrices Sn(k) defined recursively through

$\displaystyle{ S_n^{(j)} = \sum_{m=1}^{n-j} \left[\Omega_m, S_{n-m}^{(j-1)}\right], \quad 2 \leq j \leq n - 1, }$
$\displaystyle{ S_n^{(1)} = \left[\Omega_{n-1}, A\right], \quad S_n^{(n-1)} = \operatorname{ad}_{\Omega_1}^{n-1}(A), }$

which then furnish

$\displaystyle{ \Omega_1 = \int_0^t A(\tau) \, d\tau, }$
$\displaystyle{ \Omega_n = \sum_{j=1}^{n-1} \frac{B_j}{j!} \int_0^t S_n^{(j)}(\tau) \, d\tau , \quad n \geq 2. }$

Here adkΩ is a shorthand for an iterated commutator (see adjoint endomorphism):

$\displaystyle{ \operatorname{ad}_{\Omega}^0 A = A, \quad \operatorname{ad}_{\Omega}^{k+1} A = [\Omega, \operatorname{ad}_\Omega^k A], }$

while Bj are the Bernoulli numbers with B1 = −1/2.

Finally, when this recursion is worked out explicitly, it is possible to express Ωn(t) as a linear combination of n-fold integrals of n − 1 nested commutators involving n matrices A:

$\displaystyle{ \Omega_n(t) = \sum_{j=1}^{n-1} \frac{B_j}{j!} \sum_{k_1 + \cdots + k_j = n-1 \atop k_1 \ge 1, \ldots, k_j \ge 1} \int_0^t \operatorname{ad}_{\Omega_{k_1}(\tau)} \operatorname{ad}_{\Omega_{k_2}(\tau )} \cdots \operatorname{ad}_{\Omega_{k_j}(\tau)} A(\tau) \, d\tau, \quad n \ge 2, }$

which becomes increasingly intricate with n.

## 2. The Stochastic Case

### 2.1. Extension To Stochastic Ordinary Differential Equations

For the extension to the stochastic case let $\displaystyle{ \left(W_t\right)_{t\in [0,T]} }$ be a $\displaystyle{ \mathbb{R}^q }$-dimensional Brownian motion, $\displaystyle{ q\in \mathbb{N}_{\gt 0} }$, on the probability space $\displaystyle{ \left(\Omega,\mathcal{F},\mathbb{P}\right) }$ with finite time horizon $\displaystyle{ T\gt 0 }$ and natural filtration. Now, consider the linear matrix-valued stochastic Itô differential equation (with Einstein's summation convention over the index j)

$\displaystyle{ dX_t = B_t X_t dt + A_t^{(j)} X_t dW_t^j,\quad X_0=I_d,\qquad d\in\mathbb{N}_{\gt 0}, }$

where $\displaystyle{ B_{\cdot},A_{\cdot}^{(1)},\dots,A_{\cdot}^{(j)} }$ are progressively measurable $\displaystyle{ d\times d }$-valued bounded stochastic processes and $\displaystyle{ I_d }$ is the identity matrix. Following the same approach as in the deterministic case with alterations due to the stochastic setting[1] the corresponding matrix logarithm will turn out as an Itô-process, whose first two expansion orders are given by $\displaystyle{ Y_t^{(1)}=Y_t^{(1,0)}+Y_t^{(0,1)} }$ and $\displaystyle{ Y_t^{(2)}=Y_t^{(2,0)}+Y_t^{(1,1)}+Y_t^{(0,2)} }$, where with Einstein's summation convention over i and j

\displaystyle{ \begin{align} Y^{(0,0)}_t &= 0,\\ Y^{(1,0)}_t &= \int_0^t A^{(j)}_s \, d W^j_s ,\\ Y^{(0,1)}_t &= \int_0^t B_s \, d s,\\ Y^{(2,0)}_t &= - \frac{1}{2} \int_0^t \big(A^{(j)}_s\big)^2 \, d s + \frac{1}{2} \int_0^t \Big[ A^{(j)}_s , \int_0^s A^{(i)}_r \, d W^i_r \Big] d W^j_s ,\\ Y^{(1,1)}_t &= \frac{1}{2} \int_0^t \Big[ B_s , \int_0^s A^{(j)}_r \, d W_r \Big] \, ds + \frac{1}{2} \int_0^t \Big[ A^{(j)}_s ,\int_0^s B_r \, dr \Big] \, dW^j_s,\\ Y^{(0,2)}_t &= \frac{1}{2} \int_0^t \Big[ B_s , \int_0^s B_r \, dr \Big] \, ds. \end{align} }

### 2.2. Convergence of the Expansion

In the stochastic setting the convergence will now be subject to a stopping time $\displaystyle{ \tau }$ and a first convergence result is given by:[2]

Under the previous assumption on the coefficients there exists a strong solution $\displaystyle{ X=(X_t)_{t\in[0,T]} }$, as well as a strictly positive stopping time $\displaystyle{ \tau\leq T }$ such that:

1. $\displaystyle{ X_t }$ has a real logarithm $\displaystyle{ Y_t }$ up to time $\displaystyle{ \tau }$, i.e.
$\displaystyle{ X_t = e^{Y_t},\qquad 0\leq t\lt \tau; }$
2. the following representation holds $\displaystyle{ \mathbb{P} }$-almost surely:
$\displaystyle{ Y_t = \sum_{n=0}^{\infty} Y^{(n)}_t,\qquad 0\leq t\lt \tau, }$
where $\displaystyle{ Y^{(n)} }$ is the n-th term in the stochastic Magnus expansion as defined below in the subsection Magnus expansion formula;
3. there exists a positive constant C, only dependent on $\displaystyle{ \|A^{(1)}\|_{T},\dots,\|A^{(q)}\|_{T}, \|B\|_{T}, T, d }$, with $\displaystyle{ \|A_{\cdot}\|_T=\|\|A_t\|_{F}\|_{L^{\infty}(\Omega\times [0,T])} }$, such that
$\displaystyle{ \mathbb{P} (\tau \leq t) \leq C t,\qquad t\in[0,T]. }$

### 2.3. Magnus Expansion Formula

The general expansion formula for the stochastic Magnus expansion is given by:

$\displaystyle{ Y_t = \sum_{n=0}^{\infty} Y^{(n)}_t \quad \text{with}\quad Y^{(n)}_t := \sum_{r=0}^{n} Y^{(r,n-r)}_t, }$

where the general term $\displaystyle{ Y^{(r,n-r)} }$ is an Itô-process of the form:

$\displaystyle{ Y^{(r,n-r)}_t = \int_0^t \mu^{r,n-r}_s d s + \int_0^t \sigma^{r,n-r,j}_s d W^j_s, \qquad n\in \mathbb{N}_0, \ r=0,\dots,n, }$

The terms $\displaystyle{ \sigma^{r,n-r,j},\mu^{r,n-r} }$ are defined recursively as

\displaystyle{ \begin{align} \sigma^{r,n-r,j}_s &:= \sum_{i=0}^{n-1}\frac{\beta_i}{i!} S^{r-1,n-r,i}_s\big(A^{(j)}\big),\\ \mu^{r,n-r}_s &:= \sum_{i=0}^{n-1}\frac{\beta_i}{i!} S^{r,n-r-1,i}_s(B) - \frac{1}{2} \sum_{j=1}^q \sum_{i=0}^{{ n-2}}\frac{\beta_i}{i!} \sum_{q_1=2}^{{ r }} \sum_{q_2=0}^{{ n-r}} S^{r-q_1,n-r-q_2,i} \big( Q^{q_1,q_2,j} \big), \end{align} }

with

\displaystyle{ \begin{align} Q^{q_1,q_2,j}_s := \sum_{i_1=2}^{q_1}\sum_{i_2=0}^{q_2} \sum_{h_1=1}^{i_1-1} \sum_{h_2=0}^{i_2} &\sum_{p_1=0}^{q_1-i_1} \sum_{{p_2}=0}^{q_2-i_2}\ \sum_{m_1=0}^{p_1+p_2} \ \sum_{{m_2}=0}^{q_1-i_1-p_1+q_2-i_2-p_2} \\ & \Bigg({ \frac{S_s^{p_1,p_2,m_1}\big(\sigma^{h_1,h_2,j}_s\big)}{({m_1}+1)!} \frac{ S_s^{q_1-i_1-p_1,q_2-i_2-p_2,m_2} \big(\sigma^{i_1-h_1,i_2-h_2,j}_s\big)}{({m_2}+1)!} } \\ & \qquad\qquad + {\frac{ \big[S_s^{p_1,p_2,m_1}\big(\sigma^{i_1-h_1,i_2-h_2,j}_s\big),S_s^{q_1-i_1-p_1,q_2-i_2-p_2,m_2}\big(\sigma^{h_1,h_2,j}_s\big)\big] }{ ({m_1}+{m_2}+2)({m_1}+1)!{m_2}! } } \Bigg), \end{align} }

and with the operators S being defined as

\displaystyle{ \begin{align} S^{r-1,n-r,0}_s(A) &:= \begin{cases} A & \text{if } r=n=1,\\ 0 & \text{otherwise}, \end{cases}\\ S^{r-1,n-r,i}_s(A) &:= \sum_{\begin{array}{c}(j_1,k_1),\dots,(j_i,k_i) \in\mathbb{N}_0^2 \\ j_1 + \cdots + j_i = r-1 \\ k_1+ \cdots +k_{i} = n-r \end{array}} \big[Y^{(j_1,k_1)}_s , \big[ \dots , \big[ Y^{(j_i,k_i)}_s, A_s \big] \dots \big] \big] \\ &= \sum_{\begin{array}{c}(j_1,k_1),\dots,(j_i,k_i) \in\mathbb{N}_0^2 \\ j_1 + \cdots + j_i = r-1 \\ k_1+ \cdots k_{i} = n-r \end{array}} \operatorname{ad}_{Y^{(j_1,k_1)}_s} \circ \cdots \circ \operatorname{ad}_{Y^{(j_i,k_i)}_s}(A_s) , \qquad i\in\mathbb{N}. \end{align} }

## 3. Applications

Since the 1960s, the Magnus expansion has been successfully applied as a perturbative tool in numerous areas of physics and chemistry, from atomic and molecular physics to nuclear magnetic resonance[3] and quantum electrodynamics. It has been also used since 1998 as a tool to construct practical algorithms for the numerical integration of matrix linear differential equations. As they inherit from the Magnus expansion the preservation of qualitative traits of the problem, the corresponding schemes are prototypical examples of geometric numerical integrators.

### References

1. Kamm, Pagliarani & Pascucci 2020
2. Kamm, Pagliarani & Pascucci 2020, Theorem 1.1
3. Haeberlen, U.; Waugh, J.S. (1968). "Coherent Averaging Effects in Magnetic Resonance". Phys. Rev. 175 (2): 453–467. doi:10.1103/PhysRev.175.453. Bibcode: 1968PhRv..175..453H.  https://dx.doi.org/10.1103%2FPhysRev.175.453
More
Information
Subjects:
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
View Times: 452
Entry Collection:
Revision: 1 time (View History)
Update Date: 21 Oct 2022
1000/1000