GALERKIN MESHLESS METHODS BASED ON PARTITION OF UNITY QUADRATURE

Numerical quadrature is an important ingredient of Galerkin meshless methods. A new numerical quadrature technique, partition of unity quadrature （PUQ）,for Galerkin meshless methods was presented. The technique is based on finite covering and partition of unity. There is no need to decompose the physical domain into small cell. It possesses remarkable integration accuracy. Using Element-free Galerkin methods as example, Galerkin meshless methods based on PUQ were studied in detail. Meshing is always not required in the procedure of constitution of approximate function or numerical quadrature, so Galerkin meshless methods based on PUQ are “truly” meshless methods.

THEORETICAL ANALYSIS OF THE REPRODUCING KERNEL GRADIENT SMOOTHING INTEGRATION TECHNIQUE IN GALERKIN MESHLESS METHODS

Numerical integration poses greater challenges in Galerkin meshless methods than finite element methods owing to the non-polynomial feature of meshless shape functions.The reproducing kernel gradient smoothing integration(RKGSI)is one of the optimal numerical integration techniques in Galerkin meshless methods with minimum integration points.In this paper,properties,quadrature rules and the effect of the RKGSI on meshless methods are analyzed.The existence,uniqueness and error estimates of the solution of Galerkin meshless methods under numerical integration with the RKGSI are established.A procedure on how to choose quadrature rules to recover the optimal convergence rate is presented.

NUMERICAL ANALYSIS OF MINDLIN SHELL BY MESHLESS LOCAL PETROV-GALERKIN METHOD

The objectives of this study are to employ the meshless local Petrov-Galerkin method （MLPGM） to solve three-dimensional shell problems. The computational accuracy of MLPGM for shell problems is affected by many factors, including the dimension of compact support domain, the dimension of quadrture domain, the number of integral cells and the number of Gauss points. These factors＇ sensitivity analysis is to adopt the Taguchi experimental design technology and point out the dimension of the quadrature domain with the largest influence on the computational accuracy of the present MLPGM for shells and give out the optimum combination of these factors. A few examples are given to verify the reliability and good convergence of MLPGM for shell problems compared to the theoretical or the finite element results.

A meshless Galerkin method with moving least square approximations for infinite elastic solids

Combining moving least square approximations and boundary integral equations, a meshless Galerkin method, which is the Galerkin boundary node method （GBNM）, for twoand three-dimensional infinite elastic solid mechanics problems with traction boundary conditions is discussed. In this numerical method, the resulting formulation inherits the symmetry and positive definiteness of variational problems, and boundary conditions can be applied directly and easily. A rigorous error analysis and convergence study for both displacement and stress is presented in Sobolev spaces. The capability of this method is illustrated and assessed by some numerical examples.

The complex variable meshless local Petrov-Galerkin method of solving two-dimensional potential problems

Based on the complex variable moving least-square（CVMLS） approximation and a local symmetric weak form,the complex variable meshless local Petrov-Galerkin（CVMLPG） method of solving two-dimensional potential problems is presented in this paper.In the present formulation,the trial function of a two-dimensional problem is formed with a one-dimensional basis function.The number of unknown coefficients in the trial function of the CVMLS approximation is less than that in the trial function of the moving least-square（MLS） approximation.The essential boundary conditions are imposed by the penalty method.The main advantage of this approach over the conventional meshless local Petrov-Galerkin（MLPG） method is its computational efficiency.Several numerical examples are presented to illustrate the implementation and performance of the present CVMLPG method.

Quasi Ellipsoid Gear Surface Reconstruction Based on Meshless Local Petrov-Galerkin Method and Transmission Characteristic

