Adhesive wear with a coarse-grained discrete element model
نویسندگان
چکیده
The use of molecular dynamics (MD) simulations has led to promising results unravel the atomistic origins adhesive wear, and in particular for onset wear at nanoscale surface asperities. However, MD come with a high computational cost offer access only narrow window time length scales. We propose here resort discrete element method (DEM) mitigate cost. Using DEM particles contact cohesive forces, we reproduce key mechanisms observed MD, while having particle diameters system sizes an order magnitude higher than MD. pairwise forces are tuned obtain solid reasonably approximated elastic fracture properties. single asperity performed successfully reproduced using range sizes, validating coarse-graining procedure. More complex should allow study evolution worn surfaces context, reaching scales inaccessible
منابع مشابه
Discrete breathers in a realistic coarse-grained model of proteins.
We report the results of molecular dynamics simulations of an off-lattice protein model featuring a physical force-field and amino-acid sequence. We show that localized modes of nonlinear origin, discrete breathers (DBs), emerge naturally as continuations of a subset of high-frequency normal modes residing at specific sites dictated by the native fold. DBs are time-periodic, space-localized vib...
متن کاملCoarse Grained Parallel Next Element Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoid...
متن کاملCoarse Grained Parallel Next Element Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoid...
متن کاملA coarse-grained model for DNA origami
Modeling tools provide a valuable support for DNA origami design. However, current solutions have limited application for conformational analysis of the designs. In this work we present a tool for a thorough study of DNA origami structure and dynamics. The tool is based on a novel coarse-grained model dedicated to geometry optimization and conformational analysis of DNA origami. We explored the...
متن کاملREVLD: A coarse-grained model for polymers
Article history: Received 15 September 2008 Received in revised form 27 January 2009 Accepted 28 January 2009 Available online xxxx PACS: 61.41.+e 61.25.he 36.20.Ey
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2022
ISSN: ['0045-7825', '1879-2138']
DOI: https://doi.org/10.1016/j.cma.2022.115124