03684nas a2200397 a 4500 20260817161526.0 061027s2006 th uu|m rtt 0| a1eng d .b11997229 AIT Thesis no.ST-06-10 Masood, Zeeshan An adaptive mesh generation for Kriging Element Free Galerkin Method based on delaunay triangulation Pathum Thani, Thailand : Asian Institute of Technology, 2006 107 leaves : ill. Thesis ; no. ST-06-10 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology Thesis (M.Eng.) - Asian Institute of Technology, 2006 This study attempts to propose an adaptive mesh generation for Element Free Galerkin Method (EFGM) using Kriging Interpolation function. Since the Kriging interpolation maintains the Kronecker delta property, the imposition of essential boundary conditions is simple. Using 2D problems, the entire problem domain is subdivided into a network of triangular cells, exploiting nodes as vertices. Through Delaunay Triangulation, a unique pattern of triangular cells can be generated based on any given distribution of nodes. Thus, the size of integration cells in a region can be adapted based on the nodal density in that region. The numbers of integration points in all integration cells are fixed. Based on the requirement to maintain adequate numerical conditioning of the system, the size of Domain of Influence (DOI) and integration cells used in the adaptive EFGM scheme vary according to density of nodes in the domain, the DOI is defined by layers of cells which are in the form of polygons. The advantage of using polygon layered DOI is that the integration points in the same cell are influenced by the same nodes for approximation of the field variable and also prevent the occurrence of the singular matrix which occurs when the number of nodes are less than the number of terms in polynomial basis. For an adaptive procedure, a residual based error estimator, based on Galerkin weighted residual method is proposed in this study. With this local error estimator, new nodes are added to specific locations where errors are excessive than the user specified value. Then, the triangulation process is updated and the newly discretized domain is reanalyzed. The sequence is automatically repeated until a situation is reached where local residual errors in all triangles are controlled to within a specified limit. A number of benchmark examples are presented to verify the efficiency and accuracy of the present method Kriging Triangulation Worsak Kanok-Nukulchai, Chairperson Anwar, Naveed, Examination Committee Amunasinghe, Sunil, Examination committee Asian Institute of Technology Fellowship, Scholarship Donor Asian Institute of Technology. Thesis ; no. ST-06-10 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B10057 .b11997229 mnait u 240405 0 061027 m a u 3 mnait mnarc 22 40 Barcode : 30050120819148 CREATED : 2014-09-04 RECORD # : i12788363 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160100912 CREATED : 2016-04-22 RECORD # : i12950464 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 1612 1612 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT Thesis no.ST-06-10 30050120819148 2026-08-17 16:15:26 3 2026-08-17 22 0 0 0 0 MAIN MAIN mnarc 2026-08-17 0 AIT Thesis no.ST-06-10 30050160100912 2026-08-17 16:15:26 1 2026-08-17 40