Analysis of a greedy reconstruction algorithm

DOI10.1137/20M1373384MaRDI QIDQ5013566zbMATH OpenOpenAlexFDO

Authors Sebastian Buchwald, Julien Salomon, G. Ciaramella

Publication date 1 December 2021

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.16130

zbMATH Keywords

greedy reconstruction algorithmHamiltonian identificationinverse problemsoperator reconstructionquantum control problems

Mathematics Subject Classification ID

Linear-quadratic optimal control problems (49N10) Inverse problems in optimal control (49N45) Numerical optimization and variational techniques (65K10) Quantum control (81Q93) System identification (93B30)

Abstract: A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced 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.

Recommendations

• Greedy algorithms for reduced bases in Banach spaces
• Convergence of a greedy algorithm for high-dimensional convex nonlinear problems
• \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
• Projection greedy algorithm
• Sequential greedy approximation for certain convex optimization problems

Cites work

• A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
• An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
• An inverse problem for Schrödinger equations with discontinuous main coefficient
• Control and nonlinearity.
• Convergence of the time-discretized monotonic schemes
• Explicit Method for Parameter Identification
• Formulation and numerical solution of quantum control problems.
• Hamiltonian identification for quantum systems: well-posedness and numerical approaches
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1182386 (Why is no real title available?)
• Local controllability of 1D linear and nonlinear Schrödinger equations with bilinear control
• Monotonic time-discretized schemes in quantum control
• Observer-based Hamiltonian identification for quantum systems
• Quantum Hamiltonian and dipole moment identification in presence of large control perturbations

Cited in

(3)

• scientific article; zbMATH DE number 4215793 (Why is no real title available?)
• Gauss-Newton oriented greedy algorithms for the reconstruction of operators in nonlinear dynamics
• Reconstruction of unknown monotone nonlinear operators in semilinear elliptic models using optimal inputs

This page was built for publication: Analysis of a greedy reconstruction algorithm

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