Volume 41, Number 1, January-February 2007
|Page(s)||77 - 93|
|Published online||26 April 2007|
Convergence of the time-discretized monotonic schemes
Université Pierre et Marie Curie, Paris 6,
Laboratoire Jacques-Louis Lions, 175 rue du Chevaleret
75013 Paris, France.
2 Université Paris-Dauphine, Paris 9, CEREMADE, Place du Maréchal Lattre de Tassigny, 75775 Paris Cedex 16, France. Julien.Salomon@dauphine.fr
Revised: 3 November 2006
Many numerical simulations in (bilinear) quantum control use the monotonically convergent Krotov algorithms (introduced by Tannor et al. [Time Dependent Quantum Molecular Dynamics (1992) 347–360]), Zhu and Rabitz [J. Chem. Phys. (1998) 385–391] or their unified form described in Maday and Turinici [J. Chem. Phys. (2003) 8191–8196]. In Maday et al. [Num. Math. (2006) 323–338], a time discretization which preserves the property of monotonicity has been presented. This paper introduces a proof of the convergence of these schemes and some results regarding their rate of convergence.
Mathematics Subject Classification: 49J20 / 68W40
Key words: Quantum control / monotonic schemes / optimal control / Ł ojasiewicz inequality.
© EDP Sciences, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.