In this paper,a Boolean Sum algorithm is presented for constructing C1 rational interpolation function over an arbitrary triangles. The algorithm is simple to construct and easy to calculate,and its approximate order is 0(h9). Its algebraic precision set includes all polynomials of degree≤3.Finally, a numerical example is given.
By takins Boolean sum of projective operator and Taylor operator as interpolating operator, A method forconstructing Cn interpolating functions of arbitrary trinnghs is presented. The method is easy to construct , and its the orderof approximation is O(h3n+3)
In this paper,basic theory of the sticker model was introduced,then we gave the information representative method of Boolean matrix and realized Boolean sum operation based on sticker model. The proposed method demonstrated the massive parallelism of DNA computing.
In this paper, by modulus of smoothness and qualities of polynomial of best approximation, we discuss the approximation qualities by the iterated Boolean sums of Bernstein-Kantorovich operators,for functions which are defined in the space L_p[0,1]. Also we give the direct theorem, weak inverse inequality and equivalent theorem.
In this paper, the fundamental theory of coons interpolation is studied, and the general method to construct coons interpolation surface presented. At the same time, the Boole sum approximation and its error estimates are also discussed.
It was extended to C~(N-1) situation through Hermite interpolation primary function. In this process, the compatibility condition was proposed. Namely is the mix-partial derivative of the function to be possible to exchange in the vertex.
A new clustering algorithm CAC is presented. Compared with the existing clustering algorithms, CAC can cluster Boolean and categorical data efficiently. The experimental results show that CAC achieves a much better performance than those traditional algorithms.
A new method of rational Boolean sum interpolation on an arbitrary triangle is developed in this paper. The structure of the interpolation function is simple. In case of C' interpolation, the polynomial precise set includes all polynomials of degree five or less. The approximate errors of the interpolation function are also estimated in this paper.
In this paper the rational convex combination of two operator is constructed in standard tringle.In an arbitrary, two approximation ways is presented.One is Boolean sum approximation, the other is convex combination approximation,We still make discretization for two methods in an arbitrary triangle. Finally, a example is given.