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
机构:Department of Civil Engineering, Robert R. McCormick School of Engineering and Applied Science, Technological Institute, Northwestern University, Evanston, Illinois
LU, YY
;
GU, L
论文数: 0引用数: 0
h-index: 0
机构:Department of Civil Engineering, Robert R. McCormick School of Engineering and Applied Science, Technological Institute, Northwestern University, Evanston, Illinois
机构:Department of Civil Engineering, Robert R. McCormick School of Engineering and Applied Science, Technological Institute, Northwestern University, Evanston, Illinois
LU, YY
;
GU, L
论文数: 0引用数: 0
h-index: 0
机构:Department of Civil Engineering, Robert R. McCormick School of Engineering and Applied Science, Technological Institute, Northwestern University, Evanston, Illinois