Pseudospectral apparent horizon finders: an efficient new algorithm

Gundlach, C. (1998) Pseudospectral apparent horizon finders: an efficient new algorithm Physical Review D, 57, (2), pp. 863-875. (doi:10.1103/PhysRevD.57.863).


Full text not available from this repository.


We review the problem of finding an apparent horizon in Cauchy data (?,gab,Kab) in three space dimensions without symmetries. We describe a family of algorithms which includes the pseudospectral 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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1103/PhysRevD.57.863
ISSNs: 1550-7998 (print)
Related URLs:
ePrint ID: 29178
Date :
Date Event
Date Deposited: 03 Jan 2007
Last Modified: 16 Apr 2017 22:23
Further Information:Google Scholar

Actions (login required)

View Item View Item