Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAdaptive coarse-graining for large-scale DEM simulations
56
0
0.0
(
0
)
Added by
Daniel Queteschiner
Publication date
2017
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The large time and length scales and, not least, the vast number of particles involved in industrial-scale simulations inflate the computational costs of the Discrete Element Method (DEM) excessively. Coarse grain models can help to lower the computational demands significantly. However, for effects that intrinsically depend on particle size, coarse grain models fail to correctly predict the behaviour of the granular system. To solve this problem we have developed a new technique based on the efficient combination of fine-scale and coarse grain DEM models. The method is designed to capture the details of the granular system in spatially confined sub-regions while keeping the computational benefits of the coarse grain model where a lower resolution is sufficient. To this end, our method establishes two-way coupling between resolved and coarse grain parts of the system by volumetric passing of boundary conditions. Even more, multiple levels of coarse-graining may be combined to achieve an optimal balance between accuracy and speedup. This approach enables us to reach large time and length scales while retaining specifics of crucial regions. Furthermore, the presented model can be extended to coupled CFD-DEM simulations, where the resolution of the CFD mesh may be changed adaptively as well.
rate research
Read More
Coarse graining enables the investigation of molecular dynamics for larger systems and at longer timescales than is possible at atomic resolution. However, a coarse graining model must be formulated such that the conclusions we draw from it are consistent with the conclusions we would draw from a model at a finer level of detail. It has been proven that a force matching scheme defines a thermodynamically consistent coarse-grained model for an atomistic system in the variational limit. Wang et al. [ACS Cent. Sci. 5, 755 (2019)] demonstrated that the existence of such a variational limit enables the use of a supervised machine learning framework to generate a coarse-grained force field, which can then be used for simulation in the coarse-grained space. Their framework, however, requires the manual input of molecular features upon which to machine learn the force field. In the present contribution, we build upon the advance of Wang et al.and introduce a hybrid architecture for the machine learning of coarse-grained force fields that learns their own features via a subnetwork that leverages continuous filter convolutions on a graph neural network architecture. We demonstrate that this framework succeeds at reproducing the thermodynamics for small biomolecular systems. Since the learned molecular representations are inherently transferable, the architecture presented here sets the stage for the development of machine-learned, coarse-grained force fields that are transferable across molecular systems.
In this paper, we present an efficient adaptive multigrid strategy for large-scale molecular mechanics optimization. The oneway multigrid method is used with inexact approximations, such as the quasi-atomistic (QA) approximation or the blended ghost force correction (BGFC) approximation on each coarse level, combined with adaptive mesh refinements based on the gradient-based a posteriori error estimator. For crystalline defects, like vacancies, micro-crack and dislocation, sublinear complexity is observed numerically when the adaptive BGFC method is employed. For systems with more than ten millions atoms, this strategy has a fivefold acceleration in terms of CPU time.
In this paper we propose and test the validity of simple and easy-to-implement algorithms within the immersed boundary framework geared towards large scale simulations involving thousands of deformable bodies in highly turbulent flows. First, we introduce a fast moving least squares (fast-MLS) approximation technique with which we speed up the process of building transfer functions during the simulations which leads to considerable reductions in computational time. We compare the accuracy of the fast-MLS against the exact moving least squares (MLS) for the standard problem of uniform flow over a sphere. In order to overcome the restrictions set by the resolution coupling of the Lagrangian and Eulerian meshes in this particular immersed boundary method, we present an adaptive Lagrangian mesh refinement procedure that is capable of drastically reducing the number of required nodes of the basic Lagrangian mesh when the immersed boundaries can move and deform. Finally, a coarse-grained collision detection algorithm is presented which can detect collision events between several Lagrangian markers residing on separate complex geometries with minimal computational overhead.
We analyze Lindblad-Gorini-Kossakowski-Sudarshan-type generators for selected periodically driven open quantum systems. All these generators can be obtained by temporal coarse-graining procedures, and we compare different coarse-graining schemes. Similar as for undriven systems, we find that a dynamically adapted coarse-graining time, effectively yielding non-Markovian dynamics by interpolating through a series of different but invididually Markovian solutions, gives the best results among the different coarse-graining schemes, albeit at highest computational cost.
We assess Coarse Graining by studying different partitions of the phase space of the Baker transformation and the periodic torus automorphisms. It turns out that the shape of autocorrelation functions for the Baker transformation is more or less reproduced. However, for certain partitions the decay rates turn out to be irrelevant, even decay may stop in a finite time. For the periodic torus automorphisms, Coarse Graining introduces artificial dumping.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
