A fast apparent horizon algorithm

Details A fast apparent horizon algorithm A fast apparent horizon algorithm

2002-06-02

arxiv.org/abs/gr-qc/0206003v1

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

9 pages, 7 figures

Scientific paper

I present a fast algorithm to find apparent horizons. This algorithm uses an explicit representation of the horizon surface, allowing for arbitrary horizon resolutions and, in principle, shapes. Novel in this approach is that the tensor quantities describing the horizon live directly on the horizon surface, yet are represented using Cartesian coordinate components. This eliminates coordinate singularities, and leads to an efficient implementation. The apparent horizon equation is then solved as a nonlinear elliptic equation with standard methods. I explain in detail the coordinate systems used to store and represent the tensor components of the intermediate quantities, and describe the grid boundary conditions and the treatment of the polar coordinate singularities. Last I give as examples apparent horizons for single and multiple black hole configurations.

Affiliated with

Also associated with

No associations

Rating

A fast apparent horizon algorithm 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 fast apparent horizon algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast apparent horizon algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693128