본문 바로가기 주메뉴 바로가기
검색 검색영역닫기 검색 검색영역닫기 ENGLISH 메뉴 전체보기 메뉴 전체보기

논문

Comparison of eigenvalue ratio in the artificial boundary perturbation and Jacobi preconditioning for solving a Poisson equation

https://doi.org/10.1016/j.jcp.2017.08.013

  • 저자Gangjoon Yoon; Chohong Min
  • 학술지Journal of Computational Physics 349
  • 등재유형
  • 게재일자(2017)

The Shortley–Weller method is a standard finite difference method for solving the Poisson equation with Dirichlet boundary condition. Unless the domain is rectangular, the method meets an inevitable problem that some of the neighboring nodes may be outside the domain. In this case, an usual treatment is to extrapolate the function values at outside nodes by quadratic polynomial. The extrapolation may become unstable in the sense that some of the extrapolation coefficients increase rapidly when the grid nodes are getting closer to the boundary. A practical remedy, which we call artificial perturbation, is to treat grid nodes very near the boundary as boundary points. The aim of this paper is to reveal the adverse effects of the artificial perturbation on solving the linear system and the convergence of the solution. We show that the matrix is nearly symmetric so that the ratio of its minimum and maximum eigenvalues is an important factor in solving the linear system. Our analysis shows that the artificial perturbation results in a small enhancement of the eigenvalue ratio from O(1/(h⋅hmin) to O(h−3) and triggers an oscillatory order of convergence. Instead, we suggest using Jacobi or ILU-type preconditioner on the matrix without applying the artificial perturbation. According to our analysis, the preconditioning not only reduces the eigenvalue ratio from O(1/(h⋅hmin) to O(h−2), but also keeps the sharp second order convergence.

The Shortley–Weller method is a standard finite difference method for solving the Poisson equation with Dirichlet boundary condition. Unless the domain is rectangular, the method meets an inevitable problem that some of the neighboring nodes may be outside the domain. In this case, an usual treatment is to extrapolate the function values at outside nodes by quadratic polynomial. The extrapolation may become unstable in the sense that some of the extrapolation coefficients increase rapidly when the grid nodes are getting closer to the boundary. A practical remedy, which we call artificial perturbation, is to treat grid nodes very near the boundary as boundary points. The aim of this paper is to reveal the adverse effects of the artificial perturbation on solving the linear system and the convergence of the solution. We show that the matrix is nearly symmetric so that the ratio of its minimum and maximum eigenvalues is an important factor in solving the linear system. Our analysis shows that the artificial perturbation results in a small enhancement of the eigenvalue ratio from O(1/(h⋅hmin) to O(h−3) and triggers an oscillatory order of convergence. Instead, we suggest using Jacobi or ILU-type preconditioner on the matrix without applying the artificial perturbation. According to our analysis, the preconditioning not only reduces the eigenvalue ratio from O(1/(h⋅hmin) to O(h−2), but also keeps the sharp second order convergence.

이 페이지에서 제공하는 정보에 대해 만족하십니까?