Efficient algorithms and data structures for element-free Galerkin method

被引:12
作者
Parreira, GF [1 ]
Fonseca, AR
Lisboa, AC
Silva, EJ
Mesquita, RC
机构
[1] Univ Fed Minas Gerais, Programa Posgrad Engn Eletr, Belo Horizonte, MG, Brazil
[2] Univ Fed Minas Gerais, Dept Engn Eletr, Belo Horizonte, MG, Brazil
关键词
data structures; element-free Galerkin; kd-tree; meshless; trapezoidal map;
D O I
10.1109/TMAG.2006.871432
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
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.
引用
收藏
页码:659 / 662
页数:4
相关论文
共 7 条
[1]
[Anonymous], 2000, Geometry, Spinors and Applications
[2]
ELEMENT-FREE GALERKIN METHODS [J].
BELYTSCHKO, T ;
LU, YY ;
GU, L .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1994, 37 (02) :229-256
[3]
MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[4]
Element-free Galerkin method for electromagnetic field computations [J].
Clingoski, V ;
Miyamoto, N ;
Yamashita, H .
IEEE TRANSACTIONS ON MAGNETICS, 1998, 34 (05) :3236-3239
[5]
Treatment of material discontinuity in the Element-Free Galerkin method [J].
Cordes, LW ;
Moran, B .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 1996, 139 (1-4) :75-89
[6]
An introduction to programming the meshless Element Free Galerkin method [J].
Dolbow, J ;
Belytschko, T .
ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 1998, 5 (03) :207-241
[7]
LANCASTER P, 1981, MATH COMPUT, V37, P141, DOI 10.1090/S0025-5718-1981-0616367-1