Meshless analysis of potential problems in three dimensions with the hybrid boundary node method

Combining a modified functional with the moving least‐squares (MLS) approximation, the hybrid boundary node method (Hybrid BNM) is a truly meshless, boundary‐only method. The method may have advantages from the meshless local boundary integral equation (MLBIE) method and also the boundary node method (BNM). In fact, the Hybrid BNN requires only the discrete nodes located on the surface of the domain. The Hybrid BNM has been applied to solve 2D potential problems. In this paper, the Hybrid BNM is extended to solve potential problems in three dimensions. Formulations of the Hybrid BNM for 3D potential problems and the MLS approximation on a generic surface are developed. A general computer code of the Hybrid BNM is implemented in C++. The main drawback of the ‘boundary layer effect’ in the Hybrid BNM in the 2D case is circumvented by an adaptive face integration scheme. The parameters that influence the performance of this method are studied through three different geometries and known analytical fields. Numerical results for the solution of the 3D Laplace's equation show that high convergence rates with mesh refinement and high accuracy are achievable. Copyright © 2004 John Wiley & Sons, Ltd.     

A hybrid boundary node method

A new variational formulation for boundary node method (BNM) using a hybrid displacement functional is presented here. The formulation is expressed in terms of domain and boundary variables, and the domain variables are interpolated by classical fundamental solution; while the boundary variables are interpolated by moving least squares (MLS). The main idea is to retain the dimensionality advantages of the BNM, and get a truly meshless method, which does not require a ‘boundary element mesh’, either for the purpose of interpolation of the solution variables, or for the integration of the ‘energy’. All integrals can be easily evaluated over regular shaped domains (in general, semi‐sphere in the 3‐D problem) and their boundaries. Numerical examples presented in this paper for the solution of Laplace's equation in 2‐D show that high rates of convergence with mesh refinement are achievable, and the computational results for unknown variables are most accurate. No further integrations are required to compute the unknown variables inside the domain as in the conventional BEM and BNM. Copyright © 2001 John Wiley & Sons, Ltd.     

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.     

The hybrid boundary node method accelerated by fast multipole expansion technique for 3D potential problems

This paper presents a fast formulation of the hybrid boundary node method (Hybrid BNM) for solving problems governed by Laplace's equation in 3D. The preconditioned GMRES is employed for solving the resulting system of equations. At each iteration step of the GMRES, the matrix–vector multiplication is accelerated by the fast multipole method. Green's kernel function is expanded in terms of spherical harmonic series. An oct‐tree data structure is used to hierarchically subdivide the computational domain into well‐separated cells and to invoke the multipole expansion approximation. Formulations for the local and multipole expansions, and also conversion of multipole to local expansion are given. And a binary tree data structure is applied to accelerate the moving least square approximation on surfaces. All the formulations are implemented in a computer code written in C++. Numerical examples demonstrate the accuracy and efficiency of the proposed approach. Copyright © 2005 John Wiley & Sons, Ltd.     

Essential boundary condition enforcement in meshless methods: boundary flux collocation method

Element‐free Galerkin (EFG) methods are based on a moving least‐squares (MLS) approximation, which has the property that shape functions do not satisfy the Kronecker delta function at nodal locations, and for this reason imposition of essential boundary conditions is difficult. In this paper, the relationship between corrected collocation and Lagrange multiplier method is revealed, and a new strategy that is accurate and very simple for enforcement of essential boundary conditions is presented. The accuracy and implementation of this new technique is illustrated for one‐dimensional elasticity and two‐dimensional potential field problems. Copyright © 2001 John Wiley & Sons, Ltd.     

The boundary node method for three‐dimensional problems in potential theory

The boundary node method (BNM) is developed in this paper for solving potential problems in three dimensions. The BNM represents a coupling between boundary integral equations (BIE) and moving least‐squares (MLS) interpolants. The main idea here 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 the field variables. A general BNM computer code for 3‐D potential problems has been developed. Several parameters involved in the BNM need to be chosen carefully for a successful implementation of the method. An in‐depth and systematic study has been carried out in this paper in order to better understand the effects of various parameters on the performance of the method. Numerical results for spheres and cubes, subjected to different types of boundary conditions, are extremely encouraging. Copyright © 2000 John Wiley & Sons, Ltd.     

A procedure for approximation of the error in the EFG method

In this paper, we present a procedure to estimate the error in elliptic equations using the element‐free Galerkin (EFG) method, whose evaluation is computationally simple and can be readily implemented in existing EFG codes. The estimation of the error works very well in all numerical examples for 2‐D potential problems that are presented here, for regular and irregular clouds of points. Moreover, it was demonstrated that this method is very simple in terms of economy and gives a good performance. The results show that the error in EFG approximation may be estimated via the error estimator described in this paper. The quality of the estimation of the error is demonstrated by numerical examples. The implemented procedure of error approximation allows the global energy norm error to be estimated and also gives a good evaluation of local errors. It can, thus, be combined with a full adaptive process of refinement or, more simply, provide guidance for redesign of cloud of points. Copyright © 2001 John Wiley & Sons, Ltd.     

