A posteriori error estimates and adaptive procedures for the meshless Galerkin boundary node method for 3D potential problems

The Galerkin boundary node method (GBNM) is a boundary only meshless method that combines variational formulations of boundary integral equations with the moving least-squares approximations. This paper presents the mathematical derivation of a posteriori error estimates and adaptive refinement procedures for the GBNM for 3D potential problems. Two types of error estimators are developed in detail. One is a perturbation error estimator that is formulated based on the difference between numerical solutions obtained using two successive nodal arrangements. The other is a projection error estimator that is formulated based on the difference between the GBNM solution itself and its L²-orthogonal projection. The reliability and efficiency of both types of error estimators is established. That is, these error estimators are proven to have an upper and a lower bound by the constant multiples of the exact error in the energy norm. A localization technique is introduced to accommodate the non-local property of integral operators for the needed local and computable a posteriori error indicators. Convergence analysis results of corresponding adaptive meshless procedures are also given. Numerical examples with high singularities illustrate the theoretical results and show that the proposed adaptive procedures are simple, effective and efficient.     

Meshless analysis of two-dimensional Stokes flows with the Galerkin boundary node method

In this paper, the Galerkin boundary node method (GBNM) is developed for the solution of stationary Stokes problems in two dimensions. The GBNM is a boundary only meshless method that combines a variational form of boundary integral formulations for governing equations with the moving least-squares (MLS) approximations for construction of the trial and test functions. Boundary conditions in this approach are included into the variational form, thus they can be applied directly and easily despite the MLS shape functions lack the property of a delta function. Besides, the GBNM keeps the symmetry and positive definiteness of the variational problems. Convergence analysis results of both the velocity and the pressure are given. Some selected numerical tests are also presented to demonstrate the efficiency of the method.     

The meshless Galerkin boundary node method for Stokes problems in three dimensions

The Galerkin boundary node method (GBNM) is a boundary only meshless method that combines an equivalent variational formulation of boundary integral equations for governing equations and the moving least‐squares (MLS) approximations for generating the trial and test functions. In this approach, boundary conditions can be implemented directly and easily despite of the fact that the MLS shape functions lack the delta function property. Besides, the resulting formulation inherits the symmetry and positive definiteness of the variational problems. The GBNM is developed in this paper for solving three‐dimensional stationary incompressible Stokes flows in primitive variables. The numerical scheme is based on variational formulations for the first‐kind integral equations, which are valid for both interior and exterior problems simultaneously. A rigorous error analysis and convergence study of the method for both the velocity and the pressure is presented in Sobolev spaces. The capability of the method is also illustrated and assessed through some selected numerical examples. Copyright © 2011 John Wiley & Sons, Ltd.     

Development of a meshless hybrid boundary node method for Stokes flows

The meshless hybrid boundary node method (HBNM) is a promising method for solving boundary value problems, and is further developed and numerically implemented for incompressible 2D and 3D Stokes flows in this paper. In this approach, a new modified variational formulation using a hybrid functional is presented. The formulation is expressed in terms of domain and boundary variables. The moving least-squares (MLS) method is employed to approximate the boundary variables whereas the domain variables are interpolated by the fundamental solutions of Stokes equation, i.e. Stokeslets. The present method only requires scatter nodes on the surface, and is a truly boundary type meshless method as it does not require the ‘boundary element mesh’, either for the purpose of interpolation of the variables or the integration of ‘energy’. Moreover, since the primitive variables, i.e., velocity vector and pressure, are employed in this approach, the problem of finding the velocity is separated from that of finding pressure. Numerical examples are given to illustrate the implementation and performance of the present method. It is shown that the high convergence rates and accuracy can be achieved with a small number of nodes.     

A new method for meshless integration in 2D and 3D Galerkin meshfree methods

A method for the evaluation of regular domain integrals without domain discretization is presented. In this method, a domain integral is transformed into a boundary integral and a 1D integral. The method is then utilized for the evaluation of domain integrals in meshless methods based on the weak form, such as the element-free Galerkin method and the meshless radial point interpolation method. The proposed technique results in truly meshless methods with better accuracy and efficiency in comparison with their original forms. Some examples, including linear and large-deformation problems, are also provided to demonstrate the usefulness of the proposed method.     

