Effective and accurate high-degree spline interpolation is still a challenging task in today’s applications. Higher degree spline interpolation is not so commonly used, because it requires the knowledge of higher order derivatives at the nodes of a function on a given mesh.

In this article, our goal is to demonstrate the continuity of the piecewise polynomials and their derivatives at the connecting points, obtained with a method initially developed by Beaudoin (1998, 2003) and Beauchemin (2003). This new method, involving the discrete Fourier transform (DFT/FFT), leads to higher degree spline interpolation for equally spaced data on an interval $[0,T]$. To do this, we analyze the singularities that may occur when solving the system of equations that enables the construction of splines of any degree. We also note an important difference between the odd-degree splines and even-degree splines. These results prove that Beaudoin and Beauchemin’s method leads to spline interpolation of any degree and that this new method could eventually be used to improve the accuracy of spline interpolation in traditional problems.

The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis {1,x,x2,...,xn}. The maximum entropy method for the Chebyshev moment probelm was studied to overcome this drawback in. In this paper we review and modify the maximum entropy method for the Hausdorff and Chebyshev moment problems studied in and present the maximum entropy method for the Legendre moment problem. We also give the algorithms of converting the Hausdorff moments into the Chebyshev and Lengendre moments, respectively, and utilizing the corresponding maximum entropy method.

Grafakos and Sansing [‘Gabor frames and directional time–frequency analysis’, Appl. Comput. Harmon. Anal.25 (2008), 47–67] have shown how to obtain directionally sensitive time–frequency decompositions in $L^{2}(\mathbb{R}^{n})$ based on Gabor systems in $L^{2}(\mathbb{R})$. The key tool is the ‘ridge idea’, which lifts a function of one variable to a function of several variables. We generalise their result in two steps: first by showing that similar results hold starting with general frames for $L^{2}(\mathbb{R}),$ in the settings of both discrete frames and continuous frames, and second by extending the representations to Sobolev spaces. The first step allows us to apply the theory to several other classes of frames, for example wavelet frames and shift-invariant systems, and the second one significantly extends the class of examples and applications. We consider applications to the Meyer wavelet and complex B-splines. In the special case of wavelet systems we show how to discretise the representations using ${\it\epsilon}$-nets.

Polynomials for blending parametric curves in Lie groups are defined. Properties of these polynomials are proved. Blending parametric curves in Lie groups with these polynomials is considered. Then application of the proposed technique to construction of spline curves on smooth manifolds is presented. As an example, construction of spherical spline curves using the proposed approach is depicted.

For the approximation in Lp-norm, we determine the weakly asymptotic orders for the simultaneous approximation errors of Sobolev classes by piecewise cubic Hermite interpolation with equidistant knots. For p = 1, ∞, we obtain its values. By these results we know that for the Sobolev classes, the approximation errors by piecewise cubic Hermite interpolation are weakly equivalent to the corresponding infinite-dimensional Kolmogorov widths. At the same time, the approximation errors of derivatives are weakly equivalent to the corresponding infinite-dimensional Kolmogorov widths.

This paper proposes a new family of symmetric $4$-point ternary non-stationary subdivision schemes  that can generate the limit curves of $C^3$ continuity. The continuity of this scheme is higher than the existing 4-point ternary approximating schemes. The proposed scheme has been developed using trigonometric B-spline basis functions and analyzed using the theory of asymptotic equivalence. It has the ability to reproduce or regenerate the conic sections, trigonometric polynomials and trigonometric splines as well. Some graphical and numerical examples are being considered, by choosing an appropriate tension parameter $0<\alpha <\pi /3 $, to show the usefulness of the proposed scheme. Moreover, the Hölder regularity and the reproduction property are also being calculated.

We present generalized and unified families of (2n)-point and (2n — 1)-point p-ary interpolating subdivision schemes originated from Lagrange polynomial for any integers n ≥ 2 and p ≥ 3. Almost all existing even-point and odd-point interpolating schemes of lower and higher arity belong to this family of schemes. We also present tensor product version of generalized and unified families of schemes. Moreover error bounds between limit curves and control polygons of schemes are also calculated. It has been observed that error bounds decrease when complexity of the scheme decrease and vice versa. Furthermore, error bounds decrease with the increase of arity of the schemes. We also observe that in general the continuity of interpolating scheme do not increase by increasing complexity and arity of the scheme.

