Efficient implementation of Galerkin meshfree methods for large-scale problems with an emphasis on maximum entropy approximants

•We propose a simple method to implement matrix assembly in Galerkin meshfree methods.•By looping over groups of quadrature points, performance is significantly improved.•We propose a method to efficiently store the maximum entropy basis functions.•It stores partial information, at the expense of a...

Ausführliche Beschreibung