Limit points of the monotonic schemes
classification
🪐 quant-ph
keywords
algorithmslimitanalysisbilinearcasecontrolcontrolsconvergence
read the original abstract
Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor), Zhu & Rabitz or the general form of Maday & Turinici. This paper presents an analysis of the limit set of controls provided by these algorithms and a proof of convergence in a particular case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.