English
Related papers

Related papers: Automatic Coarse Graining of Polymers

200 papers

We present a geometric multilevel optimization approach that smoothly incorporates box constraints. Given a box constrained optimization problem, we consider a hierarchy of models with varying discretization levels. Finer models are…

Optimization and Control · Mathematics 2024-04-23 Sebastian Müller , Stefania Petra , Matthias Zisler

Automated analyses of the outcome of a simulation have been an important part of atomistic modeling since the early days, addressing the need of linking the behavior of individual atoms and the collective properties that are usually the…

Chemical Physics · Physics 2019-05-22 Michele Ceriotti

In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-10-14 Julien Duchateau , François Rousselle , Nicolas Maquignon , Gilles Roussel , Christophe Renaud

Through extensive molecular simulations we determine a phase diagram of attractive, flexible polymer chains in two and three dimensions. A surprisingly rich collection of distinct crystal morphologies appear, which can be finely tuned…

In computational materials science, coarse-graining approaches often lack a priori uncertainty quantification (UQ) tools that estimate the accuracy of a reduced-order model before it is calibrated or deployed. This is especially the case in…

Computational Physics · Physics 2018-12-11 Paul N. Patrone , Andrew M. Dienstfrey , Geoffrey B. McFadden

In this paper we investigate the approximation properties of the coarse-graining procedure applied to kinetic Monte Carlo simulations of lattice stochastic dynamics. We provide both analytical and numerical evidence that the hierarchy of…

Numerical Analysis · Mathematics 2007-05-23 Markos A Katsoulakis , Petr Plechac , Alexandros Sopasakis

In this work we illustrate our novel quantitative simulation approach for dense amorphous polymer systems, as discussed in our previous work[Kulkarni et al., A Novel Approach for Lattice Simulations of Polymer Chains in Dense Amorphous…

Soft Condensed Matter · Physics 2008-05-06 Joydeep Mukherjee , Antony N. Beris

We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…

We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…

Cellular Automata and Lattice Gases · Physics 2015-06-26 Navot Israeli , Nigel Goldenfeld

We formulate an effective-description framework for the dynamics of open quantum systems by extending the time-coarse-graining formalism to open systems. Our coarse-graining procedure efficiently removes high-frequency processes which are…

Quantum Physics · Physics 2018-01-17 Chang-Woo Lee , Changsuk Noh , Jaewan Kim

We propose a hybrid Molecular Dynamics/Multi-particle Collision Dynamics model to simulate a set of self-assembled semiflexible filaments and free monomers. Further, we introduce a Monte-Carlo scheme to deal with single monomer addition…

Soft Condensed Matter · Physics 2012-02-29 Mathieu Caby , Priscilla Hardas , Sanoop Ramachandran , Jean-Paul Ryckaert

A new approach for integration of motion in many-body systems of interacting polyatomic molecules is proposed. It is based on splitting time propagation of pseudo-variables in a modified phase space, while the real translational and…

Statistical Mechanics · Physics 2009-11-13 Igor P. Omelyan

The work introduces a 3D cellular automaton model for the spatial and crystallographic prediction of spherulite growth phenomena in polymers at the mesoscopic scale. The automaton is discrete in time, real space, and orientation space. The…

Soft Condensed Matter · Physics 2008-11-11 D. Raabe

The goal of the paper is to automatize the selection of mechanisms which are able to describe a set of measurements. In order to do so first we construct a set of possible mechanism fulfilling chemically reasonable requirements with a given…

Numerical Analysis · Mathematics 2019-04-03 Tibor Nagy , János Tóth , Tamás Ladics

Polymer chains in colloid-polymer mixtures can be coarse-grained by replacing them with single soft particles interacting via effective polymer-polymer and polymer-colloid pair potentials. Here we describe in detail how Ornstein-Zernike…

Soft Condensed Matter · Physics 2007-05-23 P. G. Bolhuis , A. A. Louis

We discuss the reliability of integral-equation methods based on several commonly used closure relations in determining the phase diagram of coarse-grained models of soft-matter systems characterized by mutually interacting soft and…

Soft Condensed Matter · Physics 2015-10-28 Roberto Menichetti , Andrea Pelissetto , Giuseppe D'Adamo , Carlo Pierleoni

The statistical mechanics of a linear non-interacting polymer chain with a large number of monomers is considered with fixed angular momentum. The radius of gyration for a linear polymer is derived exactly by functional integration. This…

Soft Condensed Matter · Physics 2013-05-29 Matthew Brunner , J. M. Deutsch

Molecular dynamics (MD) simulations provide detailed insight into atomic-scale mechanisms but are inherently restricted to small spatio-temporal scales. Coarse-grained molecular dynamics (CGMD) techniques allow simulations of much larger…

Computational Physics · Physics 2025-02-10 Yangshuai Wang , Gabor Csanyi , Christoph Ortner

The most popular and universally predictive protein simulation models employ all-atom molecular dynamics (MD), but they come at extreme computational cost. The development of a universal, computationally efficient coarse-grained (CG) model…

We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…

Numerical Analysis · Mathematics 2025-09-16 Yuxin Huang , Benjamin E. Grossman-Ponemon , David A. B. Hyde
‹ Prev 1 8 9 10 Next ›