A Novel Localized Meshless Method for Solving Transient Heat Conduction Problems in Complicated Domains

This paper first attempts to solve the transient heat conduction problem by combining the recently proposed local knot method(LKM)with the dual reciprocity method(DRM).Firstly,the temporal derivative is discretized by a finite difference scheme,and thus the governing equation of transient heat transfer is transformed into a non-homogeneous modified Helmholtz equation.Secondly,the solution of the non-homogeneous modified Helmholtz equation is decomposed into a particular solution and a homogeneous solution.And then,the DRM and LKM are used to solve the particular solution of the non-homogeneous equation and the homogeneous solution of the modified Helmholtz equation,respectively.The LKM is a recently proposed local radial basis function collocationmethod with themerits of being simple,accurate,and free ofmesh and integration.Compared with the traditional domain-type and boundary-type schemes,the present coupling algorithm could be treated as a really good alternative for the analysis of transient heat conduction on high-dimensional and complicated domains.Numerical experiments,including two-and three-dimensional heat transfer models,demonstrated the effectiveness and accuracy of the new methodology.

A LOCAL DISCONTINUOUS GALERKIN METHOD FOR TIME-FRACTIONAL DIFFUSION EQUATIONS

In this paper,a local discontinuous Galerkin(LDG)scheme for the time-fractional diffusion equation is proposed and analyzed.The Caputo time-fractional derivative(of orderα,with 0<α<1)is approximated by a finite difference method with an accuracy of order3-α,and the space discretization is based on the LDG method.For the finite difference method,we summarize and supplement some previous work by others,and apply it to the analysis of the convergence and stability of the proposed scheme.The optimal error estimate is obtained in the L2norm,indicating that the scheme has temporal(3-α)th-order accuracy and spatial(k+1)th-order accuracy,where k denotes the highest degree of a piecewise polynomial in discontinuous finite element space.The numerical results are also provided to verify the accuracy and efficiency of the considered scheme.

Stability and Time-Step Constraints of Implicit-Explicit Runge-Kutta Methods for the Linearized Korteweg-de Vries Equation

This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.

RBF Based Localized Method for Solving Nonlinear Partial Integro-Differential Equations

In this work,a numerical scheme is constructed for solving nonlinear parabolictype partial-integro differential equations.The proposed numerical scheme is based on radial basis functions which are local in nature like finite difference numerical schemes.The radial basis functions are used to approximate the derivatives involved and the integral is approximated by equal width integration rule.The resultant differentiation matrices are sparse in nature.After spatial approximation using RBF the partial integro-differential equations reduce to the system of ODEs.Then ODEs system can be solved by various types of ODE solvers.The proposed numerical scheme is tested and compared with other methods available in literature for different test problems.The stability and convergence of the present numerical scheme are discussed.

A local pseudo arc-length method for hyperbolic conservation laws

A local pseudo arc-length method（LPALM）for solving hyperbolic conservation laws is presented in this paper.The key idea of this method comes from the original arc-length method,through which the critical points are bypassed by transforming the computational space.The method is based on local changes of physical variables to choose the discontinuous stencil and introduce the pseudo arc-length parameter,and then transform the governing equations from physical space to arc-length space.In order to solve these equations in arc-length coordinate,it is necessary to combine the velocity of mesh points in the moving mesh method,and then convert the physical variable in arclength space back to physical space.Numerical examples have proved the effectiveness and generality of the new approach for linear equation,nonlinear equation and system of equations with discontinuous initial values.Non-oscillation solution can be obtained by adjusting the parameter and the mesh refinement number for problems containing both shock and rarefaction waves.

A MESHLESS LOCAL PETROV-GALERKIN METHOD FOR GEOMETRICALLY NONLINEAR PROBLEMS

Nonlinear formulations of the meshless local Petrov-Galerkin （MLPG） method are presented for geometrically nonlinear problems. The method requires no mesh in computation and therefore avoids mesh distortion difficulties in the large deformation analysis. The essential boundary conditions in the present formulation axe imposed by a penalty method. An incremental and iterative solution procedure is used to solve geometrically nonlinear problems. Several examples are presented to demonstrate the effectiveness of the method in geometrically nonlinear problems analysis. Numerical results show that the MLPG method is an effective one and that the values of the unknown variable are quite accurate.

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 STUDY ON THE WEIGHT FUNCTION OF THE MOVING LEAST SQUARE APPROXIMATION IN THE LOCAL BOUNDARY INTEGRAL EQUATION METHOD

The meshless method is a new numerical technique presented in recent years.It uses the moving least square(MLS)approximation as a shape function.The smoothness of the MLS approximation is determined by that of the basic function and of the weight function,and is mainly determined by that of the weight function.Therefore,the weight function greatly affects the accuracy of results obtained.Different kinds of weight functions,such as the spline function, the Gauss function and so on,are proposed recently by many researchers.In the present work,the features of various weight functions are illustrated through solving elasto-static problems using the local boundary integral equation method.The effect of various weight functions on the accuracy, convergence and stability of results obtained is also discussed.Examples show that the weight function proposed by Zhou Weiyuan and Gauss and the quartic spline weight function are better than the others if parameters c and α in Gauss and exponential weight functions are in the range of reasonable values,respectively,and the higher the smoothness of the weight function,the better the features of the solutions.

A sludge volume index (SVI) model based on the multivariate local quadratic polynomial regression method

In this study, a multivariate local quadratic polynomial regression(MLQPR) method is proposed to design a model for the sludge volume index(SVI). In MLQPR, a quadratic polynomial regression function is established to describe the relationship between SVI and the relative variables, and the important terms of the quadratic polynomial regression function are determined by the significant test of the corresponding coefficients. Moreover, a local estimation method is introduced to adjust the weights of the quadratic polynomial regression function to improve the model accuracy. Finally, the proposed method is applied to predict the SVI values in a real wastewater treatment process(WWTP). The experimental results demonstrate that the proposed MLQPR method has faster testing speed and more accurate results than some existing methods.

