Abstract

In this report, we describe some general features of Lagrangian particle tracking and the method of table look-up that are important for calculating many different types of interactions of arbitrary complexity in large molecular dynamics simulations. Based on our experience using these approaches and state-of-the-art of computer technology, we state formally those properties of Lagrangian tracking and table look-up that are important to the design of optimal programming structures. We examine the relationship between Lagrangian indexing and list indexing of data and how this influences the complexity of programming structures for effecting vector operations. Included in this report are criteria for the efficient use of Lagrangian particle tracking schemes in molecular dynamics simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.