Please use this identifier to cite or link to this item:
|Title:||A singular-value decomposition (SVD)-based generalized finite difference (GFD) method for close-interaction moving boundary flow problems||Authors:||Ang, S.J.
Generalized finite difference (GFD)
Hybrid Cartesian meshfree glids
Singular-value decomposition (SVD)
|Issue Date:||2008||Citation:||Ang, S.J., Yeo, K.S., Chew, C.S., Shu, C. (2008). A singular-value decomposition (SVD)-based generalized finite difference (GFD) method for close-interaction moving boundary flow problems. International Journal for Numerical Methods in Engineering 76 (12) : 1892-1929. ScholarBank@NUS Repository. https://doi.org/10.1002/nme.2398||Abstract:||In this paper, we present a study on a singular-value decomposition (SVD)-based generalized finite difference (GFD) method and a nodal selection scheme for moving body/boundary flow problems formulated on a hybrid Cartesian cum meshfree grid system. The present study shows that the SVD-based method is more robust and accurate than the conventional least-squares-based GFD scheme. A nodal selection scheme is also introduced to overcome the problem of numerical instability associated with the clustering of computational nodes. Such nodal clustering occurs dynamically when moving bodies or boundaries approach within close proximity of each other, resulting in the overlap of their meshfree grids. The nodal scheme is applied to close-interaction flow problems as exemplified by the squeezing action of a circular cylinder through a very narrow slot and the close proximity bypass interaction of two oscillating circular cylinders. Copyright © 2008 John Wiley & Sons, Ltd.||Source Title:||International Journal for Numerical Methods in Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/84816||ISSN:||00295981||DOI:||10.1002/nme.2398|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 26, 2020
WEB OF SCIENCETM
checked on Mar 18, 2020
checked on Mar 20, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.