A new constrained Langevin method: application to protein crystallographic refinement

We present an algorithm to perform Langevin simulations with constraints. The algorithm iteratively solves a set of linear equations to find the Lagrange multipliers that satisfy the constraints. We apply the algorithm to a polypeptide, and demonstrate that it is stable within a range of timesteps. The algorithm is then used to perform X-ray crystallographic refinement of proteins.