National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Simulation of Large Particle Systems
Štambachr, Jakub ; Navrátil, Jan (referee) ; Juránek, Roman (advisor)
This bachelor thesis adresses the problem of large-scale particle system simulations. Its main goal is to create an efficient simulation model of cosmological N-body systems and its consequent testing. I chose to implement a version of Barnes-Hut Tree-Code algorithm, which meets the requirement for a high-speed simulation method. The tests carried out  within the scope of this thesis imply that tree-code method is of a logarithmic complexity. As an output of this simulation model I present several videos, demonstrating in an illustrative fashion a functionality of the model.
Visualization and simulation methods of Solar System bodies
Hýroš, Andrej ; Hanák, Jiří (referee) ; Novák, Jiří (advisor)
Táto práca sa zaoberá vývojom programu na simuláciu a vizualizáciu pohybu n telies podľa Newtonových zákonov. Vstupom je zoznam telies a ich počiatočné podmienky. Po dokončení simulácie je vzájomný pohyb telies celého systému animovaný v programe s grafickým užívateľským rozhraním a je uložený súbor s priebehom simulácie. Počas simulácie sú riešené diferenciálne rovnice prvého rádu. V práci boli implementované viaceré algoritmy numerickej integrácie, ktoré umožňujú používateľovi zvoliť si vhodný algoritmus pre potreby jeho simulácie a dosiahnuť tak optimálny priebeh simulácie. Program bol prehlásený ako validný po porovnaní výstupu programu s dátami od NASA.
Simulation of Large Particle Systems
Štambachr, Jakub ; Navrátil, Jan (referee) ; Juránek, Roman (advisor)
This bachelor thesis adresses the problem of large-scale particle system simulations. Its main goal is to create an efficient simulation model of cosmological N-body systems and its consequent testing. I chose to implement a version of Barnes-Hut Tree-Code algorithm, which meets the requirement for a high-speed simulation method. The tests carried out  within the scope of this thesis imply that tree-code method is of a logarithmic complexity. As an output of this simulation model I present several videos, demonstrating in an illustrative fashion a functionality of the model.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.