×

zbMATH — the first resource for mathematics

Aspects of the use of orthogonal basis functions in the element-free Galerkin method. (English) Zbl 1183.74376
Summary: The element-free Galerkin (EFG) method is probably the most widely used meshless method at present. In the EFG method, shape functions are derived from a moving least-squares approximation using a polynomial basis, a calculation involving the inversion of a small matrix. A new implementation of the EFG method was published soon after the original where an alternative approach using an orthogonal basis was proposed to avoid matrix inversion in the formulation of the shape functions. In this paper we revisit this topic and show that the difficulties associated with the use of a polynomial basis remain present in the orthogonal case. We also show that certain terms in the derivative expressions are omitted in the new implementation of the EFG, which can lead to errors. Finally, we propose a new approach that avoids inversion while maintaining accuracy.

MSC:
74S30 Other numerical methods in solid mechanics (MSC2010)
74K10 Rods (beams, columns, shafts, arches, rings, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Belytschko, Meshless methods: an overview and recent developments, Computer Methods in Applied Mechanics and Engineering 139 pp 3– (1996) · Zbl 0891.73075
[2] Fries TP, Matthies HG. Classification and overview of meshfree methods. Technical Report 2003-3, Technical University Braunschweig, Brunswick, Germany, 2004.
[3] Nguyen, Meshless methods: a review and computer implementation aspects, Mathematics and Computers in Simulation 79 (3) pp 763– (2008) · Zbl 1152.74055
[4] Belytschko, Element-free Galerkin methods, International Journal for Numerical Methods in Engineering 37 pp 229– (1994) · Zbl 0796.73077
[5] Atluri, A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics, Computational Mechanics 22 pp 117– (1998) · Zbl 0932.76067
[6] Liu, Meshfree Methods: Moving Beyond the Finite Element Method (2003)
[7] Deeks, A hybrid meshless local Petrov-Galerkin method for unbounded domains, Computer Methods in Applied Mechanics and Engineering 196 (4-6) pp 843– (2007) · Zbl 1121.74471
[8] Fernandez-Mendez, Imposing essential boundary conditions in mesh-free methods, Computer Methods in Applied Mechanics and Engineering 193 pp 1257– (2004)
[9] Augarde, On the effects of nodal distributions for imposition of essential boundary conditions in the MLPG meshfree method, Communications in Numerical Methods in Engineering 21 pp 389– (2005) · Zbl 1073.65140
[10] Krongauz, Enforcement of essential boundary conditions in meshless approximations using finite elements, Computer Methods in Applied Mechanics and Engineering 131 pp 133– (1996) · Zbl 0881.65098
[11] Lu, A new implementation of the element free Galerkin method, Computer Methods in Applied Mechanics and Engineering 113 pp 397– (1994) · Zbl 0847.73064
[12] Fleming, Enriched element-free Galerkin methods for crack tip fields, International Journal for Numerical Methods in Engineering 40 pp 1483– (1997)
[13] Krysl, Analysis of thin plates by the element-free Galerkin method, Computational Mechanics 17 pp 26– (1996) · Zbl 0929.74126
[14] Fries, Convergence and stabilization of stress-point integration in mesh-free and particle methods, International Journal for Numerical Methods in Engineering 74 (7) pp 1067– (2008) · Zbl 1158.74525
[15] Belytschko, Element-free Galerkin methods for static and dynamic fracture, International Journal for Numerical Methods in Engineering 32 pp 2547– (1995) · Zbl 0918.73268
[16] Nayroles, The diffuse element method, Comptes Rendus de L’Academie des Sciences, Serie II 313 pp 133– (1991)
[17] Timoshenko, Theory of Elasticity (1970)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.