ABSTRACT
Previous chapters have described in detail the theory, formulation, procedure, and property of meshfree methods. We now discuss a very practical theme: meshfree methods for adaptive analysis for two-and three-dimensional (2D and 3D) problems. To conduct an adaptive analysis effectively we need to make our codes very efficient and robust for complicated geometries. We therefore need to discuss a few issues related to code implementation. The topics of this chapter are
a. Triangular mesh, integration cells, and mesh automation
b. Node numbering
c. Fast node searching
d. Node search for irregular boundaries
e. Local error estimation
f. Local adaptive refinement
Two meshfree methods will be implemented in our adaptive analysis: EFG and PIMs. For EFG, all items listed above are important, and for PIMs only items (a), (b), (e), and (f) are needed. Our discussion will focus on 2D and extend to 3D at final stage.