Special transmission 3D model simulation must be based on surface discretization and reconstruction, but special transmission usually has complicated tooth shape and movement, so present software can＇t provide technical support for special transmission 3D model simulation. Currently, theoretical calculation and experimental method are difficult to exactly solve special transmission contact analysis problem. How to reduce calculation and computer memories consume and meet calculation precision is key to resolve special transmission contact analysis problem. According to 3D model simulation and surface reconstruction of quasi ellipsoid gear is difficulty, this paper employes meshless local Petrov-Galerkin （MLPG） method. In order to reduce calculation and computer memories consume, we disperse tooth mesh into finite points--sparseness points cloud or grid mesh, and then we do interpolation reconstruction in some necessary place of the 3D surface model during analysis. Moving least square method （MLSM） is employed for tooth mesh interpolation reconstruction, there are some advantages to do interpolation by means of MLSM, such as high precision, good flexibility and no require of tooth mesh discretization into units. We input the quasi ellipsoid gear reconstruction model into simulation software, we complete tooth meshing simulation. Simulation transmission ratio during meshing period was obtained, compared with theoretical transmission ratio, the result inosculate preferably. The method using curve reconstruction realizes surface reconstruction, reduce simulation calculation enormously, so special gears simulation can be realized by minitype computer. The method provides a novel solution for special transmission 3D model simulation analysis and contact analysis.

Meshless Local Discontinuous Petrov-Galerkin Method with Application to Blasting Problems

A meshless local discontinuous Petrov-Galerkin (MLDPG) method based on the local symmetric weak form (LSWF) is presented with the application to blasting problems. The derivation is similar to that of mesh-based Runge-Kutta Discontinuous Galerkin (RKDG) method. The solutions are reproduced in a set of overlapped spherical sub-domains, and the test functions are employed from a partition of unity of the local basis functions. There is no need of any traditional non-overlapping mesh either for local approximation purpose or for Galerkin integration purpose in the presented method. The resulting MLDPG method is a meshless, stable, high-order accurate and highly parallelizable scheme which inherits both the advantages of RKDG and meshless method (MM), and it can handle the problems with extremely complicated physics and geometries easily. Three numerical examples of the one-dimensional Sod shock-tube problem, the blast-wave problem and the Woodward-Colella interacting shock wave problem are given. All the numerical results are in good agreement with the closed solutions. The higher-order MLDPG schemes can reproduce more accurate solution than the lower-order schemes.

Meshless analysis of an improved element-free Galerkin method for linear and nonlinear elliptic problems

We first give a stabilized improved moving least squares （IMLS） approximation, which has better computational stability and precision than the IMLS approximation. Then, analysis of the improved element-free Galerkin method is provided theoretically for both linear and nonlinear elliptic boundary value problems. Finally, numerical examples are given to verify the theoretical analysis.

A complex variable meshless local Petrov-Galerkin method for transient heat conduction problems

On the basis of the complex variable moving least-square （CVMLS） approximation, a complex variable meshless local Petrov-Galerkin （CVMLPG） method is presented for transient heat conduction problems. The method is developed based on the CVMLS approximation for constructing shape functions at scattered points, and the Heaviside step function is used as a test function in each sub-domain to avoid the need for a domain integral in symmetric weak form. In the construction of the well-performed shape function, the trial function of a two-dimensional （2D） problem is formed with a one-dimensional （1D） basis function, thus improving computational efficiency. The numerical results are compared with the exact solutions of the problems and the finite element method （FEM）. This comparison illustrates the accuracy as well as the capability of the CVMLPG method.

A meshless local Petrov–Galerkin method for solving the neutron diffusion equation

The goal of this study is to solve the neutron diffusion equation by using a meshless method and evaluate its performance compared to traditional methods. This paper proposes a novel method based on coupling the meshless local Petrov–Galerkin approach and the moving least squares approximation. This computational procedure consists of two main steps. The first involved applying the moving least squares approximation to construct the shape function based on the problem domain. Then, the obtained shape function was used in the meshless local Petrov–Galerkin method to solve the neutron diffusion equation.Because the meshless method is based on eliminating the mesh-based topologies, the problem domain was represented by a set of arbitrarily distributed nodes. There is no need to use meshes or elements for field variable interpolation. The process of node generation is simply and fully automated, which can save time. As this method is a local weak form, it does not require any background integration cells and all integrations are performed locally over small quadrature domains. To evaluate the proposed method,several problems were considered. The results were compared with those obtained from the analytical solution and a Galerkin finite element method. In addition, the proposed method was used to solve neutronic calculations in thesmall modular reactor. The results were compared with those of the citation code and reference values. The accuracy and precision of the proposed method were acceptable. Additionally, adding the number of nodes and selecting an appropriate weight function improved the performance of the meshless local Petrov–Galerkin method. Therefore, the proposed method represents an accurate and alternative method for calculating core neutronic parameters.

