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

DOI10.1016/S0304-3975(97)00232-6zbMath0911.68072MaRDI QIDQ1128668

Guoliang Xue

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

force field evaluationspatial tree algorithms\(n\)-body simulations

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (2)

Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure ⋮ A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM

Cites Work

• Unnamed Item
• The order of Appel's algorithm
• Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
• Fast Algorithms for Classical Physics
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A fast algorithm for particle simulations

This page was built for publication: An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations