2011
DOI: 10.1103/physrevd.83.044045
|View full text |Cite
|
Sign up to set email alerts
|

High accuracy binary black hole simulations with an extended wave zone

Abstract: We present results from a new code for binary black hole evolutions using the moving-puncture approach, implementing finite differences in generalised coordinates, and allowing the spacetime to be covered with multiple communicating non-singular coordinate patches. Here we consider a regular Cartesian near zone, with adapted spherical grids covering the wave zone. The efficiencies resulting from the use of adapted coordinates allow us to maintain sufficient grid resolution to an artificial outer boundary locat… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
185
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 152 publications
(188 citation statements)
references
References 98 publications
2
185
0
Order By: Relevance
“…Some previous comparisons of CCE and extrapolation have been done using binary black hole simulations performed with the finite-difference code Llama [47]. In Refs.…”
Section: Arxiv:13093605v1 [Gr-qc] 13 Sep 2013mentioning
confidence: 99%
“…Some previous comparisons of CCE and extrapolation have been done using binary black hole simulations performed with the finite-difference code Llama [47]. In Refs.…”
Section: Arxiv:13093605v1 [Gr-qc] 13 Sep 2013mentioning
confidence: 99%
“…We distinguish between two different grid setups. For the first setup, we substitute the outermost level (l = 0) by a multipatch cubed-sphere grid [45,[54][55][56]] on which we do not solve the GRHD equations. The spheres allow us to apply constraint preserving boundary conditions [57].…”
Section: B Evolutionsmentioning
confidence: 99%
“…The implemented code is designed such that it can run concurrently with our 3+1 evolution code Llama [31,32]. This is important for future application in onthe-fly Cauchy-characteristic extraction, where the metric data will be transported to J + during Cauchy evolution without the need of an additional post-processing step (which is currently the case for the algorithm presented in [2,3]).…”
Section: Remarks On the Computational Implementationmentioning
confidence: 99%