Efficient algorithms and data structures for element-free Galerkin method

Author

Parreira, Guilherme F. ; Fonseca, Alexandre R. ; Lisboa, Adriano C. ; Silva, Elson J. ; Mesquita, Renato C.

Author_Institution

Universidade Federal de Minas Gerais

Volume

42

Issue

4

fYear

2006

fDate

4/1/2006 12:00:00 AM

Firstpage

659

Lastpage

662

Abstract

The element-free Galerkin method (EFG) has specific characteristics that require the usage of techniques and data structures in order to provide efficient calculation. This paper address two problems concerning the EFG implementation. The point location problem, which must find in which subdomain the integration point is located, and the influence domain problem, which must find the nearest nodes to build an influence domain and construct the shape functions. This work proposes the use of new data structures and algorithms in order to solve these problems, speeding up the method and providing a fast and correct influence domain construction

Keywords

Galerkin method; data structures; finite element analysis; data structures; efficient algorithms; element-free Galerkin method; influence domain construction; integration point; kd-tree; point location problem; shape function construct; trapezoidal map; Data structures; Electromagnetics; Finite element methods; Gaussian processes; Geometry; Least squares methods; Material properties; Mesh generation; Moment methods; Shape; Data structures; element-free Galerkin; kd-tree; meshless; trapezoidal map;

fLanguage

English

Journal_Title

Magnetics, IEEE Transactions on

Publisher

ieee

ISSN

0018-9464

Type

jour

DOI

10.1109/TMAG.2006.871432

Filename

1608292