A fast recursive algorithm for molecular dynamics simulation
The authors develop a recursive algorithm for solving the dynamical equations of motion for molecular systems. They make use of internal variable models which have been shown to reduce the computation times of molecular dynamics simulations by an order of magnitude when compared with Cartesian models. The \(O({\mathcal N})\) algorithm described in this paper for solving the equations of motion provides additional significant improvements in computational speed. The authors make extensive use of the spatial operator methods which have been developed recently for the analysis and simulation of the dynamics of multibody systems. The spatial operators are used to derive the equations of motion and obtain an operator expression for the system mass matrix. An alternative square factorization of the mass matrix leads to a closed form expression for its inverse. From this follows the recursive algorithm for computing the generalized accelerations. The computational cost of this algorithm grows only linearly with the number of degrees of freedom. This is in contrast to conventional constrained dynamics algorithms whose cost is a cubic function of the number of degrees of freedom. For the case of a polypeptide molecule with 400 residues, the \(O({\mathcal N})\) algorithm provides computational speedup by a factor of 450 over the conventional \(O({\mathcal N}^ 3)\) algorithm. The authors describe a simplified method for computing and handling the potential function gradients within the dynamics computations.
- An efficient algorithm for equations of motion of molecular dynamical systems
- scientific article; zbMATH DE number 1262862
- Trotter derived algorithms for molecular dynamics with constraints: velocity Verlet revisited
- Ordinary differential equations of molecular dynamics
- A unified formulation for massively parallel rigid multibody dynamics of \(O(\log_{2} n)\) computational complexity
- An improved algorithm for molecular dynamics simulation of rigid molecules
- Algorithmic challenges in computational molecular biophysics
- Compensating mass matrix potential for constrained molecular dynamics
- Recursive inverse matrix algorithm in granular mechanics applications
- A fast mollified impulse method for biomolecular atomistic simulations
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
- Optimization problem and efficient partitioning algorithm for transitions to finer-scale models in adaptive resolution simulation of articulated biopolymers
- Extension of the divide-and-conquer algorithm for the efficient inverse dynamics analysis of multibody systems
- An optimized algorithm for molecular dynamics simulation of large-scale systems
- An efficient algorithm for equations of motion of molecular dynamical systems
- An improved hybrid global optimization method for protein tertiary structure prediction
- Efficient coarse-grained molecular simulations in the multibody dynamics scheme
- An improved fast multipole method for electrostatic potential calculations in a class of coarse-grained molecular simulations
- scientific article; zbMATH DE number 1262862 (Why is no real title available?)
- Increasing the Time Step and Efficiency of Molecular Dynamics Simulations: Optimal Solutions for Equilibrium Simulations or Structure Refinement of Large Biomolecules
- Canonical ensemble simulation of biopolymers using a coarse-grained articulated generalized divide-and-conquer scheme
- scientific article; zbMATH DE number 5262919 (Why is no real title available?)
- Internal coordinate molecular dynamics based on the spectroscopic B-matrix
- Sampling of conformation space in torsion angle dynamics calculations
- A multilevel-skin neighbor list algorithm for molecular dynamics simulation
- Minimal formulation of joint motion for biomechanisms
This page was built for publication: A fast recursive algorithm for molecular dynamics simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802287)