基于单位分解积分的伽辽金无网格方法研究

数值积分是伽辽金无网格方法实施的一个重要环节,提出了一种适合于伽辽金无网格方法的单位分解积分技术．该积分技术建立在有限覆盖和单位分解基础之上,不需要对积分区域进行分解,具有较高的积分精度．并以无单元伽辽金方法为例,详细说明了基于单位分解积分的伽辽金无网格方法的实现过程．这样,在近似函数建立和数值积分过程中都不需要进行网格划分,从而形成一种“真正的”无网格方法．     

Product Gauss quadrature rules vs. cubature rules in the meshless local Petrov–Galerkin method

A crucial point in the implementation of meshless methods such as the meshless local Petrov–Galerkin (MLPG) method is the evaluation of the domain integrals arising over circles in the discrete local weak form of the governing partial differential equation. In this paper we make a comparison between the product Gauss numerical quadrature rules, which are very popular in the MLPG literature, with cubature formulas specifically constructed for the approximation of an integral over the unit disk, but not yet applied in the MLPG method, namely the spherical, the circularly symmetrical and the symmetric cubature formulas. The same accuracy obtained with 64×64 points in the product Gauss rules may be obtained with symmetric quadrature formulas with very few points.     

A comparison of numerical integration rules for the meshless local Petrov–Galerkin method

The meshless local Petrov–Galerkin (MLPG) method is a mesh-free procedure for solving partial differential equations. However, the benefit in avoiding the mesh construction and refinement is counterbalanced by the use of complicated non polynomial shape functions with subsequent difficulties, and a potentially large cost, when implementing numerical integration schemes. In this paper we describe and compare some numerical quadrature rules with the aim at preserving the MLPG solution accuracy and at the same time reducing its computational cost.     

Thin plate spline Galerkin scheme for numerically solving nonlinear weakly singular Fredholm integral equations

The present work proposes a numerical method to obtain an approximate solution of non-linear weakly singular Fredholm integral equations. The discrete Galerkin method in addition to thin-plate splines established on scattered points is utilized to estimate the solution of these integral equations. The thin-plate splines can be regarded as a type of free shape parameter radial basis functions which create an efficient and stable technique to approximate a function. The discrete Galerkin method for the approximate solution of integral equations results from the numerical integration of all integrals in the method. We utilize a special accurate quadrature formula via the non-uniform composite Gauss-Legendre integration rule and employ it to compute the singular integrals appeared in the scheme. Since the approach does not need any background meshes, it can be identified as a meshless method. Error analysis is also given for the method. Illustrative examples are shown clearly the reliability and efficiency of the new scheme and confirm the theoretical error estimates.     

Numerical integration in Galerkin meshless methods, applied to elliptic Neumann problem with non-constant coefficients

In this paper, we explore the effect of numerical integration on the Galerkin meshless method used to approximate the solution of an elliptic partial differential equation with non-constant coefficients with Neumann boundary conditions. We considered Galerkin meshless methods with shape functions that reproduce polynomials of degree k?≥?1. We have obtained an estimate for the energy norm of the error in the approximate solution under the presence of numerical integration. This result has been established under the assumption that the numerical integration rule satisfies a certain discrete Green’s formula, which is not problem dependent, i.e., does not depend on the non-constant coefficients of the problem. We have also derived numerical integration rules satisfying the discrete Green’s formula.     

Local radial basis function interpolation method to simulate 2D fractional‐time convection‐diffusion‐reaction equations with error analysis

