Lanczos-like algorithm for the time-ordered exponential: The \ast-inverse problem

DOI10.21136/AM.2020.0342-19MaRDI QIDQ6327005arXivWikidataFDO

Authors P.-L. Giscard, Stefano Pozza

Publication date 10 October 2019

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Algorithms for approximation of functions (65D15) Jacobi (tridiagonal) operators (matrices) and generalizations (47B36) Numerical computation of matrix exponential and similar matrix functions (65F60)

Abstract: The time-ordered exponential of a time-dependent matrix $mathsfA(t)$ is defined as the function of $mathsfA(t)$ that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in $mathsfA(t)$. The authors recently proposed the first Lanczos-like algorithm capable of evaluating this function. This algorithm relies on inverses of time-dependent functions with respect to a non-commutative convolution-like product, denoted $ast$. Yet, the existence of such inverses, crucial to avoid algorithmic breakdowns, still needed to be proved. Here we constructively prove that $ast$-inverses exist for all non-identically null, smooth, separable functions of two variables. As a corollary, we partially solve the Green's function inverse problem which, given a distribution $G$, asks for the differential operator whose fundamental solution is $G$. Our results are abundantly illustrated by examples.

This page was built for publication: Lanczos-like algorithm for the time-ordered exponential: The $\ast$-inverse problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6327005)