Gravitaatiosimulaatiot

Tässä tutkielmassa tarkastellaan gravitaatiosimulaatioita, simulaatioiden tehokkuutta ja algoritmeja, joilla simulaatioita voidaan nopeuttaa. Gravitaatiosimulaatioiden suurin ongelma on laskennallinen vaativuus. Suoraan N kappaleen välisiä vuorovaikutuksia laskemalla laskennallinen vaativuus on luok...

Full description

Bibliographic Details
Main Author: Peiponen, Aapo
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2019
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/64204
_version_ 1826225804804096000
author Peiponen, Aapo
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Peiponen, Aapo Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Peiponen, Aapo Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Peiponen, Aapo
datasource_str_mv jyx
description Tässä tutkielmassa tarkastellaan gravitaatiosimulaatioita, simulaatioiden tehokkuutta ja algoritmeja, joilla simulaatioita voidaan nopeuttaa. Gravitaatiosimulaatioiden suurin ongelma on laskennallinen vaativuus. Suoraan N kappaleen välisiä vuorovaikutuksia laskemalla laskennallinen vaativuus on luokkaa O(N^2). On selvää, että tämä on ongelma suurilla kappalemäärillä. Erilaiset algoritmit, kuten Barnes-Hut puualgoritmi, voivat vähentää aikavaativuutta tuntuvasti. Parhaimmillaan voidaan saavuttaa nopealla moninapamenetelmällä aikavaativuus O(N). Simulaatioita voidaan lisäksi nopeuttaa hyödyntämällä rinnakkaislaskentaa. Tähän soveltuu esimerkiksi Barnes–Hut-algoritmi hyvin. In this paper we will look at gravitational simulations, effectiveness of simulations and algorithms that can be used to accelerate simulations. The biggest problem gravitational simulations have is algorithmic complexity. Calculating interactions directly has the algorithmic complexity of O(N^2). It is clear that this becomes a real problem with large numbers of particles in simulation. Different algorithms such as the Barnes-Hut tree algorithm can reduce algorithmic complexity a lot. At best algorithmic complexity of O(N) can be achieved with Fast Multipole Method. In addition, to achieve speed it is very important to make use of parallel computing. Barnes–Hut-algorithm is well suited for parallel computing.
first_indexed 2019-09-20T09:12:49Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "M\u00f6nk\u00f6l\u00e4, Sanna", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Peiponen, Aapo", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2019-05-27T09:01:17Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2019-05-27T09:01:17Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2019", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/64204", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "T\u00e4ss\u00e4 tutkielmassa tarkastellaan gravitaatiosimulaatioita, simulaatioiden tehokkuutta ja algoritmeja, joilla simulaatioita voidaan nopeuttaa. Gravitaatiosimulaatioiden suurin ongelma on laskennallinen vaativuus. Suoraan N kappaleen v\u00e4lisi\u00e4 vuorovaikutuksia laskemalla laskennallinen vaativuus on luokkaa O(N^2). On selv\u00e4\u00e4, ett\u00e4 t\u00e4m\u00e4 on ongelma suurilla kappalem\u00e4\u00e4rill\u00e4. Erilaiset algoritmit, kuten Barnes-Hut puualgoritmi, voivat v\u00e4hent\u00e4\u00e4 aikavaativuutta tuntuvasti. Parhaimmillaan voidaan saavuttaa nopealla moninapamenetelm\u00e4ll\u00e4 aikavaativuus O(N). Simulaatioita voidaan lis\u00e4ksi nopeuttaa hy\u00f6dynt\u00e4m\u00e4ll\u00e4 rinnakkaislaskentaa. T\u00e4h\u00e4n soveltuu esimerkiksi Barnes\u2013Hut-algoritmi hyvin.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "In this paper we will look at gravitational simulations, effectiveness of simulations and algorithms that can be used to accelerate simulations. The biggest problem gravitational simulations have is algorithmic complexity. Calculating interactions directly has the algorithmic complexity of O(N^2). It is clear that this becomes a real problem with large numbers of particles in simulation. Different algorithms such as the Barnes-Hut tree algorithm can reduce algorithmic complexity a lot. At best algorithmic complexity of O(N) can be achieved with Fast Multipole Method. In addition, to achieve speed it is very important to make use of parallel computing. Barnes\u2013Hut-algorithm is well suited for parallel computing.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Miia Hakanen (mihakane@jyu.fi) on 2019-05-27T09:01:17Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2019-05-27T09:01:17Z (GMT). No. of bitstreams: 0\n Previous issue date: 2019", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "21", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "Barnes--Hut-algoritmi", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "gravitaatiosimulaatiot", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Gravitaatiosimulaatiot", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-201905272812", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "simulointi", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_64204
language fin
last_indexed 2025-02-18T10:54:14Z
main_date 2019-01-01T00:00:00Z
main_date_str 2019
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/0bdc56b7-157f-4adc-a2ec-a319d703cad1\/download","text":"URN:NBN:fi:jyu-201905272812.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2019
record_format qdc
source_str_mv jyx
spellingShingle Peiponen, Aapo Gravitaatiosimulaatiot Barnes--Hut-algoritmi gravitaatiosimulaatiot Tietotekniikka Mathematical Information Technology 602 algoritmit simulointi
title Gravitaatiosimulaatiot
title_full Gravitaatiosimulaatiot
title_fullStr Gravitaatiosimulaatiot Gravitaatiosimulaatiot
title_full_unstemmed Gravitaatiosimulaatiot Gravitaatiosimulaatiot
title_short Gravitaatiosimulaatiot
title_sort gravitaatiosimulaatiot
title_txtP Gravitaatiosimulaatiot
topic Barnes--Hut-algoritmi gravitaatiosimulaatiot Tietotekniikka Mathematical Information Technology 602 algoritmit simulointi
topic_facet 602 Barnes--Hut-algoritmi Mathematical Information Technology Tietotekniikka algoritmit gravitaatiosimulaatiot simulointi
url https://jyx.jyu.fi/handle/123456789/64204 http://www.urn.fi/URN:NBN:fi:jyu-201905272812
work_keys_str_mv AT peiponenaapo gravitaatiosimulaatiot