AN O(N LOG N) INTEGRATION SCHEME FOR COLLISIONAL STELLAR-SYSTEMS

被引:53
|
作者
MCMILLAN, SLW [1 ]
AARSETH, SJ [1 ]
机构
[1] UNIV CAMBRIDGE,INST ASTRON,CAMBRIDGE CB3 0HA,ENGLAND
来源
ASTROPHYSICAL JOURNAL | 1993年 / 414卷 / 01期
关键词
CELESTIAL MECHANICS; STELLAR DYNAMICS; METHODS; NUMERICAL;
D O I
10.1086/173068
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
We present a new tree-based, high-order integration scheme for the numerical simulation of collisional N-body systems. Unlike previous tree codes, in our implementation the tree is allowed to deform with time, and the properties of each component cell are not calculated afresh at each step but instead are predicted only as needed. Cells are represented by a multipole expansion that can extend as far as the octupole term, depending on the relative costs of the multipole and individual-particle calculations. A block time step algorithm is used to simplify scheduling and to allow full vectorization of the code. Both particle and tree time steps are included within the same block structure. Strongly interacting particles are treated through the use of Kustaanheimo-Stiefel regularization, and only the center of mass of a binary appears in the tree structure, effectively limiting the tree's maximum depth. The integrator conserves energy to a few parts per million per crossing time, and its measured O(N1.5) scaling suggests that it will become competitive with NBODY5, the ''standard'' high-precision integrator for small systems, for N greater than or similar to 10(4). In the present implementation, for N < 10(4), the scaling falls somewhat short of the expected O(N log N) behavior, in large part because the tree-traversal algorithm has not quite reached its asymptotic regime. We have applied the new tree code to the problem of core collapse in a 1024 body equal-mass system, and have found results in excellent agreement with those obtained using NBODY5. We conclude that tree-based schemes can be confidently applied to collisional problems without excessive concern that the tree algorithm will seriously disturb the relaxation processes that drive the evolution.
引用
收藏
页码:200 / 212
页数:13
相关论文
共 50 条
  • [31] Sorting stably, in place, with O (n log n) comparisons and O(n) moves
    Franceschini, Gianni
    THEORY OF COMPUTING SYSTEMS, 2007, 40 (04) : 327 - 353
  • [32] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [33] AN O(N LOG N + M LOG LOG N) MAXIMUM WEIGHT CLIQUE ALGORITHM FOR CIRCULAR-ARC GRAPHS
    SHIH, WK
    HSU, WL
    INFORMATION PROCESSING LETTERS, 1989, 31 (03) : 129 - 134
  • [34] Collaborative Broadcast in O(log log n) Rounds
    Schindelhauer, Christian
    Oak, Aditya
    Janson, Thomas
    ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2019, 2019, 11931 : 119 - 136
  • [35] Implicit dictionaries supporting searches and amortized updates in O (log n log log n) time
    Franceschini, G
    Grossi, R
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 670 - 678
  • [36] Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time
    Huang, Shang-En
    Huang, Dawei
    Kopelowitz, Tsvi
    Pettie, Seth
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 510 - 520
  • [37] Minimum Cut of Directed Planar Graphs in O(n log log n) Time
    Mozes, Shay
    Nikolaev, Kirill
    Nussbaum, Yahav
    Weimann, Oren
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
  • [38] O(LOG N) BIMODALITY ANALYSIS
    PHILLIPS, TY
    ROSENFELD, A
    SHER, AC
    PATTERN RECOGNITION, 1989, 22 (06) : 741 - 746
  • [39] Sorting stably, in-place, with O(n log n) comparisons and O(n) moves
    Franceschini, G
    STACS 2005, PROCEEDINGS, 2005, 3404 : 629 - 640
  • [40] COMPUTING MINIMAL TRIANGULATIONS IN TIME O(nα log n) = o(n2.376)
    Heggernes, Pinar
    Telle, Jan Arne
    Villanger, Yngve
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (04) : 900 - 913