Large-scale simulations of poly(propylene oxide)amine/Na+-montmorillonite and poly(propylene oxide) ammonium/Na+-montmorillonite using a molecular dynamics approach

Author(s):  
P. Boulet ◽  
H.C. Greenwell ◽  
B. Chen ◽  
A.A. Bowden ◽  
I. Beurroies ◽  
...  
1993 ◽  
Vol 321 ◽  
Author(s):  
C. Molteni ◽  
L. Colombo ◽  
L. Miglio

ABSTRACTWe investigate the short-range structural properties of a-GaAs as obtained in a computer experiment based on a tight-binding molecular dynamics simulation. The amorphous configuration is obtained by quenching a liquid sample well equilibrated at T=1600 K. A detailed characterization of the topology and defect distribution of the amorphous network is presented and discussed. The electronic structure of our sample is calculated as well. Finally, we discuss the reliability and transferability of the present computational scheme for large-scale simulations of compound semiconductor materials by comparing our results to first-principles calculations.


2000 ◽  
Vol 112 (23) ◽  
pp. 10669-10679 ◽  
Author(s):  
Peter Ahlström ◽  
Oleg Borodin ◽  
Göran Wahnström ◽  
Erik J. W. Wensink ◽  
Patrik Carlsson ◽  
...  

2004 ◽  
Vol 15 (01) ◽  
pp. 193-201 ◽  
Author(s):  
KAI KADAU ◽  
TIMOTHY C. GERMANN ◽  
PETER S. LOMDAHL

We have performed parallel large-scale molecular-dynamics simulations on the QSC-machine at Los Alamos. The good scalability of the SPaSM code is demonstrated together with its capability of efficient data analysis for enormous system sizes up to 19 000 416 964 particles. Furthermore, we introduce a newly-developed graphics package that renders in a very efficient parallel way a huge number of spheres necessary for the visualization of atomistic simulations. These abilities pave the way for future atomistic large-scale simulations of physical problems with system sizes on the μ-scale.


1992 ◽  
Vol 1 (2) ◽  
pp. 153-161 ◽  
Author(s):  
L.H. Yang ◽  
E.D. Brooks III ◽  
J. Belak

A molecular dynamics algorithm for performing large-scale simulations using the Parallel C Preprocessor (PCP) programming paradigm on the BBN TC2000, a massively parallel computer, is discussed. The algorithm uses a linked-cell data structure to obtain the near neighbors of each atom as time evoles. Each processor is assigned to a geometric domain containing many subcells and the storage for that domain is private to the processor. Within this scheme, the interdomain (i.e., interprocessor) communication is minimized.


Author(s):  
Priya Vashishta ◽  
Rajiv K. Kalia ◽  
Aiichiro Nakano ◽  
Wei Li ◽  
Ingvar Ebbsjö

Sign in / Sign up

Export Citation Format

Share Document