✦ LIBER ✦

Constructing merger trees that mimic N-body simulations

✍ Scribed by Eyal Neistein; Avishai Dekel

Book ID: 110842479
Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 269 KB
Volume: 383
Category: Article
ISSN: 0035-8711
DOI: 10.1111/j.1365-2966.2007.12570.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Galaxy formation using halo merger histo

Galaxy formation using halo merger histories taken from N-body simulations

✍ John C. Helly; Shaun Cole; Carlos S. Frenk; Carlton M. Baugh; Andrew Benson; Ced 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Supermassive black hole growth and merge

Supermassive black hole growth and merger rates from cosmological N-body simulations

✍ Miroslav Micic; Kelly Holley-Bockelmann; Steinn Sigurdsson; Tom Abel 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

Tree Data Structures for N -Body Simulat

Tree Data Structures for N -Body Simulation

✍ Anderson, Richard J. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 348 KB

Hierarchical trees in N-body simulations

Hierarchical trees in N-body simulations: Relations with cluster analysis methods

✍ F.D. Murtagh 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 364 KB

A Performance Comparison of Tree Data St

A Performance Comparison of Tree Data Structures for N-Body Simulation

✍ J. Waltz; G.L. Page; S.D. Milder; J. Wallin; A. Antunes 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a performance comparison of tree data structures for N -body simulation. The tree data structures examined are the balanced binary tree and the Barnes-Hut (BH) tree. Previous work has compared the performance of BH trees with that of nearest-neighbor trees and the fast multipole method, b

An O(n) time hierarchical tree algorithm

An O(n) time hierarchical tree algorithm for computing force field in n-body simulations

✍ Guoliang Xue 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 934 KB