An Efficient Method for the Coordinate Transformation Problem of Massively Three-Dimensional Networks
Abstract
A new and efficient algorithm is presented for the coordinate transformation problem of massively three-dimensional networks formed e.g. by the atoms of crystal fragments or molecular clusters. The new algorithm is based on a divide-and-conquer technique to perform iterative coordinate transformati- on, applicable even for three-dimensional networks, with linear scaling memory and near linear scaling CPU time requirements. The new algorithm proved to be very fast in the coordinate transformation problems and geometry optimization of diamond fragments, water clusters, globular proteins and solvated proteins.