Searching algorithm for initial exploring circle radius in NLMG
  Revised:June 02, 2006
View Full Text  View/Add Comment  Download reader
DOI:10.7511/jslx20082037
KeyWord:Satellite node,Local Mesh Generation,Uniform Bucket,local search,Node-Based Local Finite Element Method,seamless connection
FAN Xiang-kuo  NIE Yu-feng  CHANG Sheng
Hits: 1608
Download times: 11
Abstract:
      Node-based Local Mesh Generation(NLMG) algorithm that is free of grid inconsistency is one of core algorithms in the Node-based Local Finite Element Method(NLFEM) to achieve the seamless connection between mesh generation and stiffness matrix computing.Besides,evaluating the radius of initial exploring circle of each current central node quickly and reasonably is a decisive step to reduce the computing cost and to ensure the reliability of the NLMG algorithm.This paper develops the Uniform Bucket-based Fast Local Search Method(UBFLSM) used in NLMG algorithm,and then applies it successfully to find the appropriate initial exploring circle radius and to prepare the candidate nodes set as well.Comparing with the other two methods such as the Global search method and the Uniform Bucket-based Local Search Method,the UBFLSM save computing cost remarkably.About the optimal bucket density,the paper advises to make the number of uniform buckets to be about half of the number of the nodes used in the solving domain for the two dimensional problem.Both parallel and sequential numerical experiment results,given in Tab.1 and 2 and Fig.5 through 7 in the full paper,show that UBFLSM can be implemented in NLMG algorithms effectively and reliably.