pith. sign in

arxiv: 1410.6637 · v1 · pith:UDRQXWNEnew · submitted 2014-10-24 · 🧮 math-ph · math.CA· math.MP

An Exact Formulation of the Time-Ordered Exponential using Path-Sums

classification 🧮 math-ph math.CAmath.MP
keywords mathsfexponentialtime-orderedformulationpath-sumwalksgiveinverse
0
0 comments X
read the original abstract

We present the path-sum formulation for $\mathsf{OE}[\mathsf{H}](t',t)=\mathcal{T}\,\text{exp}\big(\int_{t}^{t'}\!\mathsf{H}(\tau)\,d\tau\big)$, the time-ordered exponential of a time-dependent matrix $\mathsf{H}(t)$. The path-sum formulation gives $\mathsf{OE}[\mathsf{H}]$ as a branched continued fraction of finite depth and breadth. The terms of the path-sum have an elementary interpretation as self-avoiding walks and self-avoiding polygons on a graph. Our result is based on a representation of the time-ordered exponential as the inverse of an operator, the mapping of this inverse to sums of walks on graphs and the algebraic structure of sets of walks. We give examples demonstrating our approach. We establish a super-exponential decay bound for the magnitude of the entries of the time-ordered exponential of sparse matrices. We give explicit results for matrices with commonly encountered sparse structures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.