The generalized finite point method

Published in ''Computational Mechanics'' Vol. 44, pp. 173-190, 2009<br />
doi: 10.1007/s00466-009-0363-x
== Abstract ==

In this paper we propose a new mesh-less method based on a sub-domain collocation approach. By reducing the size of the sub-domains the method becomes similar to the well-known finite point method (FPM) and thus it can be regarded as the generalized form of finite point method (GFPM). However, unlike the FPM, the equilibrium equations are weakly satisfied on the sub-domains. It is shown that the accuracy of the results is dependent on the sizes of the sub-domains. To find an optimal size for a sub-domain we propose a patch test procedure in which a set of polynomials of higher order than those chosen for the approximations/interpolations are used as the exact solution and a suitable error norm is minimized through a size tuning procedure. In this paper we have employed the GFPM in elasto-static problems. We give the results of the size optimization in a series of tables for further use. Also the results of the integrations on a generic sub-domain are given as a series of library functions for those who want to use GFPM as a cheap and fast integral-based mesh-less method. The performance of GFPM has been demonstrated by solving several sample problems.

<pdf>Media:Draft_Samper_225858979_3786_Boroomand2009_Article_TheGeneralizedFinitePointMetho.pdf</pdf>