A performance comparison of tree data structures for \(N\)-body simulation
type: Item
instance of: scholarly article
title: A performance comparison of tree data structures for \(N\)-body simulation
zbMATH Open document ID: 1042.70001
author: R. Smith
published in: Journal of Computational Physics
publication date: 2002-01-01T00:00:00Z
review text: Two tree data structures (the balanced binary one and the Barnes-Hut tree) are compared in parallel with a hereby developed modified binary tree. A general computational tool is developed and used for the controlled comparison. The performance metrics are applied to two types of problems, both for long-range gravity and for short-range physics, and conclusions are drawn. The overall merits of the binary tree approach, especially of the proposed modified one, are documented and its prespective for applications beyond the \(N\)-body simulation is given.
Mathematics Subject Classification ID: 70-08
Mathematics Subject Classification ID: 70F10
Mathematics Subject Classification ID: 85-08
zbMATH DE Number: 1760849
zbMATH Keywords: long-range gravity
zbMATH Keywords: Barnes-Hut tree
reviewed by: Maria Gousidou-Koutita
describes a project that uses: TREESPH
MaRDI profile type: Publication
full work available at URL: jcph.2001.6943
OpenAlex ID: W1966383678
cites work: Q3953228
cites work: Tree Data Structures forN-Body Simulation
cites work: A fast algorithm for particle simulations
cites work: Skeletons from the treecode closet
cites work: Comparison of two different tree algorithms
cites work: A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
cites work: Q3619797
cites work: Q3996938
cites work: Q5447502
DOI: 10.1006/JCPH.2001.6943
description: scientific article; zbMATH DE number 1760849