Structural Reliability Assessment by a Modified Spectral Stochastic Meshless Local Petrov-Galerkin Method

This study presents a new tool for solving stochastic boundary-value problems. This tool is created by modify the previous spectral stochastic meshless local Petrov-Galerkin method using the MLPG5 scheme. This modified spectral stochastic meshless local Petrov-Galerkin method is selectively applied to predict the structural failure probability with the uncertainty in the spatial variability of mechanical properties. Except for the MLPG5 scheme, deriving the proposed spectral stochastic meshless local Petrov-Galerkin formulation adopts generalized polynomial chaos expansions of random mechanical properties. Predicting the structural failure probability is based on the first-order reliability method. Further comparing the spectral stochastic finite element-based and meshless local Petrov-Galerkin-based predicted structural failure probabilities indicates that the proposed spectral stochastic meshless local Petrov-Galerkin method predicts the more accurate structural failure probability than the spectral stochastic finite element method does. In addition, generating spectral stochastic meshless local Petrov-Galerkin results are considerably time-saving than generating Monte-Carlo simulation results does. In conclusion, the spectral stochastic meshless local Petrov-Galerkin method serves as a time-saving tool for solving stochastic boundary-value problems sufficiently accurately.

Element-free Galerkin (EFG) method for a kind of two-dimensional linear hyperbolic equation

The present paper deals with the numerical solution of a two-dimensional linear hyperbolic equation by using the element-free Galerkin （EFG） method which is based on the moving least-square approximation for the test and trial functions. A variational method is used to obtain the discrete equations, and the essential boundary conditions are enforced by the penalty method. Compared with numerical methods based on mesh, the EFG method for hyperbolic problems needs only the scattered nodes instead of meshing the domain of the problem. It neither requires any element connectivity nor suffers much degradation in accuracy when nodal arrangements are very irregular. The effectiveness of the EFG method for two-dimensional hyperbolic problems is investigated by two numerical examples in this paper.

h-ADAPTIVE ANALYSIS BASED ON MESHLESS LOCAL PETROV-G ALERKIN METHOD WITH B SPLINE WAVELET FOR PLATES AND SHELLS

Using the two-scale decomposition technique, the h-adaptive meshless local Petrov- Galerkin method for solving Mindlin plate and shell problems is presented. The scaling functions of B spline wavelet are employed as the basis of the moving least square method to construct the meshless interpolation function. Multi-resolution analysis is used to decompose the field variables into high and low scales and the high scale component can commonly represent the gradient of the solution according to inherent characteristics of wavelets. The high scale component in the present method can directly detect high gradient regions of the field variables. The developed adaptive refinement scheme has been applied to simulate actual examples, and the effectiveness of the present adaptive refinement scheme has been verified.

A meshless method for the compound KdV-Burgers equation

The element-free Galerkin （EFG） method for numerically solving the compound Korteweg-de Vries-Burgers （KdVB） equation is discussed in this paper. The Galerkin weak form is used to obtain the discrete equation and the essential boundary conditions are enforced by the penalty method. The effectiveness of the EFG method of solving the compound Korteweg-de Vries-Burgers （KdVB） equation is illustrated by three numerical examples.

LOCAL PETROV-GALERKIN METHOD FOR A THIN PLATE

