Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Lattice reduction using a Euclidean algorithm

Lattice reduction using a Euclidean algorithm The need to reduce a periodic structure given in terms of a large supercell and associated lattice generators arises frequently in different fields of application of crystallography, in particular in the ab initio theoretical modelling of materials at the atomic scale. This paper considers the reduction of crystals and addresses the reduction associated with the existence of a commensurate translation that leaves the crystal invariant, providing a practical scheme for it. The reduction procedure hinges on a convenient integer factorization of the full period of the cycle (or grid) generated by the repeated applications of the invariant translation, and its iterative reduction into sub‐cycles, each of which corresponds to a factor in the decomposition of the period. This is done in successive steps, each time solving a Diophantine linear equation by means of a Euclidean reduction algorithm in order to provide the generators of the reduced lattice. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Crystallographica Section A Foundations of Crystallography Wiley

Lattice reduction using a Euclidean algorithm

Loading next page...
 
/lp/wiley/lattice-reduction-using-a-euclidean-algorithm-ltp5rDtR26

References (19)

Publisher
Wiley
Copyright
Copyright © 2017 Wiley Subscription Services, Inc., A Wiley Company
ISSN
0108-7673
eISSN
1600-5724
DOI
10.1107/S2053273316015539
pmid
28042805
Publisher site
See Article on Publisher Site

Abstract

The need to reduce a periodic structure given in terms of a large supercell and associated lattice generators arises frequently in different fields of application of crystallography, in particular in the ab initio theoretical modelling of materials at the atomic scale. This paper considers the reduction of crystals and addresses the reduction associated with the existence of a commensurate translation that leaves the crystal invariant, providing a practical scheme for it. The reduction procedure hinges on a convenient integer factorization of the full period of the cycle (or grid) generated by the repeated applications of the invariant translation, and its iterative reduction into sub‐cycles, each of which corresponds to a factor in the decomposition of the period. This is done in successive steps, each time solving a Diophantine linear equation by means of a Euclidean reduction algorithm in order to provide the generators of the reduced lattice.

Journal

Acta Crystallographica Section A Foundations of CrystallographyWiley

Published: Jan 1, 2017

Keywords: ; ; ; ;

There are no references for this article.