Unit cell determination and refinement
423
where i and
j
are positive integers, cannot be represented as a sum of squares
of any three integers and therefore, are forbidden in Eq. 5.13.
Assume that we have a set of experimental data where the observed
Bragg angles have been converted into an array of Q-values. Then, if the
crystal lattice is cubic, the following system of simultaneous equations can
be written to associate each Bragg peak with a certain combination of hkl
triplets:
As follows from the second form of Eq. 5.15, the observed array of
Q-
values should have a common divisor, which results in the array of integers
or nearly integers, considering the finite accuracy of the measured Bragg
angles. This common divisor is nothing else than the inverse of the square of
the edge of the cubic unit cell in the direct space since a*
=
lla.
The algorithm of indexing to test for cubic symmetry is shown in the
form of a flowchart in Figure
5.8.
After the array of Bragg angles have been
converted to Q-values, the next step is to normalize it and find the integers
A', A2,
.
.
.,
AN. The simplest way to do so is to divide all Q-values by the
smallest number present in the array, i.e. Qjlklll
=
Q'. If the resulting array of
A', A',
. .
.,
AN
contains whole numbers (to within a few hundredth's), the
lattice parameter is calculated and the corresponding values of the hikili
triplets are determined based on the values of
A'
after verification that no
forbidden integers (e.g.
7,
15, etc., see Eq. 5.14) are present in the array A.
When the first normalization step results in clearly non-integer values in
the array A, indexing still may be completed when the obtained A', A',
.
.
.,
AN are multiplied by 2, 3, 4, etc. If the crystal system is truly cubic, a simple
visual analysis of the array
A
after the first normalization usually enables one
to determine the needed integer multiplier easily. For example, when
decimal fractions of all A-values are close to 0 and 0.5, multiplying every
number in the array
A
by 2 will result in all integers. Similarly, when the
fractions are -0, -0.33 and -0.66, the multiplier is 3, and so on. When the
algorithm shown in Figure
5.8
is realized as a computer program then visual
analysis of data in
A
is usually impractical and the value of n is determined
automatically, based on somewhat arbitrary tolerances that establish which
value is taken as a whole number and which is not.