Numerical relativity simulations of compact binaries: comparison of cell- and vertex-centered adaptive meshes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913390422654976 |
|---|---|
| author | Daszuta, Boris Cook, William Hammond, Peter Fields, Jacob Gutiérrez, Eduardo M. Bernuzzi, Sebastiano Radice, David |
| author_facet | Daszuta, Boris Cook, William Hammond, Peter Fields, Jacob Gutiérrez, Eduardo M. Bernuzzi, Sebastiano Radice, David |
| contents | Given the compact binary evolution problem of numerical relativity, in the finite-difference, block-based, adaptive mesh refinement context, choices must be made on how evolved fields are to be discretized. In GR-Athena++, the space-time solver was previously fixed to be vertex-centered. Here, our recent extensions to a cell-centered treatment, are described. Simplifications in the handling of variables during the treatment of general relativistic magneto-hydrodynamical (GRMHD) evolution are found. A novelty is that performance comparison for the two choices of grid sampling is made within a single code-base. In the case of a binary black hole inspiral-merger problem, by evolving geometric fields on vertex-centers, an average $\sim 20\%$ speed increase is observed, when compared against cell-centered sampling. The opposite occurs in the GRMHD setting. A binary neutron star inspiral-merger-collapse problem, representative of typical production simulations is considered. We find that cell-centered sampling for the space-time solver improves performance, by a similar factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09139 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Numerical relativity simulations of compact binaries: comparison of cell- and vertex-centered adaptive meshes Daszuta, Boris Cook, William Hammond, Peter Fields, Jacob Gutiérrez, Eduardo M. Bernuzzi, Sebastiano Radice, David General Relativity and Quantum Cosmology Computational Physics Given the compact binary evolution problem of numerical relativity, in the finite-difference, block-based, adaptive mesh refinement context, choices must be made on how evolved fields are to be discretized. In GR-Athena++, the space-time solver was previously fixed to be vertex-centered. Here, our recent extensions to a cell-centered treatment, are described. Simplifications in the handling of variables during the treatment of general relativistic magneto-hydrodynamical (GRMHD) evolution are found. A novelty is that performance comparison for the two choices of grid sampling is made within a single code-base. In the case of a binary black hole inspiral-merger problem, by evolving geometric fields on vertex-centers, an average $\sim 20\%$ speed increase is observed, when compared against cell-centered sampling. The opposite occurs in the GRMHD setting. A binary neutron star inspiral-merger-collapse problem, representative of typical production simulations is considered. We find that cell-centered sampling for the space-time solver improves performance, by a similar factor. |
| title | Numerical relativity simulations of compact binaries: comparison of cell- and vertex-centered adaptive meshes |
| topic | General Relativity and Quantum Cosmology Computational Physics |
| url | https://arxiv.org/abs/2406.09139 |