Pseudo-spectral apparent horizon finders: an efficient new algorithm

Details Pseudo-spectral apparent horizon finders: an efficient new algorithm Pseudo-spectral apparent horizon finders: an efficient new algorithm

1997-07-23

arxiv.org/abs/gr-qc/9707050v2

Phys.Rev. D57 (1998) 863-875

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

17 pages, Revtex, 2 figures. Conclusions expanded. Source code to be made public. Accepted for Phys. Rev. D

Scientific paper

10.1103/PhysRevD.57.863

We review the problem of finding an apparent horizon in Cauchy data (Sigma, g_ab, K_ab) in three space dimensions without symmetries. We describe a family of algorithms which includes the pseudo-spectral apparent horizon finder of Nakamura et al. and the curvature flow method proposed by Tod as special cases. We suggest that other algorithms in the family may combine the speed of the former with the robustness of the latter. A numerical implementation for Cauchy data given on a grid in Cartesian coordinates is described, and tested on Brill-Lindquist and Kerr initial data. The new algorithm appears faster and more robust than previous ones.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671731