×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Revisiting the apparent horizon finding problem with multigrid methods

Click here to flash read.

arXiv:2404.16511v1 Announce Type: cross
Abstract: Apparent horizon plays an important role in numerical relativity as it provides a tool to characterize the existence and properties of black holes on three-dimensional spatial slices in 3+1 numerical spacetimes. Apparent horizon finders based on different techniques have been developed. In this paper, we revisit the apparent horizon finding problem in numerical relativity using multigrid-based algorithms. We formulate the nonlinear elliptic apparent horizon equation as a linear Poisson-type equation with a nonlinear source, and solve it using a multigrid algorithm with Gauss-Seidel line relaxation. A fourth order compact finite difference scheme in spherical coordinates is derived and employed to reduce the complexity of the line relaxation operator to a tri-diagonal matrix inversion. The multigrid-based apparent horizon finder developed in this work is capable of locating apparent horizons in generic spatial hypersurfaces without any symmetries. The finder is tested with both analytic data, such as Brill-Lindquist multiple black hole data, and numerical data, including off-centered Kerr-Schild data and dynamical inspiraling binary black hole data. The obtained results are compared with those generated by the current fastest finder AHFinderDirect (Thornburg, Class. Quantum Grav. 21, 743, 2003), which is the default finder in the open source code Einstein Toolkit. Our finder performs comparatively in terms of accuracy, and starts to outperform AHFinderDirect at high angular resolutions (\sim 1^\circ) in terms of speed. Our finder is also more flexible to initial guess, as opposed to the Newton's method used in AHFinderDirect. This suggests that the multigrid algorithm provides an alternative option for studying apparent horizons, especially when high resolutions are needed.

Click here to read this post out
ID: 823397; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 26, 2024, 7:32 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 6
CC:
No creative common's license
Comments: