Show simple item record

dc.contributor.authorMetchnik, Marc Victor
dc.creatorMetchnik, Marc Victoren_US
dc.date.accessioned2011-12-05T22:16:04Z
dc.date.available2011-12-05T22:16:04Z
dc.date.issued2009en_US
dc.identifier.urihttp://hdl.handle.net/10150/194058
dc.description.abstractWe provide a novel and efficient algorithm for computing accelerations in theperiodic large-N-body problem that is at the same time significantly fasterand more accurate than previous methods. Our representation of theperiodic acceleration is precisely mathematically equivalent to that determinedby Ewald summation and is computed directly as an infinite lattice sum usingthe Newtonian kernel. Retaining this kernel implies that one can(i) extend the standard open boundary numerical algorithms and(ii) harness the tremendous computational speed possessed by Graphics ProcessingUnits (GPUs) in computing Newtonian kernels straightforwardly to the periodic domain.The precise form of our direct interactions is based upon the adaptive softeninglength methodology introduced for open boundary conditions by Price and Monaghan.Furthermore, we describe a new Fast Multipole Method (FMM) that represents themultipoles and Taylor series as collections of pseudoparticles. Using thesetechniques we have computed forces to machine precision throughout the evolution ofa 1 billion particle cosmological simulation with a price/performance ratio morethan 100 times that of current numerical techniques operating at much lower accuracy.
dc.language.isoENen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.titleA Fast N-Body Scheme for Computational Cosmologyen_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
dc.contributor.chairPinto, Philip A.en_US
dc.identifier.oclc659753402en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.contributor.committeememberPinto, Philip A.en_US
dc.contributor.committeememberArnett, W. Daviden_US
dc.contributor.committeememberDavé, Romeel A.en_US
dc.contributor.committeememberEisenstein, Daniel J.en_US
dc.contributor.committeememberStrittmatter, Peter A.en_US
dc.identifier.proquest10667en_US
thesis.degree.disciplineAstronomyen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.namePh.D.en_US
refterms.dateFOA2018-08-16T03:03:36Z
html.description.abstractWe provide a novel and efficient algorithm for computing accelerations in theperiodic large-N-body problem that is at the same time significantly fasterand more accurate than previous methods. Our representation of theperiodic acceleration is precisely mathematically equivalent to that determinedby Ewald summation and is computed directly as an infinite lattice sum usingthe Newtonian kernel. Retaining this kernel implies that one can(i) extend the standard open boundary numerical algorithms and(ii) harness the tremendous computational speed possessed by Graphics ProcessingUnits (GPUs) in computing Newtonian kernels straightforwardly to the periodic domain.The precise form of our direct interactions is based upon the adaptive softeninglength methodology introduced for open boundary conditions by Price and Monaghan.Furthermore, we describe a new Fast Multipole Method (FMM) that represents themultipoles and Taylor series as collections of pseudoparticles. Using thesetechniques we have computed forces to machine precision throughout the evolution ofa 1 billion particle cosmological simulation with a price/performance ratio morethan 100 times that of current numerical techniques operating at much lower accuracy.


Files in this item

Thumbnail
Name:
azu_etd_10667_sip1_m.pdf
Size:
1.931Mb
Format:
PDF
Description:
azu_etd_10667_sip1_m.pdf

This item appears in the following Collection(s)

Show simple item record