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 条
  • [21] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [22] Deterministic sorting in O (n log log n) time and linear space
    Han, YJ
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 50 (01): : 96 - 105
  • [23] Integer multiplication in time O(n log n)
    Harvey, David
    van der Hoeven, Joris
    ANNALS OF MATHEMATICS, 2021, 193 (02) : 563 - 617
  • [24] An O(N log N) algorithm for shape modeling
    Malladi, R.
    Sethian, J. A.
    Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
  • [25] AN O(N LOG N) MANHATTAN PATH ALGORITHM
    LIPSKI, W
    INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
  • [26] Atomic snapshots in O(n log n) operations
    Attiya, H
    Rachman, O
    SIAM JOURNAL ON COMPUTING, 1998, 27 (02) : 319 - 340
  • [27] An O(N log N) algorithm for shape modeling
    Malladi, R
    Sethian, JA
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
  • [28] An in-place sorting with O (n log n) comparisons and O(n) moves
    Franceschini, G
    Geffert, V
    JOURNAL OF THE ACM, 2005, 52 (04) : 515 - 537
  • [29] Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
    Gianni Franceschini
    Theory of Computing Systems, 2007, 40 : 327 - 353
  • [30] An in-place sorting with O (n log n) comparisons and O (n) Moves
    Franceschini, G
    Geffert, V
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 242 - 250