Abstract
Normal mode analysis plays an important role in relating the conformational dynamics of proteins to their biological function. The subspace iteration method is a numerical procedure for normal mode analysis that has enjoyed widespread success in the structural mechanics community due to its numerical stability and computational efficiency in calculating the lowest normal modes of large systems. Here, we apply the subspace iteration method to proteins to demonstrate its advantageous properties in this area of computational protein science. An effective algorithm for choosing the number of iteration vectors in the method is established, offering a considerable improvement over the original implementation. In the present application, computational time scales linearly with the number of normal modes computed. Additionally, the method lends itself naturally to normal mode analyses of multiple neighboring macromolecular conformations, as demonstrated in a conformational change pathway analysis of adenylate kinase. These properties, together with its computational robustness and intrinsic scalability to multiple processors, render the subspace iteration method an effective and reliable computational approach to protein normal mode analysis. © 2009 Wiley Periodicals, Inc. J Comput Chem 2010