Convergent and stable domain integration that is also computationally efficient remains a challenge for Galerkin meshfree methods. High order quadrature can achieve stability and optimal convergence, but it is prohibitively expensive for practical use. On the other hand, low order quadrature consumes much less CPU but can yield non-convergent, unstable solutions. In this work, an accelerated, convergent, and stable nodal integration is developed for the reproducing kernel particle method. A stabilization scheme for nodal integration is proposed based on implicit gradients of the strains at the nodes that offers a computational cost similar to direct nodal integration. The method is also formulated in a variationally consistent manner, so that optimal convergence is achieved. A significant efficiency enhancement over a comparable stable and convergent nodal integration scheme is demonstrated in a complexity analysis and in CPU time studies. A stability analysis is also given, and several examples are provided to demonstrate the effectiveness of the proposed method for both linear and nonlinear problems.
|Original language||English (US)|
|Number of pages||28|
|Journal||International Journal for Numerical Methods in Engineering|
|State||Published - Aug 17 2016|
All Science Journal Classification (ASJC) codes
- Numerical Analysis
- Applied Mathematics