Virtual boundary meshless least square collocation method for calculation of 2D multi-domain elastic problems

A virtual boundary meshless least square collocation method is developed for calculation of two-dimensional multi-domain elastic problems in this paper. This method is different from the conventional virtual boundary element method (VBEM) since it incorporates the point interpolation method (PIM) with the compactly supported radial basis function (CSRBF) to approximately construct the virtual source function of the VBEM. Consequently, this method has the advantages of boundary-type meshless methods. In addition, it does not have to deal with singular integral and has the symmetric coefficient matrix, and the pre-processing operation is also very simple. This method can be used to analyze multi-domain composite structures with each subdomain having different materials or geometries. Since the configuration of virtual boundary has a certain preparability, the integration along the virtual boundary can be carried out over the smooth simple curve that can be structured beforehand (for 2D problems) to reduce the complicity and difficulty of calculus without loss of accuracy, while “Vertex Question” existing in BEM can be avoided. In the end, several numerical examples are analyzed using the proposed method and some other commonly used methods for verification and comparison purposes. The results show that this method leads to faster convergence and higher accuracy in comparison with the other methods considered in this study.     

The boundary node method for three‐dimensional linear elasticity

The Boundary Node Method (BNM) is developed in this paper for solving three‐dimensional problems in linear elasticity. The BNM represents a coupling between Boundary Integral Equations (BIE) and Moving Least‐Squares (MLS) interpolants. The main idea is to retain the dimensionality advantage of the former and the meshless attribute of the later. This results in decoupling of the ‘mesh’ and the interpolation procedure.For problems in linear elasticity, free rigid‐body modes in traction prescribed problems are typically eliminated by suitably restraining the body. However, an alternative approach developed recently for the Boundary Element Method (BEM) is extended in this work to the BNM. This approach is based on ideas from linear algebra to complete the rank of the singular stiffness matrix. Also, the BNM has been extended in the present work to solve problems with material discontinuities and a new procedure has been developed for obtaining displacements and stresses accurately at internal points close to the boundary of a body. Copyright © 1999 John Wiley & Sons, Ltd.     

A meshless singular boundary method for three‐dimensional elasticity problems

This study documents the first attempt to extend the singular boundary method, a novel meshless boundary collocation method, for the solution of 3D elasticity problems. The singular boundary method involves a coupling between the regularized BEM and the method of fundamental solutions. The main idea here is to fully inherit the dimensionality and stability advantages of the former and the meshless and integration‐free attributes of the later. This makes it particularly attractive for problems in complex geometries and three dimensions. Four benchmark 3D problems in linear elasticity are well studied to demonstrate the feasibility and accuracy of the proposed method. The advantages, disadvantages, and potential applications of the proposed method, as compared with the FEM, BEM, and method of fundamental solutions, are also examined and discussed. Copyright © 2015 John Wiley & Sons, Ltd.     

On coupling of reproducing kernel particle method and boundary element method

In this paper a new coupling method to merge the reproducing kernel particle method (RKPM) and the boundary element method (BEM) is proposed. In this formulation, the whole problem domain will first be divided into two subdomains in which the RKPM and the BEM are applied respectively. A simple and direct coupling procedure is then applied to preserve the compatibility of the solution along the interface of the two subdomains. Unlike other coupling procedures suggested previously, the present coupling procedure neither requires modification of the RKPM and the BEM formulations nor the use of finite elements along the interface boundary between the two subdomains. The validity and efficiency of the coupling procedure are demonstrated by using it to solve five benchmark elastostatic stress analysis problems. In addition, a simple analysis of the a priori convergence rate of the coupling procedure is given. Preliminary assessment of the convergence characteristics of the coupling procedure is done by carrying out uniform refinements on the benchmark problems.     

Heat transfer analysis of composite slabs using meshless element Free Galerkin method

