Stabilization algorithm for the optimal transportation meshfree approximation scheme

Christian Weißenfels

doi:10.1016/j.cma.2017.09.031

Return

Stabilization algorithm for the optimal transportation meshfree approximation scheme

2018-02-01

PRE

Christian Weißenfels *

Peter Wriggers

DOI：10.1016/j.cma.2017.09.031

Original

Original request for help

Save

Abstract

En 中文

Meshfree approximation schemes possess a high potential in computer aided engineering due to their large flexibility. Especially the tremendous progress in processor technology within recent years relativizes the increase in computation time due to the inherent search algorithm. Nevertheless meshfree approximation schemes are still faced with some challenges, like imposition of Dirichlet boundary conditions, robustness of the algorithm and accuracy. The recent developed Optimal Transportation Meshfree (OTM) method seemed to overcome most of these problems. In this paper the OTM solution scheme is combined with a standard search algorithm in order to allow a simple and flexible computation. However this scheme is not stable for some examples of application. Hence an investigation is conducted which shows that the reason for this instability is due to underintegration. Based on this investigation a remedy to stabilize the algorithm is suggested which is based on well known concepts to control the hourglass effects in the Finite Element Method. In contrast to the original publication, the OTM algorithm is derived here from the principle of virtual work. Local maximum entropy shape functions are used which possess a weak Kronecker-delta property. This enables a direct imposition of Dirichlet boundary conditions if the boundary is convex. The limitations of this basis function are also addressed in this paper. Additionally, the search algorithm presented fulfills basic topological requirements. Several examples are investigated demonstrating the improved behavior of the stabilized OTM algorithm. (C) 2017 Elsevier B.V. All rights reserved.

Keywords:

Meshfree methods

Reduced integration

Hourglassing

Galerkin methods

Local maximum entropy approximation functions

Optimal transportation meshfree method

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.