Interactive Quantum Chemistry: A Divide-and-Conquer ASED-MO Method

Mael Bosson, Caroline Richard, Antoine Plet, Sergei Grudinin, Stephane Redon
NANO-D – INRIA Grenoble – Rhone-Alpes/CNRS Laboratoire Jean Kuntzmann, 655, avenue de l’Europe Montbonnot, 38334 Saint Ismier Cedex, France
Journal of Computational Chemistry, Volume 33, Issue 7, pages 779-790, 2012


   title={Interactive quantum chemistry: A divide-and-conquer ASED-MO method},

   author={Bosson, M. and Richard, C. and Plet, A. and Grudinin, S. and Redon, S.},

   journal={Journal of Computational Chemistry},


   publisher={Wiley Online Library}


Download Download (PDF)   View View   Source Source   



We present interactive quantum chemistry simulation at the atom superposition and electron delocalization molecular orbital (ASED-MO) level of theory. Our method is based on the divideand-conquer (D&C) approach, which we show is accurate and efficient for this non-self-consistent semiempirical theory. The method has a linear complexity in the number of atoms, scales well with the number of cores, and has a small prefactor. The time cost is completely controllable, as all steps are performed with direct algorithms, i.e., no iterative schemes are used. We discuss the errors induced by the D&C approach, first empirically on a few examples, and then via a theoretical study of two toy models that can be analytically solved for any number of atoms. Thanks to the precision and speed of the D&C approach, we are able to demonstrate interactive quantum chemistry simulations for systems up to a few hundred atoms on a current multicore desktop computer.When drawing and editing molecular systems, interactive simulations provide immediate, intuitive feedback on chemical structures. As the number of cores on personal computers increases, and larger and larger systems can be dealt with, we believe such interactive simulations-even at lower levels of theory-should thus prove most useful to effectively understand, design and prototype molecules, devices and materials.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: