Acta Cryst. (2012). A68, 525-535 [ doi:10.1107/S0108767312024579 ]
Abstract: A new Bravais-lattice determination algorithm is introduced herein. For error-stable Bravais-lattice determination, Andrews & Bernstein [Acta Cryst. (1988), A44, 1009-1018] proposed the use of operations to search for nearly Buerger-reduced cells. Although these operations play an essential role in their method, they increase the computation time, in particular when lattice parameters obtained in (powder) auto-indexing are supposed to contain large errors. The new algorithm requires only several permutation matrices in addition to the operations that are necessary when the lattice parameters have exact values. As a result, the computational efficiency of error-stable Bravais-lattice determination is improved considerably. Furthermore, the new method is proved to be error stable under a very general assumption. The detailed algorithms and the set of matrices sufficient for error-stable determination are presented.
Keywords: Bravais lattice; reduction theory; auto-indexing.
Portable Document Format (PDF) file
To open or display or play some files, you may need to set your browser up to use the appropriate software. See the full list of file types for an explanation of the different file types and their related mime types and, where available links to sites from where the appropriate software may be obtained.
The download button will force most browsers to prompt for a file name to store the data on your hard disk.
Where possible, images are represented by thumbnails.
Copyright © International Union of Crystallography