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
A comparison of data structures for the simulation of polydisperse particle packings
β Scribed by S. Raschdorf; M. Kolonko
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 302 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0029-5981
- DOI
- 10.1002/nme.2988
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A formulation of the PML technique suitable for the FDTD simulation of optical structures is presented. The FDTD formulation is based on the scalar-wa¨e equation. The resulting algorithm is stable, efficient, and effecti¨e. Numerical results show that the technique pro¨ides an excellent le¨el of abs
## Abstract This article presents the development and application of a corrected smooth particle hydrodynamics (CSPH) code to the simulation of debris flow and avalanches. The advantages of a meshβfree method over other traditional numerical methods such as the finite element method are discussed.
In the paper we compare the performance of six heuristics with suboptimal solutions for the data distribution of two dimensional meshes that are used for the numerical solution of partial differential equations (PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven