Please use this identifier to cite or link to this item:
|Title:||Development of irregular-grid finite difference method (IFDM) for governing equations in strong form|
Gradient smoothing domain
|Source:||Xu, G.,Liu, G.R. (2006-10). Development of irregular-grid finite difference method (IFDM) for governing equations in strong form. WSEAS Transactions on Mathematics 5 (10) : 1117-1122. ScholarBank@NUS Repository.|
|Abstract:||In this paper, an irregular-grid finite difference method (IFDM) with the use of Green-Gauss theorem was developed to numerically deal with problems subject to arbitrary geometrical boundaries. The focus is to elucidate the principle of IFDM and the numerical procedure to solve partial differential equations. Attention is paid to the discretization of spatial terms in partial differential format. Totally six types of discretization schemes are proposed and assessed from points of views of efficiency and accuracy. Theoretical analyses are conducted with regard to the compactness of stencil and positivity of the coefficients of supporting nodes. Upon the analyses, two schemes, II and VI, are selected for further study. Scheme II is based on one-point quadrature rule while scheme VI corresponds to 2-point quadrature rule. Numerical excises by using the two schemes are carried out to predict the solutions in a square domain that is governed by a Poisson equation. The effects of irregularity of grids are also studied. Numerical results indicate that the both schemes give satisfactory prediction. In addition, the scheme VI gives better accuracy, especially on irregular grids, but at slightly higher cost in computation. Efforts here demonstrate that the proposed IFDM method is good to be used in numerical simulations with arbitrarily geometrical bounds.|
|Source Title:||WSEAS Transactions on Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.