Tree-based solvers for adaptive mesh refinement code FLASH - I: gravity and optical depths

被引:67
|
作者
Wuensch, R. [1 ]
Walch, S. [2 ,3 ]
Dinnbier, F. [1 ,3 ,4 ]
Whitworth, A. [5 ]
机构
[1] Czech Acad Sci, Astron Inst, Bocni 2 1401, CZ-14100 Prague, Czech Republic
[2] Max Planck Inst Astrophys, Karl Schwarzschild Str 1, D-85741 Garching, Germany
[3] Univ Cologne, Inst Phys 1, Zulpicher Str 77, D-50937 Cologne, Germany
[4] Charles Univ Prague, Fac Math & Phys, V Holesovickach 2, CZ-18000 Prague, Czech Republic
[5] Cardiff Univ, Sch Phys & Astron, Cardiff CF24 3AAQ, S Glam, Wales
基金
欧洲研究理事会; 英国科学技术设施理事会;
关键词
gravitation; hydrodynamics; radiative transfer; ISM: evolution; galaxies: ISM; A NUMERICAL CODE; N-BODY; STAR-FORMATION; MOLECULAR CLOUDS; INTERSTELLAR-MEDIUM; RESOLUTION CODE; PARTICLE-MESH; SILCC PROJECT; IMPLEMENTATION; COLLISIONLESS;
D O I
10.1093/mnras/sty015
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
We describe an OctTree algorithm for the MPI parallel, adaptive mesh refinement code FLASH, which can be used to calculate the gas self-gravity, and also the angle-averaged local optical depth, for treating ambient diffuse radiation. The algorithm communicates to the different processors only those parts of the tree that are needed to perform the tree-walk locally. The advantage of this approach is a relatively low memory requirement, important in particular for the optical depth calculation, which needs to process information from many different directions. This feature also enables a general tree-based radiation transport algorithm that will be described in a subsequent paper, and delivers excellent scaling up to at least 1500 cores. Boundary conditions for gravity can be either isolated or periodic, and they can be specified in each direction independently, using a newly developed generalization of the Ewald method. The gravity calculation can be accelerated with the adaptive block update technique by partially re-using the solution from the previous time-step. Comparison with the FLASH internal multigrid gravity solver shows that tree-based methods provide a competitive alternative, particularly for problems with isolated or mixed boundary conditions. We evaluate several multipole acceptance criteria (MACs) and identify a relatively simple approximate partial error MAC which provides high accuracy at low computational cost. The optical depth estimates are found to agree very well with those of the RADMC-3D radiation transport code, with the tree-solver being much faster. Our algorithm is available in the standard release of the FLASH code in version 4.0 and later.
引用
收藏
页码:3393 / 3418
页数:26
相关论文
共 17 条
  • [1] Tree-based solvers for adaptive mesh refinement code flash - II: radiation transport module TreeRay
    Wuensch, Richard
    Walch, Stefanie
    Dinnbier, Frantisek
    Seifried, Daniel
    Haid, Sebastian
    Klepitko, Andre
    Whitworth, Anthony P.
    Palous, Jan
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2021, 505 (03) : 3730 - 3754
  • [2] Tree-based solvers for adaptive mesh refinement code FLASH - III: a novel scheme for radiation pressure on dust and gas and radiative transfer from diffuse sources
    Klepitko, A.
    Walch, S.
    Wuensch, R.
    Seifried, D.
    Dinnbier, F.
    Haid, S.
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2023, 521 (01) : 160 - 184
  • [3] CPU Ray Tracing of Tree-Based Adaptive Mesh Refinement Data
    Wang, Feng
    Marshak, Nathan
    Usher, Will
    Burstedde, Carsten
    Knoll, Aaron
    Heister, Timo
    Johnson, Chris R.
    COMPUTER GRAPHICS FORUM, 2020, 39 (03) : 1 - 12
  • [4] Tree-based solvers for adaptive mesh refinement code flash - IV. An X-ray radiation scheme to couple discrete and diffuse X-ray emission sources to the thermochemistry of the interstellar medium
    Gaches, Brandt A. L.
    Walch, Stefanie
    Wuensch, Richard
    Mackey, Jonathan
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2023, 522 (03) : 4674 - 4690
  • [5] A new multidimensional adaptive mesh refinement hydro plus gravity cosmological code
    Quilis, V
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2004, 352 (04) : 1426 - 1438
  • [6] The Athena plus plus Adaptive Mesh Refinement Framework: Multigrid Solvers for Self-gravity
    Tomida, Kengo
    Stone, James M.
    ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 2023, 266 (01):
  • [7] A tree-based algorithm for protection/restoration in optical mesh networks
    Shah-Heydari, S
    Yang, O
    CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING 2001, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 1169 - 1174
  • [8] GLAMER - I. A code for gravitational lensing simulations with adaptive mesh refinement
    Metcalf, R. Benton
    Petkova, Margarita
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2014, 445 (02) : 1942 - 1953
  • [9] A Cache-Aware Approach to Adaptive Mesh Refinement in Parallel Stencil-based Solvers
    Saxena, Gaurav
    Jimack, Peter K.
    Walkley, Mark A.
    2017 19TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS (HPCC) / 2017 15TH IEEE INTERNATIONAL CONFERENCE ON SMART CITY (SMARTCITY) / 2017 3RD IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (DSS), 2017, : 364 - 371
  • [10] An adaptive Cartesian mesh flow solver based on the tree-data with anisotropic mesh refinement
    Ogawa, T
    COMPUTATIONAL FLUID DYNAMICS 2002, 2003, : 453 - 458