Dual-space phase retrieval algorithms - Revision history

MassimoNespolo: + cat

2014-12-04T05:58:16Z

+ cat

BrianMcMahon at 11:50, 19 May 2014

2014-05-19T11:50:55Z

GervaisChapuis at 12:31, 20 September 2013

2013-09-20T12:31:02Z

GervaisChapuis at 13:14, 2 September 2013

2013-09-02T13:14:51Z

GervaisChapuis at 14:15, 27 August 2013

2013-08-27T14:15:04Z

GervaisChapuis at 14:14, 27 August 2013

2013-08-27T14:14:19Z

GervaisChapuis at 12:02, 27 August 2013

2013-08-27T12:02:14Z

GervaisChapuis: Created page with "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 fac..."

2013-08-27T11:34:38Z

Created page with "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 fac..."

New page

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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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 algorithm

∙Fienup's hybrid input-output algorithm

∙Elser's difference map

∙Gerchberg-Saxton algorithm, in crystallography known as low-density elimination

← Older revision		Revision as of 05:58, 4 December 2014
Line 10:		Line 10:

	* Gerchberg-Saxton algorithm, in crystallography known as low-density elimination		* Gerchberg-Saxton algorithm, in crystallography known as low-density elimination
		+
		+	[[Category: Structure determination]]

@@ Line 1: / Line 1: @@
 == 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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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:
+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]]

@@ Line 1: / Line 1: @@
 == 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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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:
+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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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]]

@@ Line 3: / Line 3: @@
 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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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 algorithm
+* [[charge flipping|charge flipping algorithm]]
 * [[hybrid input-output algorithm|Fienup's hybrid input-output algorithm]]

@@ Line 3: / Line 3: @@
 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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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 algorithm
+* charge flipping algorithm
-∙[[hybrid input-output algorithm|Fienup's hybrid input-output algorithm]]
+* [[hybrid input-output algorithm|Fienup's hybrid input-output algorithm]]
-∙Elser's difference map
+* Elser's difference map
-∙Gerchberg-Saxton algorithm, in crystallography known as low-density elimination
+* Gerchberg-Saxton algorithm, in crystallography known as low-density elimination

← Older revision		Revision as of 14:14, 27 August 2013
Line 1:		Line 1:
		+	== 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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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:		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 (elecron density) and reciprocal space (structure factors). The disctinction 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 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: