A Lanczos-like method for non-autonomous linear ordinary differential equations

Abstract

The time-ordered exponential is defined as the function that solves a system of coupled first-order linear differential equations with generally non-constant coefficients. In spite of being at the heart of much system dynamics, control theory, and model reduction problems, the time-ordered exponential function remains elusively difficult to evaluate. The *-Lanczos algorithm is a (symbolic) algorithm capable of evaluating it by producing a tridiagonalization of the original differential system. In this paper, we explain how the *-Lanczos algorithm is built from a generalization of Krylov subspaces, and we prove crucial properties, such as the matching moment property. A strategy for its numerical implementation is also outlined and will be subject of future investigation.

References in corpus (10)

• The Magnus expansion and some of its applications
• Heun Functions and Some of Their Applications in Physics
• Quantum Complexity of Time Evolution with Chaotic Hamiltonians
• Sufficient conditions for the convergence of the Magnus expansion
• Convergence of the Magnus series
• An Exact Formulation of the Time-Ordered Exponential using Path-Sums
• Exact dynamics of quantum systems driven by time-varying Hamiltonians: solution for the Bloch-Siegert Hamiltonian and applications to NMR
• Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method
• Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs
• Lanczos-like algorithm for the time-ordered exponential: The $\ast$-inverse problem

Cited by in corpus (1)

• A Fréchet Lie group on distributions