The meshless local Petrov_Galerkin (MLPG) method for solving the bending problem of the thin plate were presented and discussed. The method used the moving least_squares approximation to interpolate the solution variables, and employed a local symmetric weak form. The present method was a truly meshless one as it did not need a finite element or boundary element mesh, either for purpose of interpolation of the solution, or for the integration of the energy. All integrals could be easily evaluated over regularly shaped domains (in general, spheres in three_dimensional problems) and their boundaries. The essential boundary conditions were enforced by the penalty method. Several numerical examples were presented to illustrate the implementation and performance of the present method. The numerical examples presented show that high accuracy can be achieved for arbitrary grid geometries for clamped and simply_supported edge conditions. No post processing procedure is required to computer the strain and stress, since the original solution from the present method, using the moving least squares approximation, is already smooth enough.

Element-free Galerkin method for a kind of KdV equation

The present paper deals with the numerical solution of the third-order nonlinear KdV equation using the element-free Calerkin （EFG） method which is based on the moving least-squares approximation. A variational method is used to obtain discrete equations, and the essential boundary conditions are enforced by the penalty method. Compared with numerical methods based on mesh, the EFG method for KdV equations needs only scattered nodes instead of meshing the domain of the problem. It does not require any element connectivity and does not suffer much degradation in accuracy when nodal arrangements are very irregular. The effectiveness of the EFG method for the KdV equation is investigated by two numerical examples in this paper.

The element-free Galerkin method of numerically solving a regularized long-wave equation

The element-free Galerkin （EFG） method is used in this paper to find the numerical solution to a regularized long-wave （RLW） equation. The Galerkin weak form is adopted to obtain the discrete equations, and the essential boundary conditions are imposed by the penalty method. The effectiveness of the EFG method of solving the RLW equation is investigated by two numerical examples in this paper.

An element-free Galerkin(EFG) method for numerical solution of the coupled Schrdinger-KdV equations

The present paper deals with the numerical solution of the coupled Schrodinger-KdV equations using the elementfree Galerkin （EFG） method which is based on the moving least-square approximation. Instead of traditional mesh oriented methods such as the finite difference method （FDM） and the finite element method （FEM）, this method needs only scattered nodes in the domain. For this scheme, a variational method is used to obtain discrete equations and the essential boundary conditions are enforced by the penalty method. In numerical experiments, the results are presented and compared with the findings of the finite element method, the radial basis functions method, and an analytical solution to confirm the good accuracy of the presented scheme.

An element-free Galerkin (EFG) method for generalized Fisher equations (GFE)

A generalized Fisher equation （GFE） relates the time derivative of the average of the intrinsic rate of growth to its variance. The exact mathematical result of the GFE has been widely used in population dynamics and genetics, where it originated. Many researchers have studied the numerical solutions of the GFE, up to now. In this paper, we introduce an element-free Galerkin （EFG） method based on the moving least-square approximation to approximate positive solutions of the GFE from population dynamics. Compared with other numerical methods, the EFG method for the GFE needs only scattered nodes instead of meshing the domain of the problem. The Galerkin weak form is used to obtain the discrete equations, and the essential boundary conditions are enforced by the penalty method. In comparison with the traditional method, numerical solutions show that the new method has higher accuracy and better convergence. Several numerical examples are presented to demonstrate the effectiveness of the method.

Element-free Galerkin (EFG) method for analysis of the time-fractional partial differential equations

The present paper deals with the numerical solution of time-fractional partial differential equations using the element-free Galerkin （EFG） method, which is based on the moving least-square approximation. Compared with numerical methods based on meshes, the EFG method for time-fractional partial differential equations needs only scattered nodes instead of meshing the domain of the problem. It neither requires element connectivity nor suffers much degradation in accuracy when nodal arrangements are very irregular. In this method, the first-order time derivative is replaced by the Caputo fractional derivative of order α（0 〈 α≤ 1）. The Galerkin weak form is used to obtain the discrete equations, and the essential boundary conditions are enforced by the penalty method. Several numerical examples are presented and the results we obtained are in good agreement with the exact solutions.