The DOI matches its Crossref record.
A simple multigrid scheme for solving the Poisson equation with arbitrary domain boundaries
Open accessAbstract
We present a new multigrid scheme for solving the Poisson equation with Dirichlet boundary conditions on a Cartesian grid with irregular domain boundaries. This scheme was developed in the context of the Adaptive Mesh Refinement (AMR) schemes based on a graded-octree data structure. The Poisson equation is solved on a level-by-level basis, using a ''one-way interface'' scheme in which boundary conditions are interpolated from the previous coarser level solution. Such a scheme is particularly well suited for self-gravitating astrophysical flows requiring an adaptive time stepping strategy. By constructing a multigrid hierarchy covering the active cells of each AMR level, we have designed a memory-efficient algorithm that can benefit fully from the multigrid acceleration. We present a simple method for capturing the boundary conditions across the multigrid hierarchy, based on a second-order accurate reconstruction of the boundaries of the multigrid levels. In case of very complex boundaries, small scale features become smaller than the discretization cell size of coarse multigrid levels and convergence problems arise. We propose a simple solution to address these issues. Using our scheme, the convergence rate usually depends on the grid size for complex grids, but good linear convergence is maintained. The proposed method was successfully implemented on distributed memory architectures in the RAMSES code, for which we present and discuss convergence and accuracy properties as well as timing performances.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Dark matter cores all the way down
Read, J. I., Agertz, O., & Collins, M. L. M. (2016) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stw713 · Cited by 318
Rosdahl, J., Katz, H., Blaizot, J., Kimm, T., Michel-Dansac, L., Garel, T., Haehnelt, M., Ocvirk, P., & Teyssier, R. (2018) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/sty1655 · Cited by 277
Self-citationPuchwein, E., Baldi, M., & Springel, V. (2013) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stt1575 · Cited by 182
Metadata
- Authors
- Guillet, T., & Teyssier, R.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2011-06
- Volume
- 230
- Issue
- 12
- Pages
- 4756-4771
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2161689241
- Cited by
- 179
- References
- 0
- FWCI
- 6.45
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.