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 条
  • [41] Computing Minimal Triangulations in Time O(nα log n) = o(n2.376)
    Heggernes, Pinar
    Telle, Jan Arne
    Villanger, Yngve
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 907 - 916
  • [42] An O(n(m plus n log n) log n) time algorithm to solve the minimum cost tension problem
    Ghiyasvand, Mehdi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 957 - 969
  • [43] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
    Han, Yijie
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
  • [44] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
    Yijie Han
    Algorithmica, 2008, 51 : 428 - 434
  • [45] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
    Takaoka, T
    INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
  • [46] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
    Han, Yijie
    ALGORITHMICA, 2008, 51 (04) : 428 - 434
  • [47] PETAR: a high-performance N-body code for modelling massive collisional stellar systems
    Wang, Long
    Iwasawa, Masaki
    Nitadori, Keigo
    Makino, Junichiro
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2020, 497 (01) : 536 - 555
  • [48] TRANSLATION OF TURNER COMBINATORS IN O(N LOG N) SPACE
    NOSHITA, K
    INFORMATION PROCESSING LETTERS, 1985, 20 (02) : 71 - 74
  • [49] Matching nuts and bolts in O(n log n) time
    Komlos, J
    Ma, Y
    Szemeredi, E
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 232 - 241
  • [50] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7