2005
DOI: 10.1016/j.jcp.2005.03.026
|View full text |Cite
|
Sign up to set email alerts
|

Multigrid elliptic equation solver with adaptive mesh refinement

Abstract: In this paper we describe in detail the computational algorithm used by our parallel multigrid elliptic equation solver with adaptive mesh refinement. Our code uses truncation error estimates to adaptively refine the grid as part of the solution process. The presentation includes a discussion of the orders of accuracy that we use for prolongation and restriction operators to ensure second order accurate results and to minimize computational work. Code tests are presented that confirm the overall second order a… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2005
2005
2021
2021

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(39 citation statements)
references
References 26 publications
0
39
0
Order By: Relevance
“…This approach is used to construct the majority of black-hole-binary initial data used in current numerical simulations, and the elliptic solve is performed either with mesh-refinement finite-difference solvers [22] or, in most cases, by an elegant single-domain spectral approach [23], which we will adopt for the work presented here.…”
Section: Background: a Brief Summary Of Wormholes Trumpets And Pmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach is used to construct the majority of black-hole-binary initial data used in current numerical simulations, and the elliptic solve is performed either with mesh-refinement finite-difference solvers [22] or, in most cases, by an elegant single-domain spectral approach [23], which we will adopt for the work presented here.…”
Section: Background: a Brief Summary Of Wormholes Trumpets And Pmentioning
confidence: 99%
“…The conformal-factor ansatz is now provided by replacing the ffiffiffiffiffiffiffiffiffiffiffiffiffiffi ffi 3M=2r p term in (13) with DðÞ= ffiffi ffi r p . In the numerical procedure to solve the Hamiltonian constraint, the derivatives of DðÞ required in the construction ofr 2 c s are trivial to calculate in our Mathematica-based solver, because DðÞ is available from the solution to (22) …”
Section: B Solution Of the Nonlinear Angular-dependence Odementioning
confidence: 99%
“…We will use as a test case a single black hole, given by Bowen-York puncture initial data [12] (as computed by the elliptic solver AMRMG [13]), with unit puncture mass and momentum such that its physical speed should be half the speed of light. We evolve this data with our Hahndol code [9], which uses the usual, conformal BSSN formulation of Einstein's evolution equations on a cellcentered numerical grid, with 4 th -order spatial differencing and 4 th -order Runge-Kutta time-integration.…”
Section: Original 1+log Slicing and Gamma-driver Shift Conditionsmentioning
confidence: 99%
“…The nonsingular function u is calculated by solving the Hamiltonian constraint equation using the second-order-convergent elliptic solver AMRMG [49].…”
Section: Initial Datamentioning
confidence: 99%