Please use this identifier to cite or link to this item:
|Title:||A node-based smoothed point interpolation method (NS-PIM) for three-dimensional heat transfer problems|
Point interpolation method
Three-dimensional heat transfer
|Citation:||Wu, S.C., Liu, G.R., Zhang, H.O., Xu, X., Li, Z.R. (2009-07). A node-based smoothed point interpolation method (NS-PIM) for three-dimensional heat transfer problems. International Journal of Thermal Sciences 48 (7) : 1367-1376. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ijthermalsci.2008.10.010|
|Abstract:||A node-based smoothed point interpolation method (NS-PIM) is formulated for three-dimensional (3D) heat transfer problems with complex geometries and complicated boundary conditions. Shape functions constructed here through PIM possess the delta function property and hence allow the straightforward enforcement of essential boundary conditions. The smoothed Galerkin weak form is employed to create discretized system equations, and the node-based smoothing domains are used to perform the smoothing operation and the numerical integration. The accuracy and efficiency of the NS-PIM solutions are studied through detailed analyses of actual 3D heat transfer problems. It is found that the NS-PIM can provide higher accuracy in temperature and its gradient than the reference approach does, in which very fine meshes are used in standard FEM code available with homogeneous essential boundary conditions. More importantly, the upper bound property of the NS-PIM is obtained using the same tetrahedral mesh. Together with the FEM, we now have a simple means to obtain both upper and lower bounds of the exact solution to heat transfer using the same type of mesh. Crown Copyright © 2008.|
|Source Title:||International Journal of Thermal Sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 17, 2018
WEB OF SCIENCETM
checked on Jul 9, 2018
checked on Jun 30, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.