Hostname: page-component-cb9f654ff-pvkqz Total loading time: 0 Render date: 2025-09-05T08:57:13.111Z Has data issue: false hasContentIssue false
  • English
  • Français

Application of convex optimization to identification of atomic species from diffraction patterns

Published online by Cambridge University Press:  27 February 2017

Ryoko Oishi-Tomiyasu
Ryoko Oishi-Tomiyasu*
Affiliation:
Faculty of Science, Yamagata University, 1-4-12, Kojirakawa-cho, Yamagata-shi, Yamagata 990-8560, Japan JST PRESTO, 4-1-8, Honcho, Kawaguchi-shi, Saitama 332-0012, Japan
*
a) Author to whom correspondence should be addressed. Electronic mail: ryoko_oishi@sci.kj.yamagata-u.ac.jp
Get access Rights & Permissions [Opens in a new window]

Abstract

Computational methods and a program to obtain crystal structures that have the perfectly identical diffraction patterns, i.e. structure factors with the same absolute values and the same lattice symmetry are discussed. This is directly related to the uniqueness of solutions in crystal structure determination of single-crystal/powder-crystal samples from diffraction data. In order to solve the problem, it is necessary to solve a system of quadratic equations. The framework of positive-semidefinite programming is used herein to solve the system efficiently.

Keywords

phase retrievalglobal optimizationpositive-semidefinite programmingsystem of quadratic equationsmultiple solutions

Information

Type
Technical Articles
Information
Powder Diffraction , Volume 32 , Supplement S1 , September 2017 , pp. S179 - S185
Check for updates
Copyright
Copyright © International Centre for Diffraction Data 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Engel, P. (1988). “Mathematical problems in modern crystallography,” Comput. Math. Applic. 16, 425–436.Google Scholar
Mighell, A. D. and Santoro, A. (1975). “Geometrical ambiguities in the indexing of powder patterns,” J. Appl. Crystallogr. 8, 372–374.Google Scholar
Oishi-Tomiyasu, R. (2014). “Method to generate all the geometrical ambiguities of powder indexing solutions,” J. Appl. Crystallogr. 47, 2055–2059.Google Scholar
Oishi-Tomiyasu, R. (2016). “A table of geometrical ambiguities in powder indexing obtained by exhaustive search,” Acta Crystallogr. A: Found. Crystallogr. 72, 73–80.Google Scholar
Yamashita, M., Fujisawa, K., Nakata, K., Nakata, M., Fukuda, M., Kobayashi, K., and Goto, K. (2010). A High-performance Software Package for Semidefinite Programs: SDPA 7 (Research Report B-460). Dept. of Math. and Comp. Science, Tokyo Institute of Technology.Google Scholar