Slope analysis based on local strength reduction method and variable-modulus elasto-plastic model

Employing an ideal elasto-plastic model,the typically used strength reduction method reduced the strength of all soil elements of a slope.Therefore,this method was called the global strength reduction method(GSRM).However,the deformation field obtained by GSRM could not reflect the real deformation of a slope when the slope became unstable.For most slopes,failure occurs once the strength of some regional soil is sufficiently weakened; thus,the local strength reduction method(LSRM)was proposed to analyze slope stability.In contrast with GSRM,LSRM only reduces the strength of local soil,while the strength of other soil remains unchanged.Therefore,deformation by LSRM is more reasonable than that by GSRM.In addition,the accuracy of the slope's deformation depends on the constitutive model to a large degree,and the variable-modulus elasto-plastic model was thus adopted.This constitutive model was an improvement of the Duncan–Chang model,which modified soil's deformation modulus according to stress level,and it thus better reflected the plastic feature of soil.Most importantly,the parameters of the variable-modulus elasto-plastic model could be determined through in-situ tests,and parameters determination by plate loading test and pressuremeter test were introduced.Therefore,it is easy to put this model into practice.Finally,LSRM and the variable-modulus elasto-plastic model were used to analyze Egongdai ancient landslide.Safety factor,deformation field,and optimal reinforcement measures for Egongdai ancient landslide were obtained based on the proposed method.

Modified Burgers' equation by the local discontinuous Galerkin method

In this paper,we present the local discontinuous Galerkin method for solving Burgers＇ equation and the modified Burgers＇ equation.We describe the algorithm formulation and practical implementation of the local discontinuous Galerkin method in detail.The method is applied to the solution of the one-dimensional viscous Burgers＇ equation and two forms of the modified Burgers＇ equation.The numerical results indicate that the method is very accurate and efficient.

Local discontinuous Galerkin method for solving Burgers and coupled Burgers equations

In the current work, we extend the local discontinuous Galerkin method to a more general application system. The Burgers and coupled Burgers equations are solved by the local discontinuous Galerkin method. Numerical experiments are given to verify the efficiency and accuracy of our method. Moreover the numerical results show that the method can approximate sharp fronts accurately with minimal oscillation.

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.

A local fuzzy method based on “p-strong” community for detecting communities in networks

In this paper,we propose a local fuzzy method based on the idea of ＂p-strong＂ community to detect the disjoint and overlapping communities in networks.In the method,a refined agglomeration rule is designed for agglomerating nodes into local communities,and the overlapping nodes are detected based on the idea of making each community strong.We propose a contribution coefficient bvcito measure the contribution of an overlapping node to each of its belonging communities,and the fuzzy coefficients of the overlapping node can be obtained by normalizing the bvci to all its belonging communities.The running time of our method is analyzed and varies linearly with network size.We investigate our method on the computergenerated networks and real networks.The testing results indicate that the accuracy of our method in detecting disjoint communities is higher than those of the existing local methods and our method is efficient for detecting the overlapping nodes with fuzzy coefficients.Furthermore,the local optimizing scheme used in our method allows us to partly solve the resolution problem of the global modularity.

A meshfree-based local Galerkin method with condensation of degree of freedom for elastic dynamic analysis

Condensation technique of degree of freedom is first proposed to improve the computational efficiency of meshfree method with Galerkin weak form for elastic dy- namic analysis. In the present method, scattered nodes with- out connectivity are divided into several subsets by cells with arbitrary shape. Local discrete equation is established over each cell by using moving Kriging interpolation, in which the nodes that located in the cell are used for approxima- tion. Then local discrete equations can be simplified by con- densation of degree of freedom, which transfers equations of inner nodes to equations of boundary nodes based on cells. The global dynamic system equations are obtained by as- sembling all local discrete equations and are solved by using the standard implicit Newmark＇s time integration scheme. In the scheme of present method, the calculation of each cell is carried out by meshfree method, and local search is imple- mented in interpolation. Numerical examples show that the present method has high computational efficiency and good accuracy in solving elastic dynamic problems.

Numerical simulation of the welding deformation for the side sill of the bogie frame based on local-global method

Considering the limitation of computational capacity, a new finite element solution is used to simulate the welding deformation of the side sill of railroad car＇ s bogie frame based on the local-global method. Firstly, a volumetric heat source defined by a double ellipsoid is adopted to simulate the thermal distributions of the arc welding process. And then, the local models extracted from the global model are computed with refined meshes. On these bases, the global distortions of the subject studied are ascertained by transferring the inner forces of computed local models to the global model. It indicates that the local-global method is feasible for simulating the large welded structures by comparing the computed results with the corresponding actual measured values. The work provides basis for optimizing the welding sequence and clamping conditions, and has theoretical values and engineering significance in the integral design, manufacturing technique selection of the bogie frame, as well as other kinds of large welded structures.

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.

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.

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.

A New Genetic Algorithm Based on Niche Technique and Local Search Method

The genetic algorithm has been widely used in many fields as an easy robust global search and optimization method. In this paper, a new generic algorithm based on niche technique and local search method is presented under the consideration of inadequacies of the simple genetic algorithm. In order to prove the adaptability and validity of the improved genetic algorithm, optimization problems of multimodal functions with equal peaks, unequal peaks and complicated peak distribution are discussed. The simulation results show that compared to other niching methods, this improved genetic algorithm has obvious potential on many respects, such as convergence speed, solution accuracy, ability of global optimization, etc.