Distance descending ordering method: An O (n) algorithm forinverting the mass matrix in simulation of macromolecules with long

作者：Xu Xiankun; Li Peiwen^*

来源：Journal of Computational Physics, 2017, 349: 253-264.

DOI：10.1016/j.jcp.2017.08.006

• Molecular dynamics
• Internal coordinates
• Mass matrix
• O (n) time complexity
• Sparse matrix
• Cholesky decomposition

Fixman's work in 1974 and the follow-up studies have developed a method that can factorize the inverse of mass matrix into an arithmetic combination of three sparse matrices-one of them is positive definite and needs to be further factorized by using the Cholesky decomposition or similar methods. When the molecule subjected to study is of serial chain structure, this method can achieve O (n) time complexity. However, for molecules with long branches, Cholesky decomposition about the corresponding positive definite matrix will introduce massive fill-in due to its nonzero structure. Although there are several methods can be used to reduce the number of fill-in, none of them could strictly guarantee for zero fill-in for all molecules according to our test, and thus cannot obtain O (n) time complexity by using these traditional methods. In this paper we present a new method that can guarantee for no fill-in in doing the Cholesky decomposition, which was developed based on the correlations between the mass matrix and the geometrical structure of molecules. As a result, the inverting of mass matrix will remain the O (n) time complexity, no matter the molecule structure has long branches or not.

• 出版日期2017-11-15