aboutsummaryrefslogtreecommitdiff
path: root/doc/man/ambigator.1
diff options
context:
space:
mode:
authorThomas White <taw@physics.org>2015-02-16 10:55:45 +0100
committerThomas White <taw@physics.org>2015-02-16 15:15:31 +0100
commit463c7cc933e9928fa825507f1a122a5a8dc013f4 (patch)
tree8cdad73aaa91bf78f4240c6821cbef1fe179a28b /doc/man/ambigator.1
parent9f626fe9cbb5e4fbaca05c41bbaf9754bf611ee7 (diff)
Update manual pages
Diffstat (limited to 'doc/man/ambigator.1')
-rw-r--r--doc/man/ambigator.12
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/man/ambigator.1 b/doc/man/ambigator.1
index d403f2aa..fad89641 100644
--- a/doc/man/ambigator.1
+++ b/doc/man/ambigator.1
@@ -25,7 +25,7 @@ The algorithm proceeds by calculating the individual correlation coefficients be
Only one indexing ambiguity can be resolved at a time. In other words, each crystal is considered to be indexable in one of only two ways. If the true indexing ambiguity has more possibilities than this, the resolution must be performed by running \fBambigator\fR multiple times with a different ambiguity operator each time.
-If the ambiguity operator is known (or, equivalently, the actual and apparent symmetries are both known), then the algorithm can be enhanced by including in \fIf\fR the correlation coefficients of all the crystals with the opposite indexing assignment to the current one, but after reindexing the other crystal first. Likewise, \fg\fR includes the correlation coefficients of the crystals with the same indexing assignment after reindexing. This enhances the algorithm to an extent roughly equivalent to doubling the number of crystals.
+If the ambiguity operator is known (or, equivalently, the actual and apparent symmetries are both known), then the algorithm can be enhanced by including in \fIf\fR the correlation coefficients of all the crystals with the opposite indexing assignment to the current one, but after reindexing the other crystal first. Likewise, \fIg\fR includes the correlation coefficients of the crystals with the same indexing assignment after reindexing. This enhances the algorithm to an extent roughly equivalent to doubling the number of crystals.
The default behaviour is to compare each crystal to every other crystal. This leads to a computational complexity proportional to the square of the number of crystals. If the number of crystals is large, the number of comparisons can be limited without compromising the algorithm much. In this case, the crystals to correlate against will be selected randomly.