A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM

DOI10.1016/S0304-3975(99)00326-6zbMath0974.68244MaRDI QIDQ5941086

Guoliang Xue

Publication date: 20 August 2001

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

zbMATH Keywords

body simulationscost optimal algorithmsforce field evaluationPRAMspatial tree algorithms

Mathematics Subject Classification ID

Related Items (2)

Improved bounds for interatomic distance in Morse clusters ⋮ New results for molecular formation under pairwise potential minimization

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations
• The order of Appel's algorithm
• Scalable parallel formulations of the Barnes--Hut method for n-body simulations
• Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
• Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
• Fast Algorithms for Classical Physics
• The Parallel Multipole Method on the Connection Machine
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Greengard’s N-Body Algorithm is not Order N
• A fast algorithm for particle simulations

This page was built for publication: A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM