含孔区域上求解黑洞初始数据的高阶收敛多重网格方法
High order convergent multigrid methods on domains containing holes for black hole initial data
摘要:
众所周知,多重网格方法对于椭圆方程的解是最佳有效的(O(N)),这意味着努力与解被评估的点的数量成比例)。因此,这是一个理想的方法来解决初始数据/约束方程的广义相对论(例如)黑洞相互作用,或其他强场引力配置。最近的努力已经产生了有限差分多重网格求解器域孔(切除区域)。我们在这里提出的扩展这些概念,以更高的顺序(第四,第六和第八阶)。高阶收敛允许在相对较小的计算网格上快速求解。此外,广义相对论的演化码正在向典型的四阶发展;为了直接证明演化中收敛的正确顺序,数据必须至少与这一阶一样精确地计算。我们的顶点为中心的多重网格代码演示了全球高阶精确的解决方案,椭圆方程域包含孔,在两个空间维度与固定(Dirichlet)的外边界条件,并在三个空间维度与{ \it罗宾}外边界条件。我们证明了一个“现实世界”的三维问题,这是共形平坦的哈密顿约束的广义相对论的解决方案。这种方法的成功取决于:a)孔附近离散化的选择; b)内边界位置的定义,即使在粗网格上也可以解析孔;以及在边界处保持与计算域内部相同的收敛阶。
英文摘要:
It is well known that multigrid methods are optimally efficient for solution of elliptic equations (O(N)), which means that effort is proportional to the number of points at which the solution is evaluated). Thus this is an ideal method to solve the initial data/constraint equations in General Relativity for (for instance) black hole interactions, or for other strong-field gravitational configurations. Recent efforts have produced finite difference multigrid solvers for domains with holes (excised regions). We present here the extension of these concepts to higher order (fourth-, sixth- and eigth-order). The high order convergence allows rapid solution on relatively small computational grids. Also, general relativity evolution codes are moving to typically fourth-order; data have to be computed at least as accurately as this same order for straightfoward demonstration of the proper order of convergence in the evolution. Our vertex-centered multigrid code demonstrates globally high-order-accurate solutions of elliptic equations over domains containing holes, in two spatial dimensions with fixed (Dirichlet) outer boundary conditions, and in three spatial dimensions with {\it Robin} outer boundary conditions. We demonstrate a ``real world'' 3-dimensional problem which is the solution of the conformally flat Hamiltonian constraint of General Relativity. The success of this method depends on: a) the choice of the discretization near the holes; b) the definition of the location of the inner boundary, which allows resolution of the hole even on the coarsest grids; and on maintaining the same order of convergence at the boundaries as in the interior of the computational domain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。