REVIEW 2 cited by
Tree-based solvers for adaptive mesh refinement code FLASH - I: gravity and optical depths
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We describe an OctTree algorithm for the MPI-parallel, adaptive mesh-refinement code {\sc 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 generalisation of the Ewald method. The gravity calculation can be accelerated with the {\em adaptive block update} technique by partially re-using the solution from the previous time-step. Comparison with the {\sc Flash} internal multi-grid 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 APE MAC which provides high accuracy at low computational cost. The optical depth estimates are found to agree very well with those of the {\sc RADMC-3D} radiation transport code, with the tree solver being much faster. Our algorithm is available in the standard release of the {\sc FLASH} code in version 4.0 and later.
Forward citations
Cited by 2 Pith papers
-
A fast spectral-multigrid Poisson solver in non-Cartesian geometries
A spectral-multigrid Poisson solver for spherical and cylindrical coordinates achieves second-order accuracy on uniform and logarithmic radial grids with vacuum boundary handling via screening mass and scales to 4096 cores.
-
Bipolar HII regions Produced by Cloud-Cloud Collisions
Head-on collisions of 500 M⊙ clouds form hub-filament systems and short-lived bipolar HII regions whose appearance depends strongly on viewing angle, with secondary radio and mid-IR metrics that may flag CCC origins.
Discussion (0). Continue with ORCID to comment.