Please use this identifier to cite or link to this item:
|Title:||A matrix triangularization algorithm for the polynomial point interpolation method|
|Authors:||Liu, G.R. |
|Source:||Liu, G.R., Gu, Y.T. (2003-05-09). A matrix triangularization algorithm for the polynomial point interpolation method. Computer Methods in Applied Mechanics and Engineering 192 (19) : 2269-2295. ScholarBank@NUS Repository. https://doi.org/10.1016/S0045-7825(03)00266-4|
|Abstract:||A novel matrix triangularization algorithm (MTA) is proposed to overcome the singularity problem in the point interpolation method (PIM) using the polynomial basis, and to ensure stable and reliable construction of PIM shape functions. The present algorithm is validated using several examples, and implemented in the local point interpolation method (LPIM) that is a truly meshfree method based on a local weak form. Numerical examples demonstrate that LPIM using the present MTA are very easy to implement, and very robust for solving problems of computational mechanics. It is shown that PIM with the present MTA is very effective in constructing shape functions. Most importantly, PIM shape functions possess Kronecker delta function properties. Parameters that influence the performance of them are studied in detail. The convergence and efficiency of them are thoroughly investigated. © 2003 Elsevier Science B.V. All rights reserved.|
|Source Title:||Computer Methods in Applied Mechanics and Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 22, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.