Premium
A quadtree data structure for the coupled finite‐element/element‐free Galerkin method
Author(s) -
Karutz H.,
Kraetzig W. B.
Publication year - 2001
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.280
Subject(s) - finite element method , galerkin method , quadtree , element (criminal law) , discontinuous galerkin method , computer science , mathematics , mixed finite element method , data structure , extended finite element method , smoothed finite element method , algorithm , computational science , mathematical optimization , boundary knot method , structural engineering , engineering , law , political science , programming language , boundary element method
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.