A Numerical approach to binary black hole coalescence
Mar, 199620 pages
Part of General relativity and gravitation. Proceedings, 14th International Conference, Florence, Italy, August 6-12, 1995, 147-166
Contribution to:
e-Print:
- gr-qc/9603004 [gr-qc]
View in:
Citations per year
Abstract: (arXiv)
The nature of binary black hole coalescence is the final, uncharted frontier of the relativistic Kepler problem. In the United States, binary black hole coalescence has been identified as a computational ``Grand Challenge'' whose solution is the object of a coordinated effort, just reaching its half-way point, by more than two-score researchers at nearly a dozen institutions. In this report I highlight what I see as the most serious problems standing between us and a general computational solution to the problem of binary black hole coalescence: * the computational burden associated of the problem based on reasonable extrapolations of present-day computing algorithms and near-term hardware developments; * some of the computational issues associated with those estimates, and how, through the use of different or more sophisticated computational algorithms we might reduce the expected burden; and * some of the physical problems associated with the development of a numerical solution of the field equations for a binary black hole system, with particular attention to work going on in, or in association with, the Grand Challenge.Note:
- 20 pages (including two figures) LaTeX w/amssymb, amsbsy, epsf and sprocl (available from http://www.wspc.co.uk/wspc/index.html) macro packages. A written version of the plenary lecture by the same name delivered at GR14. To appear in proceedings of the GR14 conference
References(16)
Figures(2)