Dresden 2006 – scientific programme
Parts | Days | Selection | Search | Downloads | Help
DY: Dynamik und Statistische Physik
DY 46: Poster
DY 46.106: Poster
Thursday, March 30, 2006, 16:00–18:00, P1
Optimized computer algorithm for the simulation of densely packed spheres with arbitrary size distribution — •Antje Elsner1,2, Helmut Hermann1, and Dietrich Stoyan2 — 1Institute for Solid State and Materials research, IFW Dresden, P.O. Box 270116, D-01171 Dresden, Germany — 2Institute of Stochastics, Freiberg University of Mining and Technology, D-09596 Freiberg, Germany
Random dense packed spheres are a widely applicable model to simulate structures. There are different approaches to get dense packed systems. One of them is the so called force biased algorithm. A system of spheres is densified by stepwise rearrangement of sphere centres and recalculation of diameters. Some ways to optimize this algorithm are explained, especially the optimization of the virtual interaction forces between spheres during the packing process. It is demonstrated how systems with arbitrary size distributions can be optimized under different constraints.