%0 Journal Article %1 JCC:JCC23493 %A Beruski, Otávio %A Vidal, Luciano N. %D 2014 %J Journal of Computational Chemistry %K chemistry quantum symmetry unread %N 4 %P 290--299 %R 10.1002/jcc.23493 %T Algorithms for computer detection of symmetry elements in molecular systems %U http://dx.doi.org/10.1002/jcc.23493 %V 35 %X Simple procedures for the location of proper and improper rotations and reflexion planes are presented. The search is performed with a molecule divided into subsets of symmetrically equivalent atoms (SEA) which are analyzed separately as if they were a single molecule. This approach is advantageous in many aspects. For instance, in those molecules that are symmetric rotors, the number of atoms and the inertia tensor of the SEA provide one straight way to find proper rotations of any order. The algorithms are invariant to the molecular orientation and their computational cost is low, because the main information required to find symmetry elements is interatomic distances and the principal moments of the SEA. For example, our Fortran implementation, running on a single processor, took only a few seconds to locate all 120 symmetry operations of the large and highly symmetrical fullerene C720, belonging to the Ih point group. Finally, we show how the interatomic distances matrix of a slightly unsymmetrical molecule is used to symmetrize its geometry. © 2013 Wiley Periodicals, Inc.

@article{JCC:JCC23493, abstract = {Simple procedures for the location of proper and improper rotations and reflexion planes are presented. The search is performed with a molecule divided into subsets of symmetrically equivalent atoms (SEA) which are analyzed separately as if they were a single molecule. This approach is advantageous in many aspects. For instance, in those molecules that are symmetric rotors, the number of atoms and the inertia tensor of the SEA provide one straight way to find proper rotations of any order. The algorithms are invariant to the molecular orientation and their computational cost is low, because the main information required to find symmetry elements is interatomic distances and the principal moments of the SEA. For example, our Fortran implementation, running on a single processor, took only a few seconds to locate all 120 symmetry operations of the large and highly symmetrical fullerene C720, belonging to the Ih point group. Finally, we show how the interatomic distances matrix of a slightly unsymmetrical molecule is used to symmetrize its geometry. © 2013 Wiley Periodicals, Inc.}, added-at = {2014-01-17T03:48:20.000+0100}, author = {Beruski, Otávio and Vidal, Luciano N.}, biburl = {https://www.bibsonomy.org/bibtex/2f9e3ac2fcaa97cbf86a1f15bebdf5668/drmatusek}, doi = {10.1002/jcc.23493}, interhash = {78fa90e3847f9f5a172751827e8fa157}, intrahash = {f9e3ac2fcaa97cbf86a1f15bebdf5668}, issn = {1096-987X}, journal = {Journal of Computational Chemistry}, keywords = {chemistry quantum symmetry unread}, month = feb, number = 4, pages = {290--299}, timestamp = {2014-01-17T03:48:20.000+0100}, title = {Algorithms for computer detection of symmetry elements in molecular systems}, url = {http://dx.doi.org/10.1002/jcc.23493}, volume = 35, year = 2014 }