{"title":"包含大观测误差的栅格参数的快速Bravais-lattice确定算法。","authors":"R Oishi-Tomiyasu","doi":"10.1107/S0108767312024579","DOIUrl":null,"url":null,"abstract":"<p><p>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.</p>","PeriodicalId":7400,"journal":{"name":"Acta Crystallographica Section A","volume":"68 Pt 5","pages":"525-35"},"PeriodicalIF":1.8000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1107/S0108767312024579","citationCount":"22","resultStr":"{\"title\":\"Rapid Bravais-lattice determination algorithm for lattice parameters containing large observation errors.\",\"authors\":\"R Oishi-Tomiyasu\",\"doi\":\"10.1107/S0108767312024579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>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.</p>\",\"PeriodicalId\":7400,\"journal\":{\"name\":\"Acta Crystallographica Section A\",\"volume\":\"68 Pt 5\",\"pages\":\"525-35\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1107/S0108767312024579\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Crystallographica Section A\",\"FirstCategoryId\":\"88\",\"ListUrlMain\":\"https://doi.org/10.1107/S0108767312024579\",\"RegionNum\":4,\"RegionCategory\":\"材料科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2012/7/20 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Crystallographica Section A","FirstCategoryId":"88","ListUrlMain":"https://doi.org/10.1107/S0108767312024579","RegionNum":4,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2012/7/20 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
Rapid Bravais-lattice determination algorithm for lattice parameters containing large observation errors.
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.
期刊介绍：
Acta Crystallographica Section A: Foundations and Advances publishes articles reporting advances in the theory and practice of all areas of crystallography in the broadest sense. As well as traditional crystallography, this includes nanocrystals, metacrystals, amorphous materials, quasicrystals, synchrotron and XFEL studies, coherent scattering, diffraction imaging, time-resolved studies and the structure of strain and defects in materials.
The journal has two parts, a rapid-publication Advances section and the traditional Foundations section. Articles for the Advances section are of particularly high value and impact. They receive expedited treatment and may be highlighted by an accompanying scientific commentary article and a press release. Further details are given in the November 2013 Editorial.
The central themes of the journal are, on the one hand, experimental and theoretical studies of the properties and arrangements of atoms, ions and molecules in condensed matter, periodic, quasiperiodic or amorphous, ideal or real, and, on the other, the theoretical and experimental aspects of the various methods to determine these properties and arrangements.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
