Lanczos-like algorithm for the time-ordered exponential: The $\ast$-inverse problem - Archive ouverte HAL Access content directly
Journal Articles Applications of Mathematics Year : 2020

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

Stefano Pozza
  • Function : Author
  • PersonId : 1129401

Abstract

The time-ordered exponential of a time-dependent matrix A(t) is defined as the function of A(t) that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in A(t). The authors recently proposed the first Lanczoslike algorithm capable of evaluating this function. This algorithm relies on inverses of timedependent functions with respect to a non-commutative convolution-like product, denoted *. Yet, the existence of such inverses, crucial to avoid algorithmic breakdowns, still needed to be proved. Here we constructively prove that *-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.
Fichier principal
Vignette du fichier
main.pdf (388.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03597271 , version 1 (04-03-2022)

Identifiers

Cite

P.-L Giscard, Stefano Pozza. Lanczos-like algorithm for the time-ordered exponential: The $\ast$-inverse problem. Applications of Mathematics, 2020, 65 (6), pp.807-827. ⟨10.21136/AM.2020.0342-19⟩. ⟨hal-03597271⟩
43 View
110 Download

Altmetric

Share

Gmail Facebook X LinkedIn More