### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 253-264 |

Number of pages | 12 |

Journal | Journal of Computational Physics |

Volume | 349 |

DOIs | |

State | Published - Nov 15 2017 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Physics and Astronomy (miscellaneous)
- Computer Science Applications

### Cite this

**Distance descending ordering method : An O(n) algorithm for inverting the mass matrix in simulation of macromolecules with long branches.** / Xu, Xiankun; Li, Peiwen.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Distance descending ordering method

T2 - An O(n) algorithm for inverting the mass matrix in simulation of macromolecules with long branches

AU - Xu, Xiankun

AU - Li, Peiwen

PY - 2017/11/15

Y1 - 2017/11/15

N2 - 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.

AB - 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.

KW - Cholesky decomposition

KW - Internal coordinates

KW - Mass matrix

KW - Molecular dynamics

KW - O(n) time complexity

KW - Sparse matrix

UR - http://www.scopus.com/inward/record.url?scp=85028326253&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028326253&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2017.08.006

DO - 10.1016/j.jcp.2017.08.006

M3 - Article

AN - SCOPUS:85028326253

VL - 349

SP - 253

EP - 264

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

ER -