紧区间上高斯核近似逼近误差估计的改进

本文研究了由高斯核构成的拟插值算子在闭区间上的近似逼近问题.利用函数延拓和近似单位分划的方法,构造了拟插值算子,并得到了一致范数下的逼近阶估计.     

The construction and approximation of feedforward neural network with hyp erb olic tangent function

In this paper, we discuss some analytic properties of hyperbolic tangent function and estimate some approximation errors of neural network operators with the hyperbolic tangent activation functionFirstly, an equation of partitions of unity for the hyperbolic tangent function is givenThen, two kinds of quasi-interpolation type neural network operators are constructed to approximate univariate and bivariate functions, respectivelyAlso, the errors of the approximation are estimated by means of the modulus of continuity of functionMoreover, for approximated functions with high order derivatives, the approximation errors of the constructed operators are estimated.     

Spherical interpolation using the partition of unity method: An efficient and flexible algorithm

An efficient and flexible algorithm for the spherical interpolation of large scattered data sets is proposed. It is based on a partition of unity method on the sphere and uses spherical radial basis functions as local approximants. This technique exploits a suitable partition of the sphere into a number of spherical zones, the construction of a certain number of cells such that the sphere is contained in the union of the cells, with some mild overlap among the cells, and finally the employment of an optimized spherical zone searching procedure. Some numerical experiments show the good accuracy of the spherical partition of unity method and the high efficiency of the algorithm.     

A kind of multiquadric quasi-interpolation operator satisfying any degree polynomial reproduction property to scattered data

In this paper, by virtue of using the linear combinations of the shifts of f(x) to approximate the derivatives of f(x) and Waldron’s superposition idea (2009), we modify a multiquadric quasi-interpolation with the property of linear reproducing to scattered data on one-dimensional space, such that a kind of quasi-interpolation operator L_r+1f has the property of r+1(r∈Z,r≥0) degree polynomial reproducing and converges up to a rate of r+2. There is no demand for the derivatives of f in the proposed quasi-interpolation L_r+1f, so it does not increase the orders of smoothness of f. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operators with that of Wu-Schaback’s quasi-interpolation scheme and Feng-Li’s quasi-interpolation scheme.     

The construction and approximation of some neural networks operators

In this paper,the technique of approximate partition of unity is used to construct a class of neural networks operators with sigmoidal functions.Using the modulus of continuity of function as a metric,...     

A multiquadric quasi-interpolation with linear reproducing and preserving monotonicity

In this paper, we develop a multiquadric (MQ) quasi-interpolation which has the properties of linear reproducing and preserving monotonicity. Moreover, we give its approximation error by theoretic analysis and illustrate the effect by means of two examples. One of the examples is to approach the linear combination of two sine functions with different frequencies. Another is to approximate a function with discontinuity. From the results of the examples, we believe that the present MQ quasi-interpolation is feasible.     

一种2型三角剖分上多元样条拟插值的精度提高策略

给定一个多元拟插值算子, 若其具有单位分解性质 (再生0次多项式), 我们提出一种利用其周围节点提高多项式再生性的方法. 所得算子不仅具有更高的逼近精度, 还不需要目标函数的任何导数信息. 然后利用此方法, 我们改进了2型三角剖分上的多元样条拟插值,使之具有更高的精度. 最后, 我们应用改进的拟插值算子数值求解时间发展偏微分方程. 数值实验验证了该方法的有效性.     

Numerical solution of Burgers-Fisher equation by cubic B-spline quasi-interpolation

In this paper, numerical solution of Burgers-Fisher equation is presented based on the cubic B-spline quasi-interpolation. At first, the generalized Burgers-Fisher equation and the cubic B-spline quasi-interpolation are introduced. Moreover, the numerical scheme is presented, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. Moreover, the stability of this method is studied. At last, the numerical results obtained by this way have been compared with the exact solution to show the efficiency of the method. The main advantage of the resulting scheme is that the algorithm is very simple, so it is very easy to implement.     

Error estimates for approximate approximations with Gaussian kernels on compact intervals

The aim of this paper is the investigation of the error which results from the method of approximate approximations applied to functions defined on compact intervals, only. This method, which is based on an approximate partition of unity, was introduced by Maz’ya in 1991 and has mainly been used for functions defined on the whole space up to now. For the treatment of differential equations and boundary integral equations, however, an efficient approximation procedure on compact intervals is needed.In the present paper we apply the method of approximate approximations to functions which are defined on compact intervals. In contrast to the whole space case here a truncation error has to be controlled in addition. For the resulting total error pointwise estimates and L₁-estimates are given, where all the constants are determined explicitly.     

Spherical Scattered Data Quasi-interpolation by Gaussian Radial Basis Function

Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. Seeing that target functions are usually outside the native spaces, and that one has to solve a large scaled system of linear equations to obtain combinatorial coefficients of interpolant functions, the authors first probe into some problems about interpolation with Gaussian radial functions. Then they construct quasiinterpolation operators by Gaussian radial function, and get the degrees of approximation. Moreover, they show the error relations between quasi-interpolation and interpolation when they have the same basis functions. Finally, the authors discuss the construction and approximation of the quasi-interpolant with a local support function.     

Approximation in rough native spaces by shifts of smooth kernels on spheres

