Comparison of two different tree algorithms

DOI10.1016/0021-9991(90)90186-5zbMATH Open0695.68041OpenAlexW2107401307MaRDI QIDQ910222FDOQ910222

Authors: Junichiro Makino 

Publication date: 1990

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(90)90186-5

Recommendations

• An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations
• A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM
• scientific article; zbMATH DE number 1222823
• A hierarchical \({\mathcal O}(N)\) force calculation algorithm
• Tree Data Structures forN-Body Simulation

zbMATH Keywords

tree algorithmstree structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• A modified tree code: Don't laugh; it runs
• Vectorization of tree traversals
• Vectorization of a treecode

Cited In (4)

• Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure
• A performance comparison of tree data structures for \(N\)-body simulation
• Range searching in multidimensional databases using navigation metadata
• A Comparison of Many Max-tree Computation Algorithms

This page was built for publication: Comparison of two different tree algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910222)