A Multiple-Grid-Patch Evolution Scheme for 3-D Black Hole Excision

Astronomy and Astrophysics – Astrophysics – General Relativity and Quantum Cosmology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

LaTeX, 2 pages including 1 postscript figure; uses World Scientific style file ws-p9-75x6-50.cls (enclosed); to appear in Proc

Scientific paper

When using black hole excision to numerically evolve a fully generic black hole spacetime, most 3-D 3+1 codes use an $xyz$-topology (spatial) grid. In such a grid, an $r = \constant$ excision surface must be approximated by an irregular and non-smooth "staircase-shaped" excision grid boundary, which may introduce numerical instabilities into the evolution. In this paper I describe an alternate scheme, which uses multiple grid patches, each with topology $\{r \times ({\rm angular coordinates})\}$, to cover the slice outside the $r = \constant$ excision surface. The excision grid boundary is now smooth, so the evolution should be less prone to instabilities. With 4th order finite differencing, this code evolves Kerr initial data to ${\sim} 60M$ using the ADM equations; I'm currently implementing the BSSN equations in it in the hope that this will improve the stability.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Multiple-Grid-Patch Evolution Scheme for 3-D Black Hole Excision does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Multiple-Grid-Patch Evolution Scheme for 3-D Black Hole Excision, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Multiple-Grid-Patch Evolution Scheme for 3-D Black Hole Excision will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-70050

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.