Open Access

ARTICLE

Fast Searching Algorithm for Candidate Satellite-node Set in NLMG

Yufeng Nie¹, Ying Liu², Yuantong Gu³, Xiangkuo Fan¹

1 School of Natural and Applied Sciences, Northwestern Polytechnical University, Xi’an 710072,China, yfnie@nwpu.edu.cn
2 School of Mechatronics, Northwestern Polytechnical University, Xi’an 710072, China, qqingbbao333@163.com
3 School of Engineering System, Queensland University of Technology, Brisbane, Australia, yuantong.gu@qut.edu.au

Computer Modeling in Engineering & Sciences 2009, 45(1), 31-56. https://doi.org/10.3970/cmes.2009.045.031

Abstract

The Node-based Local Mesh Generation (NLMG) algorithm, which is free of mesh inconsistency, is one of core algorithms in the Node-based Local Finite Element Method (NLFEM) to achieve the seamless link between mesh generation and stiffness matrix calculation, and the seamless link helps to improve the parallel efficiency of FEM. Furthermore, the key to ensure the efficiency and reliability of NLMG is to determine the candidate satellite-node set of a central node quickly and accurately. This paper develops a Fast Local Search Method based on Uniform Bucket (FLSMUB) and a Fast Local Search Method based on Multilayer Bucket (FLSMMB), and applies them successfully to the decisive problems, i.e. presenting the candidate satellite-node set of any central node in NLMG algorithm. Using FLSMUB or FLSMMB, the NLMG algorithm becomes a practical tool to reduce the parallel computation cost of FEM. Parallel numerical experiments validate that either FLSMUB or FLSMMB is fast, reliable and efficient for their suitable problems and that they are especially effective for computing the large-scale parallel problems.

---

Keywords

---