C k -B-splines with Square Support on a Three-Direction Mesh of the Plane

Let be the uniform triangulation generated by the usual three-directional mesh of the plane and let ₁ be the unit square consisting of two triangles of . We study the space of piecewise polynomial functions in C ^k (R ²) with support ₁ having a sufficiently high degree n, which are symmetrical with respect to the first diagonal of ₁. Such splines are called ₁-splines. We first compute the dimension of this space in function of n and k. Then, for any fixed k0, we prove the existence of ₁-splines of class C ^k and minimal degree. These splines are not unique. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of these splines, and we give an example.     

Solving Fredholm integral equations by approximating kernels by spline quasi-interpolants

We study two methods for solving a univariate Fredholm integral equation of the second kind, based on (left and right) partial approximations of the kernel K by a discrete quartic spline quasi-interpolant. The principle of each method is to approximate the kernel with respect to one variable, the other remaining free. This leads to an approximation of K by a degenerate kernel. We give error estimates for smooth functions, and we show that the method based on the left (resp. right) approximation of the kernel has an approximation order O(h ⁵) (resp. O(h ⁶)). We also compare the obtained formulae with projection methods.     

A new method for smoothing surfaces and computing hermite interpolants

Let Ω be a rectangular bounded domain of a plane equipped with a rectangular partition Δ. Assume a piecewise bivariate function that is differentiable up to order (k,l) except at the knots of Δ, where it is less differentiable. In this paper, we introduce a new method for smoothing the above function at the knots. More precisely, we describe algorithms allowing one to transform it into another function that will be differentiable up to order (k,l) in the whole domain Ω. Then, as an application of this method, we give a recursive computation of tensor product Hermite spline interpolants. To illustrate our results, some numerical examples are presented. AMS subject classification (2000)  41A05, 41A15, 65D05, 65D07, 65D10     

Bivariate Simplex Spline Quasi-Interpolants

<正>In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.     

A simple method for smoothing functions and compressing Hermite data

Let =(a=x₀<x₁<<x_n=b) be a partition of an interval [a,b] of R, and let f be a piecewise function of class C^k on [a,b] except at knots x_i where it is only of class , k_ik. We study in this paper a novel method which smooth the function f at x_i, 0in. We first define a new basis of the space of polynomials of degree 2k+1, and we describe algorithms for smoothing the function f. Then, as an application, we give a recursive computation of classical Hermite spline interpolants, and we present a method which allows us to compress Hermite data. The most part of these results are illustrated by some numerical examples. AMS subject classification 41A05, 41A15, 65D05, 65D07, 65D10     

Existence and construction of Δ1-splines of class Ck on a three-directional mesh

Let ^* be the equilateral triangulation of the plane and let ₁ ^* be the equilateral triangle formed by four triangles of ^*. We study the space of piecewise polynomial functions in C ^k (R ²) with support ₁ ^*, having a sufficiently high degree n and which are invariant with respect to the group of symmetries of ₁ ^*. Such splines are called ₁ ^*-splines. We first compute the dimension of this space in function of n and k. Then, for any fixed k0, we prove the existence of ₁ ^*-splines of class C ^k and minimal degree, but these splines are not unique. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of these splines.     

A recursive method for computing interpolants

In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R^d${\mathbb{R}}^d$. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.     

Error estimate and extrapolation of a quadrature formula derived from a quartic spline quasi-interpolant

In this paper we analyze a quadrature rule based on integrating a C ³ quartic spline quasi-interpolant on a bounded interval which has been introduced in Sablonnière (Rend. Semin. Mat. Univ. Pol. Torino 63(3):107–118, 2005). By studying the sign structure of its associated Peano kernel we derive an explicit formula of the quadrature error with an approximation order O(h ⁶). A comparison of this rule with the composite Boole’s and the three-point Gauss-Legendre rules is given. We also compare the Nyström methods associated with the above quadrature formulae for solving the linear Fredholm integral equation of the second kind. Then, by combining the proposed rule with composite Boole’s rule, we construct a new quadrature rule of order O(h ⁷). All the obtained results are illustrated by several numerical tests.     

Pairs of B-Splines with Small Support on the Four-Directional Mesh Generating a Partition of Unity

Let τ be the four-directional mesh of the plane and let Σ₁ (respectively Λ₁) be the unit square (respectively the lozenge) formed by four (respectively eight) triangles of τ. We study spaces of piecewise polynomial functions in C ^k (R ²) with supports Σ₁ or Λ₁ having sufficiently high degree n, which are invariant with respect to the group of symmetries of Σ₁ or Λ₁ and whose integer translates form a partition of unity. Such splines are called complete Σ₁ and Λ₁-splines. We first give a general study of spaces of linearly independent complete Σ₁ and Λ₁-splines of class C ^k and degree n. Then, for any fixed k≥0, we prove the existence of complete Σ₁ and Λ₁-splines of class C ^k and minimal degree, but they are not unique. Finally, we describe algorithms allowing to compute the Bernstein–Bézier coefficients of these splines.