Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method
arXiv:2002.06973 · doi:10.1016/j.laa.2021.04.011
Abstract
We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally establishes the convergence of the Lanczos-like algorithm and yields a full characterization of algorithmic breakdowns. From there, the solution of the original differential system is available in closed form. This is a key piece in evaluating the elusive ordered exponential function both formally and numerically.
References in corpus (10)
- The Magnus expansion and some of its applications
- Sufficient conditions for the convergence of the Magnus expansion
- 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
- Elementary Integral Series for Heun Functions. With an Application to Black-Hole Perturbation Theory
- Lanczos-like algorithm for the time-ordered exponential: The -inverse problem
- The Chronological Operator Algebra and Formal Solutions of Differential Equations
- The introduction to the operator method for solving differential equations.First-order DE
- Formal exact operator solutions to nonlinear differential equations
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
Cited by in corpus (5)
- Elementary Integral Series for Heun Functions. With an Application to Black-Hole Perturbation Theory
- A Lanczos-like method for non-autonomous linear ordinary differential equations
- A Fréchet Lie group on distributions
- Computations of general Heun functions from their integral series representations
- Exact solutions for the time-evolution of quantum spin systems under arbitrary waveforms using algebraic graph theory