This paper deals with three dimensional heat transfer analysis of composite slabs using meshless element free Galerkin method. The element free Galerkin method (EFG) method utilizes moving least square (MLS) approximants to approximate the unknown function of temperature Tx). These approximants are constructed by using a weight function, a basis function and a set of coefficients that depends on position. Penalty and Lagrange multiplier techniques have been used to enforce the essential boundary conditions. MATLAB codes have been developed to obtain the EFG results. Two new basis functions namely trigonometric and polynomial have been proposed. A comparison has been made among the results obtained using existing (linear) and proposed (trigonometric and polynomial) basis functions for three dimensional heat transfer in composite slabs. The effect of penalty parameter on EFG results has also been discussed. The results obtained by EFG method are compared with those obtained by finite element method     

A node enrichment adaptive refinement in Discrete Least Squares Meshless method for solution of elasticity problems

In this paper, an adaptive refinement procedure is proposed to be used with Discrete Least Squares Meshless (DLSM) method for accurate solution of planar elasticity problems. DLSM method is a newly introduced meshless method based on the least squares concept. The method is based on the minimization of a least squares functional defined as the weighted summation of the squared residual of the governing differential equation and its boundary conditions at nodal points used to discretize the domain and its boundaries. A Moving Least Square (MLS) method is used to construct the shape function making the approach a fully least squares based approach. An error estimate and adaptive refinement strategy is proposed in this paper to increase the efficiency of the DLSM method. For this, a residual based error estimator is introduced and used to discover the region of higher errors. The proposed error estimator has the advantages of being available at the end of each analysis contributing to the efficiency of the proposed method. An enrichment method is then used by adding more nodes to the area of higher errors as indicated by the error estimator. A Voronoi diagram is used to locate the position of the nodes to be added to the current nodal configuration. Efficiency and effectiveness of the proposed procedure is examined by adaptively solving two benchmark problems. The results show the ability of the proposed strategy for accurate simulation of elasticity problems.     

A hybrid radial boundary node method based on radial basis point interpolation

The hybrid boundary node method (HBNM) retains the meshless attribute of the moving least squares (MLS) approximation and the reduced dimensionality advantages of the boundary element method. However, the HBNM inherits the deficiency of the MLS approximation, in which shape functions lack the delta function property. Thus in the HBNM, boundary conditions are implemented after they are transformed into their approximations on the boundary nodes with the MLS scheme.This paper combines the hybrid displacement variational formulation and the radial basis point interpolation to develop a direct boundary-type meshless method, the hybrid radial boundary node method (HRBNM) for two-dimensional potential problems. The HRBNM is truly meshless, i.e. absolutely no elements are required either for interpolation or for integration. The radial basis point interpolation is used to construct shape functions with delta function property. So unlike the HBNM, the HRBNM is a direct numerical method in which the basic unknown quantity is the real solution of nodal variables, and boundary conditions can be applied directly and easily, which leads to greater computational precision. Some selected numerical tests illustrate the efficiency of the method proposed.     

A boundary element-free method (BEFM) for three-dimensional elasticity problems

This study combines the boundary integral equation (BIE) method and improved moving least-squares (IMLS) approximation to present a direct meshless boundary integral equation method, the boundary element-free method (BEFM) for three-dimensional elasticity. Based on the improved moving least-squares approximation and the boundary integral equation for three-dimensional elasticity, the formulae of the boundary element-free method are given, and the numerical procedure is also shown. Unlike other meshless boundary integral equation methods, the BEFM is a direct numerical method in which the basic unknown quantity is the real solution of the nodal variables, and the boundary conditions can be applied directly and easily, thus giving it a greater computational precision. Three selected numerical examples are presented to demonstrate the method.Aknowledgement The work in this project was fully supported by a grant from the Research Grants Council (RGC) of the Hong Kong Special Administrative Region, China (Project No. CityU 1011/02E).The work that is described in this paper was supported by Project No. CityU 1011/02E, which was awarded by the Research Grants Council of the Hong Kong Special Administrative Region, China. The authors are grateful for the financial support.     

