adaptive refinement tree
(ART)
(algorithm-type for solving n-body problem)
Adaptive refinement tree is a computational
method for solving the N-body problem,
specifically for cosmological simulations.
It uses a cubic grid meshed structure,
with adaptive mesh refinement (AMR) and multilevel relaxation.
It is suitable for parallel computing.
ART, for Adaptive Refinement Tree,
is also the name of a code from 1997 that uses the method.
(algorithm,technique)
Further reading:
https://ui.adsabs.harvard.edu/abs/1997ApJS..111...73K/abstract
http://www.cs.iit.edu/~lan/publications/cluster2011.pdf
http://www.cs.iit.edu/~lan/petaart.html
http://datasys.cs.iit.edu/events/GCASR13/docs/poster110.pdf
https://www.sc13.supercomputing.org/sites/default/files/PostersArchive/tech_posters/post227s2-file2.pdf
Referenced by page:
N-body simulation
Index