Home A Monte Carlo method for indexing
Article
Licensed
Unlicensed Requires Authentication

A Monte Carlo method for indexing

Published/Copyright: July 28, 2010

Abstract

A Monte Carlo approach to indexing is described in which direct space is randomly sampled in order to obtain the direct space lattice vectors appropriate for indexing a set of reflections in an unbiased fashion. A conjugate gradient approach is used to optimize these vectors once a point in that locality is sampled. Probabilities are assigned to the reflections based on their deviations from integer for each of the three basis vectors and the combined probability provides a basis for downweighting effects due to satellite crystals.

Published Online: 2010-7-28
Published in Print: 1997-10-1

© 2015 Oldenbourg Wissenschaftsverlag GmbH, Rosenheimer Str. 145, 81671 München

Downloaded on 12.9.2025 from https://www.degruyterbrill.com/document/doi/10.1524/zkri.1997.212.10.689/html
Scroll to top button