Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches (Q1695352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distance descending ordering method: an O(n) algorithm for inverting the mass matrix in simulation of macromolecules with long branches |
scientific article; zbMATH DE number 6835455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches |
scientific article; zbMATH DE number 6835455 |
Statements
Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches (English)
0 references
7 February 2018
0 references
molecular dynamics
0 references
internal coordinates
0 references
mass matrix
0 references
\(O(n)\) time complexity
0 references
sparse matrix
0 references
Cholesky decomposition
0 references
0.6654191017150879
0 references
0.6626360416412354
0 references
0.6391488909721375
0 references
