A quadtree data structure for the coupled finite-element/element-free Galerkin method

Abstract

In the present paper, we derive an efficient data structure for the organization of the nodes in the coupled finite element/element-free Galerkin method. With respect to its implementation, we compare various approaches of recursive spatial discretizations that facilitate most flexible handling of the nodes. The goal of the paper is to refine the implementation issues of the data structure which is fundamental to the element-free Galerkin method and thus to speed-up this otherwise computationally rather expensive meshfree method. Copyright © 2001 John Wiley & Sons, Ltd.