The numerical study of control problems in quantum chemistry requires many computer simulations of the dynamic phenomena involved. These simulations are, in many cases, too expensive to be carried out for complex systems, thus precluding the treatment of interesting practical situations. In a context of fast increasing in both the CPU power available on typical workstations and the number of computers that can be connected through high-speed networks, the difficulty lies rather in how to obtain “real-time solutions” than in the amount of CPU power available (which begins to exceed the needs). In this context, the “parareal” time algorithm that parallelizes in the time direction the work required to solve the evolution equations has been introduced in previous works (Lions, J.-L.; Maday, Y.; Turinici, G. CR Acad Sci Paris I Math 2001, 332(7), 661–668; Bal, G.; Maday, Y. In: Proceedings of the Workshop on Domain Decomposition, LNCSE Series; Springer-Verlag: Berlin, 2001, 189–202). The theoretical modifications required to apply this algorithm to control problems and more specifically to the problems of quantum control are the main topic of this article. The preliminary results that are presented at the end of the article illustrate the feasibility of the approach and the potential for large time savings. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem 93: 223–228, 2003
If you can't find a tool you're looking for, please click the link at the top of the page to "Go to old article view". Alternatively, view our Knowledge Base articles for additional help. Your feedback is important to us, so please let us know if you have comments or ideas for improvement.