Tuesday, November 6, 2007 - 5:30 PM
319g

A Coarse-Grained Force Field For Simulating Tethered Nanoparticle Self-Assembly In Solution

Elaine R. Chan1, Alberto Striolo2, Clare McCabe3, Sharon C. Glotzer4, and Peter T. Cummings3. (1) Semiconductor Electronics Division, Electronics and Electrical Engineering Laboratory, NIST, 100 Bureau Drive, Gaithersburg, MD 20899-8120, (2) School of Chemical Biological and Materials Engineering, The University of Oklahoma, Norman, OK 73019, (3) Department of Chemical Engineering, Vanderbilt University, Nashville, TN 37235-1604, (4) Department of Chemical Engineering, University of Michigan, 2300 Hayward Street, Ann Arbor, MI 48109-2136

The development and application of multiscale modeling and simulation techniques are increasingly desirable for investigating assemblies of molecular nanoparticles having various geometries and/or functionalized with various substituents. The development of a coarse-grained force field for accurately simulating polymer-tethered polyhedral oligomeric silsesquioxane (POSS) nanoparticle self-assembly in a common organic solvent will be presented here. The force field consists of effective solvent-mediated interaction potentials that already account for POSS-solvent molecule interactions. The coarse-graining approach used is a structural-based one where effective numerical potentials are derived that reproduce in the coarse-grained simulations target structural properties in the underlying atomistic simulations. In simulations of self-assembly, various types of local packings of the POSS cages and tether conformations are observed in the atomistic simulations and sufficiently captured in the coarse-grained model. The coarse-grained force field affords a savings of about two orders of magnitude in computing time. In addition to obtaining the solvent-mediated effective potentials for simulating POSS molecule self-assembly, particular aspects of the coarse-graining approach, including nonuniqueness of the effective potentials and variations on the numerical iteration algorithm, are examined.