In this paper, based on the basis composed of two sets of splines with distinct local supports, cubic spline quasi-interpolating operators are reviewed on nonuniform type-2 triangulation. The variation diminishing operator is defined by discrete linear functionals based on a fixed number of triangular mesh-points, which can reproduce any polynomial of nearly best degrees. And by means of the modulus of continuity, the estimation of the operator approximating a real sufficiently smooth function is reviewed as well. Moreover, the derivatives of the nearly optimal variation diminishing operator can approximate that of the real sufficiently smooth function uniformly over quasi-uniform type-2 triangulation. And then the convergence results are worked out.

In this paper, the dimension of the nonuniform bivariate spline space is discussed based on the theory of multivariate spline space. Moreover, by means of the Conformality of Smoothing Cofactor Method, the basis of composed of two sets of splines are worked out in the form of the values at ten domain points in each triangular cell, both of which possess distinct local supports. Furthermore, the explicit coefficients in terms of B-net are obtained for the two sets of splines respectively.

In this article, we begin by recalling the inversion formula for the convolution with the box spline. The equivariant cohomology and the equivariant $K$-theory with respect to a compact torus $G$ of various spaces associated to a linear action of $G$ in a vector space $M$ can both be described using some vector spaces of distributions, on the dual of the group $G$ or on the dual of its Lie algebra $\mathfrak{g}$. The morphism from $K$-theory to cohomology is analyzed, and multiplication by the Todd class is shown to correspond to the operator (deconvolution) inverting the semi-discrete convolution with a box spline. Finally, the multiplicities of the index of a $G$-transversally elliptic operator on $M$ are determined using the infinitesimal index of the symbol.

This paper explores the possibilities of very simple analysis on derivation of spiral regions for a single segment of cubic function matching positional, tangential, and curvature end conditions. Spirals are curves of monotone curvature with constant sign and have the potential advantage that the minimum and maximum curvature exists at their end points. Therefore, spirals are free from singularities, inflection points, and local curvature extrema. These properties make the study of spiral segments an interesting problem both in practical and aesthetic applications, like highway or railway designing or the path planning of non-holonomic mobile robots. Our main contribution is to simplify the procedure of existence methods while keeping it stable and providing flexile constraints for easy applications of spiral segments.

Let S: [0, 1]→[0, 1] be a chaotic map and let f* be a stationary density of the Frobenius-Perron operator PS: L1→L1 associated with S. We develop a numerical algorithm for approximating f*, using the maximum entropy approach to an under-determined moment problem and the Chebyshev polynomials for the stability consideration. Numerical experiments show considerable improvements to both the original maximum entropy method and the discrete maximum entropy method.

In this paper we derive local error estimates for radial basis function interpolation on the unit sphere . More precisely, we consider radial basis function interpolation based on data on a (global or local) point set for functions in the Sobolev space with norm , where s>1. The zonal positive definite continuous kernel ϕ, which defines the radial basis function, is chosen such that its native space can be identified with . Under these assumptions we derive a local estimate for the uniform error on a spherical cap S(z;r): the radial basis function interpolant ΛXf of satisfies , where h=hX,S(z;r) is the local mesh norm of the point set X with respect to the spherical cap S(z;r). Our proof is intrinsic to the sphere, and makes use of the Videnskii inequality. A numerical test illustrates the theoretical result.

Quintic B-spline collocation schemes for numerical solution of the regularized long wave (RLW) equation have been proposed. The schemes are based on the Crank–Nicolson formulation for time integration and quintic B-spline functions for space integration. The quintic B-spline collocation method over finite intervals is also applied to the time-split RLW equation and space-split RLW equation. After stability analysis is applied to all the schemes, the results of the three algorithms are compared by studying the propagation of the solitary wave, interaction of two solitary waves and wave undulation.