Conforming window functions for meshfree methods

摘要

Window functions provide a base for the construction of approximation functions in many meshfree methods. They control the smoothness and extent of the approximation functions and are commonly defined using Euclidean distances which helps eliminate the need for a meshed discretization, simplifying model development for some classes of problems. However, for problems with complicated geometries such as nonconvex or multi-body domains, poor solution accuracy and convergence can occur unless the extents of the window functions, and thus approximation functions, are carefully controlled, often a time consuming or intractable task. In this paper, we present a method to provide more control in window function design, allowing efficient and systematic handling of complex geometries. "Conforming" window functions are constructed using Bernstein-Bezier splines defined on local triangulations with constraints imposed to control smoothness. Graph distances are used in conjunction with Euclidean metrics to provide adequate information for shaping the window functions. The conforming window functions are demonstrated using the Reproducing Kernel Particle Method showing improved accuracy and convergence rates for problems with challenging geometries. Conforming window functions are also demonstrated as a means to simplify the imposition of essential boundary conditions. (C) 2019 Elsevier B.V. All rights reserved.