A fast boundary cloud method for exterior 2D electrostatic analysis

An accelerated boundary cloud method (BCM) for boundary‐only analysis of exterior electrostatic problems is presented in this paper. The BCM uses scattered points instead of the classical boundary elements to discretize the surface of the conductors. The dense linear system of equations generated by the BCM are solved by a GMRES iterative solver combined with a singular value decomposition based rapid matrix–vector multiplication technique. The accelerated technique takes advantage of the fact that the integral equation kernel (2D Green's function in our case) is locally smooth and, therefore, can be dramatically compressed by using a singular value decomposition technique. The acceleration technique greatly speeds up the solution phase of the linear system by accelerating the computation of the dense matrix–vector product and reducing the storage required by the BCM. Copyright © 2002 John Wiley & Sons, Ltd.     

Boundary element‐free method (BEFM) for two‐dimensional elastodynamic analysis using Laplace transform

In this paper, we present a direct meshless method of boundary integral equation (BIE), known as the boundary element‐free method (BEFM), for two‐dimensional (2D) elastodynamic problems that combines the BIE method for 2D elastodynamics in the Laplace‐transformed domain and the improved moving least‐squares (IMLS) approximation. The formulae for the BEFM for 2D elastodynamic problems are given, and the numerical procedures are also shown. The BEFM is a direct numerical method, in which the basic unknown quantities are the real solutions of the nodal variables, and the boundary conditions can be implemented directly and easily that leads to a greater computational precision. For the purpose of demonstration, some selected numerical examples are solved using the BEFM. Copyright © 2005 John Wiley & Sons, Ltd.     

Implementation of meshless LBIE method to the 2D non‐linear SG problem

In this paper the meshless local boundary integral equation (LBIE) method for numerically solving the non‐linear two‐dimensional sine‐Gordon (SG) equation is developed. The method is based on the LBIE with moving least‐squares (MLS) approximation. For the MLS, nodal points spread over the analyzed domain are utilized to approximate the interior and boundary variables. The approximation functions are constructed entirely using a set of scattered nodes, and no element or connectivity of the nodes is needed for either the interpolation or the integration purposes. A time‐stepping method is employed to deal with the time derivative and a simple predictor–corrector scheme is performed to eliminate the non‐linearity. A brief discussion is outlined for numerical integrations in the proposed algorithm. Some examples involving line and ring solitons are demonstrated and the conservation of energy in undamped SG equation is investigated. The final numerical results confirm the ability of method to deal with the unsteady non‐linear problems in large domains. Copyright © 2009 John Wiley & Sons, Ltd.     

An improved moving‐least‐squares reconstruction for immersed boundary method

The current work presents an improved immersed boundary method based on the ideas proposed by Vanella and Balaras (M. Vanella, E. Balaras, A moving‐least‐squares reconstruction for embedded‐boundary formulations, J. Comput. Phys. 228 (2009) 6617–6628). In the method, an improved moving‐least‐squares approximation is employed to build the transfer functions between the Lagrangian points and discrete Eulerian grid points. The main advantage of the improved method is that there is no need to obtain the inverse matrix, which effectively eliminates numerical instabilities caused by matrix inversion and reduces the computational cost significantly. Several different flow problems (Taylor‐Green decaying vortices, flows past a stationary circular cylinder and a sphere, and the sedimentation of a free‐falling sphere in viscous fluid) are simulated to validate the accuracy and efficiency of the method proposed in the present paper. The simulation results show good agreement with previous numerical and experimental results, indicating that the improved immersed boundary method is efficient and reliable in dealing with the fluid–solid interaction problems. Copyright © 2015 John Wiley & Sons, Ltd.     

A posteriori error approximation in EFG method

Recently, considerable effort has been devoted to the development of the so‐called meshless methods. Meshless methods still require considerable improvement before they equal the prominence of finite elements in computer science and engineering. One of the paths in the evolution of meshless methods has been the development of the element free Galerkin (EFG) method. In the EFG method, it is obviously important that the ‘a posteriori error’ should be approximated. An ‘a posteriori error’ approximation based on the moving least‐squares method is proposed, using the solution, computed from the EFG method. The error approximation procedure proposed in this paper is simple to construct and requires, at most, nearest neighbour information from the EFG solution. The formulation is based on employing different moving least‐squares approximations. Different selection strategies of the moving least‐squares approximations have been used and compared, to obtain optimum values of the parameters involved in the approximation of the error. The performance of the developed approximation of the error is illustrated by analysing different examples for two‐dimensional (2D) potential and elasticity problems, using regular and irregular clouds of points. The implemented procedure of error approximation allows the global energy norm error to be estimated and also provides a good evaluation of local errors. Copyright © 2003 John Wiley & Sons, Ltd.     

A new meshless regular local boundary integral equation (MRLBIE) approach

A new meshless method based on a regular local integral equation and the moving least‐squares approximation is developed. The present method is a truly meshless one as it does not need a ‘finite element or boundary element mesh’, either for purposes of interpolation of the solution variables, or for the integration of the ‘energy’. All integrals can be easily evaluated over regularly shaped domains (in general, spheres in three‐dimensional problems) and their boundaries. No derivatives of the shape functions are needed in constructing the system stiffness matrix for the internal nodes, as well as for those boundary nodes with no essential‐boundary‐condition‐prescribed sections on their local boundaries. Numerical examples presented in the paper show that high rates of convergence with mesh refinement are achievable, and the computational results for the unknown variable and its derivatives are very accurate. No special post‐processing procedure is required to compute the derivatives of the unknown variable, as the original result, from the moving least‐squares approximation, is smooth enough. Copyright © 1999 John Wiley & Sons, Ltd.     

The least‐squares meshfree method

A new efficient meshfree method is presented in which the first‐order least‐squares method is employed instead of the Galerkin's method. In the meshfree methods based on the Galerkin formulation, the source of many difficulties is in the numerical integration. The current method, in this respect, has different characteristics and is expected to remove some of the integration‐related problems. It is demonstrated through numerical examples that the present formulation is highly robust to integration errors. Therefore, numerical integration can be performed with great ease and effectiveness using very simple algorithms. Copyright © 2001 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.     

Analyzing interaction between coplanar square cracks using an efficient boundary element‐free method

This paper examines the interaction between coplanar square cracks by combining the moving least‐squares (MLS) approximation and the derived boundary integral equation (BIE). A new traction BIE involving only the Cauchy singular kernels is derived by applying integration by parts to the traditional boundary integral formulation. The new traction BIE can be directly applied to a crack surface and no displacement BIE is necessary because all crack boundary conditions (both upper and lower ones) are incorporated. A boundary element‐free method is then developed by combining the derived BIE and MLS approximation, in which the crack opening displacement is first expressed as the product of weight functions and the characteristic terms, and the unknown weight is approximated with the MLS approximation. The efficiency of the developed method is tested for isotropic and transversely isotropic media. The interaction between two and three coplanar square cracks in isotropic elastic body is numerically studied and the case of any number of coplanar square cracks is deduced and discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

Least‐squares collocation meshless method

A finite point method, least‐squares collocation meshless method, is proposed. Except for the collocation points which are used to construct the trial functions, a number of auxiliary points are also adopted. Unlike the direct collocation method, the equilibrium conditions are satisfied not only at the collocation points but also at the auxiliary points in a least‐squares sense. The moving least‐squares interpolant is used to construct the trial functions. The computational effort required for the present method is in the same order as that required for the direct collocation, while the present method improves the accuracy of solution significantly. The proposed method does not require any mesh so that it is a truly meshless method. Three numerical examples are studied in detail, which show that the proposed method possesses high accuracy with low computational effort. Copyright © 2001 John Wiley & Sons, Ltd.     

Meshless local boundary integral equation method for 2D elastodynamic problems

A new meshless method for solving transient elastodynamic boundary value problems, based on the local boundary integral equation (LBIE) method and the moving least squares approximation (MLS), is proposed in this paper. The LBIE with the MLS is applied to both transient and steady‐state (Laplace transformed) elastodynamics. Applying the MLS approximation for spatially dependent terms in the first approach, the LBIEs are transformed into a system of ordinary differential equations for nodal unknowns. This system of ordinary differential equations is solved by the Houbolt finite difference scheme. In the second formulation, the time variable is eliminated by using the Laplace transformation. Unknown Laplace transforms of displacements and traction vectors are computed from the LBIEs with the MLS approximation. The time‐dependent values are obtained by the Durbin inversion technique. Copyright © 2003 John Wiley & Sons, Ltd.     

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.     

Weighted radial basis collocation method for boundary value problems

This work introduces the weighted radial basis collocation method for boundary value problems. We first show that the employment of least‐squares functional with quadrature rules constitutes an approximation of the direct collocation method. Standard radial basis collocation method, however, yields a larger solution error near boundaries. The residuals in the least‐squares functional associated with domain and boundary can be better balanced if the boundary collocation equations are properly weighted. The error analysis shows unbalanced errors between domain, Neumann boundary, and Dirichlet boundary least‐squares terms. A weighted least‐squares functional and the corresponding weighted radial basis collocation method are then proposed for correction of unbalanced errors. It is shown that the proposed method with properly selected weights significantly enhances the numerical solution accuracy and convergence rates. Copyright © 2006 John Wiley & Sons, Ltd.