Dynamic compressed hyperoctrees with application to the N-body problem

DOI10.1007/3-540-46691-6_2MaRDI QIDQ4501662zbMATH OpenFDO

Authors Srinivas Aluru, Fatih E. Sevilgen

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46691-6_2

zbMATH Keywords

hyperoctree

Mathematics Subject Classification ID

Data structures (68P05) Dynamics of multibody systems (70E55)

Recommendations

• Towards an adaptive treecode for \(N\)-body problems
• Computational Structure of the N-Body Problem
• Projection-tree reduced-order modeling for fast \(N\)-body computations
• Distribution-independent hierarchical algorithms for the \(N\)-body problem
• Tree Data Structures forN-Body Simulation
• scientific article; zbMATH DE number 1057776
• Hypercube Algorithms for Direct N-Body Solvers for Different Granularities
• An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations
• A performance comparison of tree data structures for \(N\)-body simulation
• The complexity of N-body simulation

Cited in

(1)

• Tree Data Structures forN-Body Simulation

This page was built for publication: Dynamic compressed hyperoctrees with application to the N-body problem

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