A node-centered local refinement algorithm for Poisson's equation in complex geometries

42Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a method for solving Poisson's equation with Dirichlet boundary conditions on an irregular bounded three-dimensional region. The method uses a nodal-point discretization and adaptiv mesh refinement (AMR) on Cartesian grids, and the AMR multigrid solver of Almgren. The discrete Laplacian operator at internal boundaries comes from either linear or quadratic (Shortley-Weller) extrapolation, and the two methods are compared. It is shown that either way, solution error is second order in the mesh spacing. Error in the gradient of the solution is first order with linear extrapolation, but second order with Shortley-Weller. Examples are given with comparison with the exact solution. The method is also applied to a heavy-ion fusion accelerator problem, showing the advantage of adaptivity.

Cite

CITATION STYLE

APA

McCorquodale, P., Colella, P., Grote, D. P., & Vay, J. L. (2004). A node-centered local refinement algorithm for Poisson’s equation in complex geometries. Journal of Computational Physics, 201(1), 34–60. https://doi.org/10.1016/j.jcp.2004.04.022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free