In this article, a kind of meshless local radial point interpolation (MLRPI) method is proposed to two‐dimensional fractional‐time convection‐diffusion‐reaction equations and satisfactory agreements are archived. This method is based on meshless methods and benefits from collocation ideas but it does not belong to the traditional global meshless collocation methods. In MLRPI method, it does not need any kind of integration locally or globally over small quadrature domains which is essential in the finite element method and those meshless methods based on Galerkin weak form. Also, it is not needed to determine shape parameter which plays important role in collocation method based on the radial basis functions (Kansa's method). Therefore, computational costs of this kind of MLRPI method is less expensive. The stability and convergence of this meshless approach are discussed and theoretically proven. It is proved that the present meshless formulation is very effective for modeling and simulation of fractional differential equations. Furthermore, the numerical studies on sensitivity analysis and convergence analysis show the stability and reliable rates of convergence. © 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 974–994, 2017     

Quadrature for meshless Nitsche's method

In this article, we study effect of numerical integration on Galerkin meshless method (GMM), applied to approximate solutions of elliptic partial differential equations with essential boundary conditions (EBC). It is well‐known that it is difficult to impose the EBC on the standard approximation space used in GMM. We have used the Nitsche's approach, which was introduced in context of finite element method, to impose the EBC. We refer to this approach as the meshless Nitsche's method (MNM). We require that the numerical integration rule satisfies (a) a “discrete Green's identity” on polynomial spaces, and (b) a “conforming condition” involving the additional integration terms introduced by the Nitsche's approach. Based on such numerical integration rules, we have obtained a convergence result for MNM with numerical integration, where the shape functions reproduce polynomials of degree k ≥ 1. Though we have presented the analysis for the nonsymmetric MNM, the analysis could be extended to the symmetric MNM similarly. Numerical results have been presented to illuminate the theoretical results and to demonstrate the efficiency of the algorithms.Copyright © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 265–288, 2014     

A novel interpolating element-free Galerkin (IEFG) method for two-dimensional elastoplasticity

Using the interpolating moving least-squares (IMLS) method to obtain the shape function, we present a novel interpolating element-free Galerkin (IEFG) method to solve two-dimensional elastoplasticity problems. The shape function of the IMLS method satisfies the property of Kronecker δ function, then in the meshless methods based on the IMLS method, the essential boundary conditions can applied directly. Based on the Galerkin weak form, we obtain the formulae of the IEFG method for solving two-dimensional elastoplasticity problems. The IEFG method has some advantages, such as simpler formulae and directly applying the essential boundary conditions, over the conventional element-free Galerkin (EFG) method. The results of three numerical examples show that the computational precision of the IEFG method is higher than that of the EFG method.     

Theoretical analysis of numerical integration in Galerkin meshless methods

In this paper, we study effects of numerical integration on Galerkin meshless methods for solving elliptic partial differential equations with Neumann boundary conditions. The shape functions used in the meshless methods reproduce linear polynomials. The numerical integration rules are required to satisfy the so-called zero row sum condition of stiffness matrix, which is also used by Babuška et al. (Int. J. Numer. Methods Eng. 76:1434–1470, 2008). But the analysis presented there relies on a certain property of the approximation space, which is difficult to verify. The analysis in this paper does not require this property. Moreover, the Lagrange multiplier technique was used to handle the pure Neumann condition. We have also identified specific numerical schemes, diagonal elements correction and background mesh integration, that satisfy the zero row sum condition. The numerical experiments are carried out to verify the theoretical results and test the accuracy of the algorithms.     

Coupling three-field formulation and meshless mixed Galerkin methods using radial basis functions

In this work, we solve the elliptic partial differential equation by coupling the meshless mixed Galerkin approximation using radial basis function with the three-field domain decomposition method. The formulation has been adopted to increase the efficiency of the numerical technique by decreasing the error and dealing with the ill conditioning of the linear system caused by the radial basis function. Convergence analysis of the coupled technique is treated and numerical results of some solved examples are given at the end of this paper.     

A Petrov–Galerkin RBF method for diffusion equation on the unit sphere

This paper concerns a numerical solution for the diffusion equation on the unit sphere. The given method is based on the spherical basis function approximation and the Petrov–Galerkin test discretization. The method is meshless because spherical triangulation is not required neither for approximation nor for numerical integration. This feature is achieved through the spherical basis function approximation and the use of local weak forms instead of a global variational formulation. The local Petrov–Galerkin formulation allows to compute the integrals on small independent spherical caps without any dependence on a connected background mesh. Experimental results show the accuracy and the efficiency of the new method.     

Spectral meshless radial point interpolation (SMRPI) method to two‐dimensional fractional telegraph equation

H. Ammari In this article, an innovative technique so‐called spectral meshless radial point interpolation (SMRPI) method is proposed and, as a test problem, is applied to a classical type of two‐dimensional time‐fractional telegraph equation defined by Caputo sense for (1 < α≤2). This new methods is based on meshless methods and benefits from spectral collocation ideas, but it does not belong to traditional meshless collocation methods. The point interpolation method with the help of radial basis functions is used to construct shape functions, which play as basis functions in the frame of SMRPI method. These basis functions have Kronecker delta function property. Evaluation of high‐order derivatives is not difficult by constructing operational matrices. In SMRPI method, it does not require any kind of integration locally or globally over small quadrature domains, which is essential of the finite element method (FEM) and those meshless methods based on Galerkin weak form. Also, it is not needed to determine strict value for the shape parameter, which plays an important role in collocation method based on the radial basis functions (Kansa's method). Therefore, computational costs of SMRPI method are less expensive. Two numerical examples are presented to show that SMRPI method has reliable rates of convergence. Copyright © 2015 John Wiley & Sons, Ltd.     

A meshless local Galerkin method for the numerical solution of Hammerstein integral equations based on the moving least squares technique

In this paper, a computational scheme is proposed to estimate the solution of one- and two-dimensional Fredholm-Hammerstein integral equations of the second kind. The method approximates the solution using the discrete Galerkin method based on the moving least squares (MLS) approach as a locally weighted least squares polynomial fitting. The discrete Galerkin technique for integral equations results from the numerical integration of all integrals in the system corresponding to the Galerkin method. Since the proposed method is constructed on a set of scattered points, it does not require any background meshes and so we can call it as the meshless local discrete Galerkin method. The implication of the scheme for solving two-dimensional integral equations is independent of the geometry of the domain. The new method is simple, efficient and more flexible for most classes of nonlinear integral equations. The error analysis of the method is provided. The convergence accuracy of the new technique is tested over several Hammerstein integral equations and obtained results confirm the theoretical error estimates.     

Analysis of finite element approximation and quadrature of Volterra integral equations

In this article we study Galerkin finite element approximations to integral equations of the Volterra type. Our prime concern is the noncoercive case, which is not covered by the standard finite element theory. The question of rates of convergence is studied for the case where an exact stiffness matrix is available, as well as the case where the latter is approximated via quadrature rules. The optimality of these rules is also considered from the point of view of the effect the choice of the quadrature has on the overall rate of convergence. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 663–672, 1997     

Alternating Direction Implicit Galerkin Finite Element Method for the Two-Dimensional Time Fractional Evolution Equation

New numerical techniques are presented for the solution of the two-dimensional time fractional evolution equation in the unit square. In these methods, Galerkin finite element is used for the spatial discretization, and, for the time stepping, new alternating direction implicit (ADI) method based on the backward Euler method combined with the first order convolution quadrature approximating the integral term are considered. The ADI Galerkin finite element method is proved to be convergent in time and in the $L^2$ norm in space. The convergence order is$\mathcal{O}$($k$|ln $k$|+$h^r$), where $k$ is the temporal grid size and $h$ is spatial grid size in the $x$ and $y$ directions, respectively. Numerical results are presented to support our theoretical analysis.     

Adaptive meshless Galerkin boundary node methods for hypersingular integral equations

Adaptive refinement techniques are developed in this paper for the meshless Galerkin boundary node method for hypersingular boundary integral equations. Two types of error estimators are derived. One is a perturbation error estimator that is formulated based on the difference between numerical solutions obtained using two consecutive nodal arrangements. The other is a projection error estimator that is formulated based on the difference between the numerical solution itself and its projection. 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 scheme is presented to accomodate the non-local property of hypersingular integral operators for the needed computable local error indicators. The convergence of the adaptive meshless techniques is verified theoretically. To confirm the theoretical results and to show the efficiency of the adaptive techniques, numerical examples in 2D and 3D with high singularities are provided.     

HIGH-ORDER NONLINEAR GALERKIN METHODS

The nonlinear Galerkin methods are numerical schemes well adapted to the long-term integration of nonlinear evolution partial differential equations. In this paper, a class of high-order nonlinear Galerkin methods are provided. Moreover, convergence results with high-order spectral accuracy are derived for the schemes introduced.     

High-order discontinuous element-based schemes for the inviscid shallow water equations: Spectral multidomain penalty and discontinuous Galerkin methods

Two commonly used types of high-order-accuracy element-based schemes, collocation-based spectral multidomain penalty methods (SMPM) and nodal discontinuous Galerkin methods (DGM), are compared in the framework of the inviscid shallow water equations. Differences and similarities in formulation are identified, with the primary difference being the dissipative term in the Rusanov form of the numerical flux for the DGM that provides additional numerical stability; however, it should be emphasized that to arrive at this equivalence between SMPM and DGM requires making specific choices in the construction of both methods; these choices are addressed. In general, both methods offer a multitude of choices in the penalty terms used to introduce boundary conditions and stabilize the numerical solution. The resulting specialized class of SMPM and DGM are then applied to a suite of six commonly considered geophysical flow test cases, three linear and three non-linear; we also include results for a classical continuous Galerkin (i.e., spectral element) method for comparison. Both the analysis and numerical experiments show that the SMPM and DGM are essentially identical; both methods can be shown to be equivalent for very special choices of quadrature rules and Riemann solvers in the DGM along with special choices in the type of penalty term in the SMPM. Although we only focus our studies on the inviscid shallow water equations the results presented should be applicable to other systems of nonlinear hyperbolic equations (such as the compressible Euler equations) and extendable to the compressible and incompressible Navier-Stokes equations, where viscous terms are included.     

A moving Kriging‐based MLPG method for nonlinear Klein–Gordon equation

In this paper, the meshless local Petrov–Galerkin approximation is proposed to solve the 2‐D nonlinear Klein–Gordon equation. We used the moving Kriging interpolation instead of the MLS approximation to construct the meshless local Petrov–Galerkin shape functions. These shape functions possess the Kronecker delta function property. The Heaviside step function is used as a test function over the local sub‐domains. Here, no mesh is needed neither for integration of the local weak form nor for construction of the shape functions. So the present method is a truly meshless method. We employ a time‐stepping method to deal with the time derivative and a predictor–corrector scheme to eliminate the nonlinearity. Several examples are performed and compared with analytical solutions and with the results reported in the extant literature to illustrate the accuracy and efficiency of the presented method. Copyright © 2016 John Wiley & Sons, Ltd.     

Efficient numerical integration of arbitrarily broken cells using the moment fitting approach

The finite cell method is based on a fictitious domain approach, providing a simple and fast mesh generation of structures with complex geometries. However, this simplification leads to intersected cells where the standard Gauss quadrature does not perform well. To perform the numerical integration of these cells, we use the moment fitting approach that generates an individual quadrature rule for every broken cell. In this paper, we will perform a non-linear optimization approach to find the optimal position and number of the integration points. The findings show that the proposed method leads to efficient quadrature rules that require less integration points than other existing integration methods. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)