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

preprint2014arXivOpen access

Abstract

We present the path-sum formulation for OE[H](t′,t)=T exp(∫tt′ ⁣H(τ) dτ)\mathsf{OE}[\mathsf{H}](t',t)=\mathcal{T}\,\text{exp}\big(\int_{t}^{t'}\!\mathsf{H}(τ)\,dτ\big), the time-ordered exponential of a time-dependent matrix H(t)\mathsf{H}(t). The path-sum formulation gives OE[H]\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.