Within the conventional framework of a native space structure, a smooth kernel generates a small native space, and “radial basis functions” stemming from the smooth kernel are intended to approximate only functions from this small native space. Therefore their approximation power is quite limited. Recently, Narcowich et al. (J. Approx. Theory 114 (2002) 70), and Narcowich and Ward (SIAM J. Math. Anal., to appear), respectively, have studied two approaches that have led to the empowerment of smooth radial basis functions in a larger native space. In the approach of [NW], the radial basis function interpolates the target function at some scattered (prescribed) points. In both approaches, approximation power of the smooth radial basis functions is achieved by utilizing spherical polynomials of a (possibly) large degree to form an intermediate approximation between the radial basis approximation and the target function. In this paper, we take a new approach. We embed the smooth radial basis functions in a larger native space generated by a less smooth kernel, and use them to approximate functions from the larger native space. Among other results, we characterize the best approximant with respect to the metric of the larger native space to be the radial basis function that interpolates the target function on a set of finite scattered points after the action of a certain multiplier operator. We also establish the error bounds between the best approximant and the target function.     

An energy-momentum conserving scheme for Hamiltonian wave equation based on multiquadric trigonometric quasi-interpolation

Based on multiquadric trigonometric quasi-interpolation, the paper proposes a meshless symplectic scheme for Hamiltonian wave equation with periodic boundary conditions. The scheme first discretizes the equation in space using an iterated derivative approximation method based on multiquadric trigonometric quasi-interpolation and then in time with an appropriate symplectic scheme. This in turn yields a finite-dimensional semi-discrete Hamiltonian system whose energy and momentum (approximations of the continuous ones) are invariant with respect to time. The key feature of the scheme is that it conserves both the energy and momentum of the Hamiltonian system for both uniform and scattered centers, while classical energy-momentum conserving schemes are only for uniform centers. Numerical examples provided at the end of the paper show that the scheme is efficient and easy to implement.     

Generalized Strang–Fix condition for scattered data quasi-interpolation

Quasi-interpolation is very useful in the study of the approximation theory and its applications, since the method can yield solutions directly and does not require solving any linear system of equations. However, quasi-interpolation is usually discussed only for gridded data in the literature. In this paper we shall introduce a generalized Strang–Fix condition, which is related to nonstationary quasi-interpolation. Based on the discussion of the generalized Strang–Fix condition we shall generalize our quasi-interpolation scheme for multivariate scattered data, too. AMS subject classification 41A63, 41A25, 65D10Zong Min Wu: Supported by NSFC No. 19971017 and NOYG No. 10125102.     

A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback’s quasi-interpolation scheme.     

Local and parallel finite element algorithm based on the partition of unity method for the incompressible MHD flow

Based on the partition of unity method (PUM), a local and parallel finite element method is designed and analyzed for solving the stationary incompressible magnetohydrodynamics (MHD). The key idea of the proposed algorithm is to first solve the nonlinear system on a coarse mesh, divide the globally fine grid correction into a series of locally linearized residual problems on some subdomains derived by a class of partition of unity, then compute the local subproblems in parallel, and obtain the globally continuous finite element solution by assembling all local solutions together by the partition of unity functions. The main feature of the new method is that the partition of unity provide a flexible and controllable framework for the domain decomposition. Finally, the efficiency of our theoretical analysis is tested by numerical experiments.     

固体中短波传播的单位分解有限元法

提出了固体中短波传播数值模拟的单位分解有限元法．有限元空间由形成单位分解的标准等参有限元形函数乘以定义为局部子空间基函数的特殊形函数构成．特殊形函数使试空间中包含了关于波动方程的已有知识,因而在单个单元内能近似地再现高度振荡性质．数值例题显示了所提出单位分解有限元在计算精度和效率上的良好性能．     

A general radial quasi-interpolation operator on the sphere

Geodetic and meteorological data, collected via satellites for example, are genuinely scattered and not confined to any special set of points. In order to learn geodetic and meteorological rules, one needs to use these scattered data only to construct an approximant or interpolant. In this paper, we introduce a general distance generated from the scattered data, and, using this, construct a general radial quasi-interpolation operator on the sphere, and we study the convergence rate of this operator. We also show some potential applications of the results obtained here in satellite geodesy.     

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

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

A new efficient DQ algorithm for the solution of elliptic problems in higher dimensions

Two new efficient algorithms are developed to approximate the derivatives of sufficiently smooth functions. The new techniques are based on differential quadrature method with quartic B-spline bases as test functions. To obtain the weighting coefficients of differential quadrature method (DQM), we use the midpoints of a uniform partition mixed with near-boundary grid points. This enables us to obtain the weighting coefficients without adding the new extra relations. By obtaining the error bounds, it is proved that the method in its classic form is non-optimal. Then, some new weighting coefficients are constructed to obtain higher accuracy. By obtaining the error bounds, it is proved that the new algorithm is superconvergent. Afterwards, by defining some new symbols, we find a way to approximate the partial derivatives of multivariate functions. Also, some approximations are constructed to the mixed derivatives of multivariate functions. Finally, the applicability of the methods is examined by solving some well-known problems of partial differential equations. Some examples of 2D and 3D biharmonic, Poisson, and convection-diffusion equations are solved and compared to the existing methods to show the efficiency of the proposed algorithms.     

A new family of high regularity elements

In this article, we propose a new family of high regularity finite element spaces. The global approximation spaces are obtained in two steps. We first build an open cover of the computational domain and local approximation spaces on each patch of the cover. Then we construct partition of unity functions subordinate to the open cover depending on the regularity requirement. The basis functions of the global space is given by the products of the local basis functions and the corresponding partition of unity functions. The method can be used to construct finite element spaces of any desired regularity. Approximation properties and implementation details are discussed. Numerical examples for the biharmonic equation are presented to show the effectiveness of the proposed method. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 28: 1–16, 2012