Difference between revisions of "Dual-space phase retrieval algorithms"
From Online Dictionary of Crystallography
BrianMcMahon (talk | contribs) m |
|||
| Line 1: | Line 1: | ||
== Definition == | == Definition == | ||
| − | A class of algorithms to solve the phase problem in diffraction, which is in crystallography commonly known as the crystallographic phase problem. The phases of the structure factors are retrieved by iterative modifications of the current model in direct space ( | + | A class of algorithms to solve the phase problem in diffraction, which is in crystallography commonly known as the crystallographic phase problem. The phases of the structure factors are retrieved by iterative modifications of the current model in direct space (electron density) and reciprocal space (structure factors). The distinction between dual-space algorithms and other phase retrieval methods (direct methods, Patterson method, [[VLD]] algorithm) is not clear-cut. However, in dual-space algorithms in the strict sense neither of the two spaces plays a dominant role in the phasing process, and it is the alternation between the two spaces that is crucial. The dual space algorithms most relevant to crystallography are: |
* [[charge flipping|charge flipping algorithm]] | * [[charge flipping|charge flipping algorithm]] | ||
Revision as of 11:50, 19 May 2014
Definition
A class of algorithms to solve the phase problem in diffraction, which is in crystallography commonly known as the crystallographic phase problem. The phases of the structure factors are retrieved by iterative modifications of the current model in direct space (electron density) and reciprocal space (structure factors). The distinction between dual-space algorithms and other phase retrieval methods (direct methods, Patterson method, VLD algorithm) is not clear-cut. However, in dual-space algorithms in the strict sense neither of the two spaces plays a dominant role in the phasing process, and it is the alternation between the two spaces that is crucial. The dual space algorithms most relevant to crystallography are:
- Elser's difference map
- Gerchberg-Saxton algorithm, in crystallography known as low-density elimination