This paper addresses the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. The basic idea of the approach is to find the conditions for precise merging of two B-spline curves, and perturb the control points of the curves by constrained optimization subject to satisfying these conditions. To obtain a merged curve without superfluous knots, we present a new k...

Electronic mail is very important in present time. Many researchers work for designing, improving, securing, fasting, goodness and others fields in electronic mail. This paper introduced new algorithm to use Cantor sets and cubic spline interpolating function in the electronic mail design. Cantor sets used as the area (or domain) of the mail, while spline function used for designing formula. Th...

New approaches of particle swarm optimisation algorithm based on Gaussian and Cauchy distributions to adjust the control points of B-spline neural networks are proposed. B-spline networks are trained by gradient-based methods, which may fall into local minimum during the learning procedure. To overcome the problems encountered by the conventional learning methods, particle swarm optimisation  ...

In this paper we first revisit a classical problem of computing variational splines. We propose to compute local variational splines in the sense that they are interpolatory splines which minimize the energy norm over a subinterval. We shall show that the error between local and global variational spline interpolants decays exponentially over a fixed subinterval as the support of the local vari...

This paper generalizes the classical spline using a new construction of spline coalescence hidden variable fractal interpolation function (CHFIF). The derivative of a spline CHFIF is a typical fractal function that is self-affine or non-self-affine depending on the parameters of a nondiagonal iterated function system. Our construction generalizes the construction of Barnsley and Harrington (198...