A fast and accurate algorithm for a Galerkin boundary integral method

A fast and accurate algorithm is presented to increase the computational efficiency of a Galerkin boundary integral method for solving two-dimensional elastostatics problems involving numerous straight cracks and circular inhomogeneities. The efficiency is improved by computing the combined influences of groups, or blocks, of elements—with each element being an inclusion, a hole, or a crack—using asymptotic expansions, multiple shifts, and Taylor series expansions. The coefficients in the asymptotic and Taylor series expansions are computed analytically. Implementation of this algorithm involves a single- or multi-level grid, a clustering technique, and a tree data structure. An iterative procedure is adopted to solve the coefficients in the series expansions of boundary unknowns block by block. The elastic fields in each block are calculated by superposition of the direct influences from the nearby elements and the grouped far-field influences from all the other elements. This fast multipole algorithm is considerably more efficient for large-scale practical problems than the conventional approach.     

An automatic adaptive refinement procedure for the reproducing kernel particle method. Part I: Stress recovery and a posteriori error estimation

In this study, an adaptive refinement procedure using the reproducing kernel particle method (RKPM) for the solution of 2D elastostatic problems is suggested. This adaptive refinement procedure is based on the Zienkiewicz and Zhu (ZZ) error estimator for the a posteriori error estimation and an adaptive finite point mesh generator for new point mesh generation. The presentation of the work is divided into two parts. In Part I, concentration will be paid on the stress recovery and the a posteriori error estimation processes for the RKPM. The proposed error estimator is different from most recovery type error estimators suggested previously in such a way that, rather than using the least-squares fitting approach, the recovery stress field is constructed by an extraction function approach. Numerical studies using 2D benchmark boundary value problems indicated that the recovered stress field obtained is more accurate and converges at a higher rate than the RKPM stress field. In Part II of the study, concentration will be shifted to the development of an adaptive refinement algorithm for the RKPM.     

Adaptive hp-versions of boundary element methods for elastic contact problems

The variational formulation of elastic contact problems leads to variational inequalities on convex subsets. These variational inequalities are solved with the boundary element method (BEM) by making use of the Poincaré–Steklov operator. This operator can be represented in its discretized form by the Schur-complement of the dense Galerkin-matrices for the single layer potential operator, the double layer potential operator and the hypersingular integral operator. Due to the difficulties in discretizing the convex subsets involved, traditionally only the h-version is used for discretization. Recently, p- and hp-versions have been introduced for Signorini contact problems in Maischak and Stephan (Appl Numer Math, 2005) . In this paper we show convergence for the quasi-uniform hp-version of BEM for elastic contact problems, and derive a-posteriori error estimates together with error indicators for adaptive hp-algorithms. We present corresponding numerical experiments.     

四阶Cahn-Hilliard方程的间断有限元方法

Cahn-Hilliard方程是一类非常重要的四阶扩散方程,具有深刻的物理背景和丰富的理论内涵,对其设计高精度的数值格式具有重要的工程实践价值和科学意义．在本文中我们对四阶Cahn-Hilliard方程设计一种高精度的间断有限元,该方法不同于传统的局部间断有限元方法,不需要引进另外的辅助变量或将方程转化为一阶方程组,能够显著降低计算量和存储量．通过选取合适的数值流通量,我们证明了方法的稳定性和收敛性．数值实验结果表明该方法求解Cahn-Hilliard方程是收敛的和有效的．     

A posteriori error estimates and adaptivity for finite element solutions in finite elasticity

Methods for a posteriori error estimation for finite element solutions are well established and widely used in engineering practice for linear boundary value problems. In contrast here we are concerned with finite elasticity and error estimation and adaptivity in this context. In the paper a brief outline of continuum theory of finite elasticity is first given. Using the residuals in the equilibrium conditions the discretization error of the finite element solution is estimated both locally and globally. The proposed error estimator is physically interpreted in the energy sense. We then present and discuss the convergence behaviour of the discretization error in uniformly and adaptively refined finite element sequences.