250 likes | 590 Views
Introduction to Data Collection. What do we need to collect data. hkl index of each datum The integrated intensity of each datum. Note this is NOT the maximum intensity but all the intensity in the spot. The Standard deviation of the intensity
E N D
What do we need to collect data • hkl index of each datum • The integrated intensity of each datum. • Note this is NOT the maximum intensity but all the intensity in the spot. • The Standard deviation of the intensity • To determine this we need a background measurement. • All must be numerical.
Other Considerations • Dynamic Range –from 10 to maybe 1,000,000 • Background—low as possible • Linear Accuracy • Time delay between data collection and evaluation • Exposure time
Choice of X-ray • Sensitivity of detector • Separation of spots Bragg’s Law Sin(q)=nl/2d • Penetration of X-rays—absorption • Background • Copper –good sensitivity –long separation • Molybdenum—low absorption
Film • High dynamic range • Very low noise • Long Exposures--days • Hard to integrate • Long delay from data collection until data is available • To assign hkl need some work
Automatic Data Collection • Can determine the intensity by using some sort of radiation detector • Must find a way to move any given hkl into the position to be detected. Define the diffraction vector d so that it points along the d in the Bragg equation • Need a robot that will orient the crystal and collect the data.
Orientation Matrix • xyz is an arbitrary fixed Cartesian coordinate system. • The length of each column is a reciprocal cell length • The angles between the columns give the reciprocal cell angles. • When A is multiplied into a column matrix of hkl the result is the diffraction vector.
Determination of A • Know cell and axis of rotation—find some spots—requires prealignment • Find spots from a quick rotation photo. Use autoindexing. • Find spots by a random search then autoindex
Autoindexing • Find 15-25 spots • Each spot represents a diffraction vector. • The vector between each spot represents a diffraction vector. • Only diffraction vectors the produce integral hkl for all the spots are possible cell lengths. • Want shortest, most orthogonal axes
Sparks (Syntex) Routine • Print a table of shortest vectors with the cosine (the computer did not have an inverse cos function) of the angle between each vector. • User manually goes through table to find the best cell • Computer used had 4K of memory and no disk drive
Nonius Routine • Sort the vectors by length • Weight by orthogonality • Get best cell • Due “sort of a least squares” to make the hkl’s most integral
Problems • Only finds primitive cells. • One bad point can ruin the whole process. • DIRAX—Albert Duisenberg in the Netherlands defeats this by calculating potential triples and finding which give the most integral indexing.