Analysis of a greedy reconstruction algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Control and Optimization Year : 2021

Analysis of a greedy reconstruction algorithm

Gabriele Ciaramella
Julien Salomon


A novel and detailed convergence analysis is presented for a greedy algorithm that was introduced in [Y. Maday and J. Salomon, Joint Proceedings of the 48th IEEE Conference on Decision and Control and the 28th Chinese Control Conference, 2009, pp. 375--379] for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of linearly independent matrices. The presented convergence analysis focuses on linear-quadratic (optimization) problems governed by linear differential systems and reveals the strong dependence of the performance of the greedy algorithm on the observability properties of the system and on the ansatz of the basis elements. Moreover, the analysis allows us to use a precise (and in some sense optimal) choice of basis elements for the linear case and led to the introduction of a new and more robust optimized greedy reconstruction algorithm. This optimized approach also applies to nonlinear Hamiltonian reconstruction problems, and its efficiency is demonstrated by numerical experiments.
Fichier principal
Vignette du fichier
greedy_reconstruction_HAL2.pdf (390.49 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02983054 , version 1 (30-10-2020)



Simon Buchwald, Gabriele Ciaramella, Julien Salomon. Analysis of a greedy reconstruction algorithm. SIAM Journal on Control and Optimization, 2021, 59 (6), pp.4511-4537. ⟨10.1137/20M1373384⟩. ⟨hal-02983054⟩
79 View
128 Download



Gmail Mastodon Facebook X LinkedIn More