Spectral Methods for Numerical Relativity. The Initial Data Problem
Lawrence E. Kidder, Lee Samuel Finn

TL;DR
This paper explores pseudospectral collocation (PSC) as a highly efficient alternative to finite differencing for solving elliptic equations in numerical relativity, demonstrating exponential convergence and computational advantages.
Contribution
It introduces PSC for solving the Hamiltonian constraint in black hole spacetimes, showing its efficiency and accuracy advantages over traditional finite differencing methods.
Findings
PSC converges exponentially to the exact solution with increasing basis functions
PSC is more efficient in time and memory than finite differencing
No boundary interpolation or special boundary conditions are needed with PSC
Abstract
Numerical relativity has traditionally been pursued via finite differencing. Here we explore pseudospectral collocation (PSC) as an alternative to finite differencing, focusing particularly on the solution of the Hamiltonian constraint (an elliptic partial differential equation) for a black hole spacetime with angular momentum and for a black hole spacetime superposed with gravitational radiation. In PSC, an approximate solution, generally expressed as a sum over a set of orthogonal basis functions (e.g., Chebyshev polynomials), is substituted into the exact system of equations and the residual minimized. For systems with analytic solutions the approximate solutions converge upon the exact solution exponentially as the number of basis functions is increased. Consequently, PSC has a high computational efficiency: for solutions of even modest accuracy we find that PSC is substantially…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
