.png){kind=icon}
返回
A node-centered local refinement algorithm for Poisson's equation in complex geometries
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2004.04.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 adaptive 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. Published by Elsevier Inc.
Keyword:
finite difference methods
Poisson equation
adaptive mesh refinement
Cartesian grid methods
multigrid methods
Shortley-Weller
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容