Metraipolis › archive › dc_a367600467a2

Barnes–Hut simulation — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:36:45.281Z
SHA-256 of the archived text
16976f4450eceafb873a6584e2bcc1f67dbdb8a9c390681e3246101233582849
Stable URL of this page
https://metraipolis.com/documento/dc_a367600467a2

How to cite

Barnes–Hut simulation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a367600467a2 (Metraipolis archive dc_a367600467a2, sha256 16976f4450eceafb873a6584e2bcc1f67dbdb8a9c390681e3246101233582849)
BibTeX
@misc{dca367600467a2,
  title = {Barnes–Hut simulation — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a367600467a2; sha256 16976f4450eceafb873a6584e2bcc1f67dbdb8a9c390681e3246101233582849},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Barnes–Hut simulation (named after Joshua Barnes and Piet Hut) is an approximation algorithm for performing an N-body simulation. It is notable for having order O(n log n) compared to a direct-sum algorithm which would be O(n2). The simulation volume is usually divided up into cubic cells via an octree (in a three-dimensional space), so that only particles from nearby cells need to be treated individually, and particles in distant cells can be treated as a single large particle centered at the cell's center of mass (or as a low-order multipole expansion). This can dramatically reduce the number of particle pair interactions that must be computed. Some of the most demanding high-performance computing projects perform computational astrophysics using the Barnes–Hut treecode algorithm, such as DEGIMA.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «high-performance computing»).
Fonte: Wikipedia in inglese, voce «Barnes–Hut simulation» — https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation
Wikidata Q808453 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q808453
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Barnes%E2%80%93Hut_simulation?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1293596740, consultata il 2026-10-05T23:48:46.986Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2c55fcff2de30369a39473126c5fd680805ad87a0f2547366fc8f434f4caded2