PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 1, 1987The Astrophysical Journal Supplement Series280 citations

Performance characteristics of tree codes

View Full Paper
LHLars Hernquist

Key Points

Key points are not available for this paper at this time.

Abstract

A Fortran implementation of the Barnes-Hut hierarchical tree algorithm is presented and analyzed in the context of the astrophysical N-body problem. The errors introduced into the force calculation as a result of the clustering of distant particles, and their influence on the relaxation time and physical conservation laws, are considered. Tree algorithms should be suitable for studying a wide range of astrophysical phenomena, including potentially both collisional and collisionless systems. As an example, a simulation of the decay of a satellite orbit around a self-gravitating disk with N = 32,768, performed with the tree method, is compared with previous calculations.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lars Hernquist (1987) studied this question.

synapsesocial.com/papers/6a1a92f6739ab56a9085ac84https://doi.org/10.1086/191215
Ask AI
Helpful
Bookmark
Share
View Full Paper