z-logo
open-access-imgOpen Access
Computer Simulations of Planet Collisions Using a New Parallel Algorithm
Author(s) -
Wesley Even,
M. W. Roth
Publication year - 2002
Publication title -
american journal of undergraduate research
Language(s) - English
Resource type - Journals
eISSN - 2375-8732
pISSN - 1536-4585
DOI - 10.33697/ajur.2002.019
Subject(s) - ejecta , scaling , parallel computing , computer science , code (set theory) , planet , algorithm , coefficient of restitution , object (grammar) , decomposition , satellite , scheme (mathematics) , computational science , physics , mathematics , astrophysics , geometry , mechanics , astronomy , artificial intelligence , ecology , mathematical analysis , biology , set (abstract data type) , supernova , programming language
New deterministic computer simulations have been developed for studying the dynamics of large objects colliding. For various initial conditions the system may clump together forming a new object or may rotate, causing ejecta to leave the primary mass in a pattern sustaining only a short number of orbits, but promising of satellite formation. Bodies without a large central mass are not able to form a cohesive object, and fly apart upon impact. A rudimentary scaling study when the code is parallelized using a force-decomposition scheme suggests that the computational time scales inversely as the number of processors when less than four are involved and the gains are somewhat less pronounced as the number of processors increases.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom