Cubic Splines with Minimal Norm

Natural cubic interpolatory splines are known to have a minimal L ₂-norm of its second derivative on the C ² (or W ₂ ² ) class of interpolants. We consider cubic splines which minimize some other norms (or functionals) on the class of interpolatory cubic splines only. The cases of classical cubic splines with defect one (interpolation of function values) and of Hermite C ¹ splines (interpolation of function values and first derivatives) with spline knots different from the points of interpolation are discussed.     

A semi-discretization method based on quartic splines for solving one-space-dimensional hyperbolic equations

In this paper, based on C³ quartic splines, a semi-discretization method containing two schemes is constructed to solve one-space-dimensional linear hyperbolic equations. It is shown that both schemes are unconditionally stable and their approximation orders are of O(k⁵+h⁴) and of O(k⁷+h⁴) with k and h being step sizes in time and space, respectively, which are much higher than those of other published schemes. A numerical example is presented and the results are compared with other published numerical results.     

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.     

Basis of splines associated with some singular differential operators

Functions being piecewise in Ker (D ^k DpD) are a special case of Chebyshev splines having one nontrivial weight and also a special case of singular splines. An algorithm is designed which enables calculating with related B-splines and their derivatives. Ifp(t) is approximated by a piecewise constant, an interesting recurrence for calculating with polynomial B-splines is obtained.     

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.     

Existence and Construction of H 1-Splines of Class C k on a Three Directional Mesh

Let be the uniform triangulation generated by the usual three directional mesh of the plane and let H ₁ be the regular hexagon formed by the six triangles of surrounding the origin. We study the space of piecewise polynomial functions in C ^k (R ²) with support H ₁ having a sufficiently high degree n, which are invariant with respect to the group of symmetries of H ₁ and whose sum of integer translates is constant. Such splines are called H ₁-splines. We first compute the dimension of this space in function of n and k. Then we prove the existence of a unique H ₁-spline of minimal degree for any fixed k0. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of this spline.     

Quintic trigonometric spline based numerical scheme for nonlinear modified Burgers' equation

This paper presents a numerical method based on quintic trigonometric B‐splines for solving modified Burgers' equation (MBE). Here, the MBE is first discretized in time by Crank–Nicolson scheme and the resulting scheme is solved by quintic trigonometric B‐splines. The proposed method tackles nonlinearity by using a linearization process known as quasilinearization. A rigorous analysis of the stability and convergence of the proposed method are carried out, which proves that the method is unconditionally stable and has order of convergence O(h⁴ + k²). Numerical results presented are very much in accordance with the exact solution, which is established by the negligible values of L₂ and L_∞ errors. Computational efficiency of the scheme is proved by small values of CPU time. The method furnishes results better than those obtained by using most of the existing methods for solving MBE.     

Non-uniform exponential tension splines

We describe explicitly each stage of a numerically stable algorithm for calculating with exponential tension B-splines with non-uniform choice of tension parameters. These splines are piecewisely in the kernel of D ²(D ²–p ²), where D stands for ordinary derivative, defined on arbitrary meshes, with a different choice of the tension parameter p on each interval. The algorithm provides values of the associated B-splines and their generalized and ordinary derivatives by performing positive linear combinations of positive quantities, described as lower-order exponential tension splines. We show that nothing else but the knot insertion algorithm and good approximation of a few elementary functions is needed to achieve machine accuracy. The underlying theory is that of splines based on Chebyshev canonical systems which are not smooth enough to be ECC-systems. First, by de Boor algorithm we construct exponential tension spline of class C ¹, and then we use quasi-Oslo type algorithms to evaluate classical non-uniform C ² tension exponential splines.      

Uniform Elliptic Estimate for an Infinite Plate in Linear Elasticity

Abstract

We present a new study of linear elasticity for an infinite three-dimensional plate of finite thickness Ω = ?² × (?1, 1). We first characterize the kernel of the operator of elasticity as polynomials which can be build from the kernel of the classical Kirchhoff–Love model of plate. Using this characterization, we get optimal uniform elliptic estimates W ^{k, p} , C ^{k, α} on the solution as a function of the exterior forces. We also give an interior estimate.     

Three-Convex Approximation by Free Knot Splines in C [0, 1]

A Jackson-type estimate is obtained for the approximation of 3 -convex functions by 3 -convex splines with free knots. The order of approximation is the same as for the Jackson-type estimate for unconstrained approximation by splines with free knots. Shape-preserving free knot spline approximation of k -convex functions, k > 3 , is also considered. January 15, 1996. Date revised: December 9, 1996.     

Splines (with optimal knots) are better

Let S^M _k be the Polynominal splines of degree n-1, and with K segments. If f∈ C ⁿ [a,b],then the distance in the L^p-norm form(0< p ≦ ∞)of from S ^M _k is boundedby M/K ⁿ , with a much smaller M than in similar estimates for other processes of approximation.     

The Qualocation Method for Symm's Integral Equation on a Polygon

This paper discusses the convergence of the qualocation method for Symm's integral equation on closed polygonal boundaries in IR². Qualocation is a Petrov-Galerkin method in which the outer integrals are performed numerically by special quadrature rules. Before discretisation a nonlinear parametrisation of the polygon is introduced which varies more slowly than arc-length near each corner and leads to a transformed integral equation with a regular solution. We prove that the qualocation method using smoothest splines of any order k on a uniform mesh (with respect to the new parameter) converges with optimal order O (h^k). Furthermore, the method is shown to produce superconvergent approximations to linear functionals, retaining the same high convergence rates as in the case of a smooth curve.     

On explicit basis of bivariate spline space

For a subdivision Δ of a region in d-dimensional Euclidean space, we consider computation of dimension and of basis function in spline space S _k ^r (Δ) consisting of all C piecewise polynomial functions over Δ of degree at most k. A computational scheme is presented for computing the dimension and bases of spline space S _k ^r (Δ). This scheme based on the Grobner basis algorithm and the smooth co-factor method for computing multivariate spline. For bivariate splines, explicit basis functions of S _k ^r (Δ) are obtained for any integer k and r when Δ is a cross-cut partition. The Project is partly supported by the Science and Technology New Star Plan of Beijing and Education Committee of Beijing.     

Uniform bounds for cardinal Hermite spline operators with double knots

A method is given for computing the uniform norm of the cardinal Hermite spline operator. This is the operator that takes two bounded biinfinite sequences of numbers into the unique bounded spline of degree 2k − 1(k 2) with knots of multiplicity two at the integers and that interpolates the two given sequences for both functional and first derivative values at the integers. The computational schema relies on knowledge of the Bernoulli splines, while the theoretical aspects make use of some properties of zeros of periodic splines.     

Classification of Refinable Splines in ℝ d

A refinable spline in ℝ ^d is a compactly supported refinable function whose support can be decomposed into simplices such that the function is a polynomial on each simplex. The best-known refinable splines in ℝ ^d are the box splines. Refinable splines play a key role in many applications, such as numerical computation, approximation theory and computer-aided geometric design. Such functions have been classified in one dimension in Dai et al. (Appl. Comput. Harmon. Anal. 22(3), 374–381, 2007), Lawton et al. (Comput. Math. 3, 137–145, 1995). In higher dimensions Sun (J. Approx. Theory 86, 240–252, 1996) characterized those splines when the dilation matrices are of the form A=mI, where m∈ℤ and I is the identity matrix. For more general dilation matrices the problem becomes more complex. In this paper we give a complete classification of refinable splines in ℝ ^d for arbitrary dilation matrices A∈M _d (ℤ).     

On the k-sample Behrens-Fisher problem for high-dimensional data

For several decades, much attention has been paid to the two-sample Behrens-Fisher (BF) problem which tests the equality of the means or mean vectors of two normal populations with unequal variance/covariance structures. Little work, however, has been done for the k-sample BF problem for high dimensional data which tests the equality of the mean vectors of several high-dimensional normal populations with unequal covariance structures. In this paper we study this challenging problem via extending the famous Scheffe’s transformation method, which reduces the k-sample BF problem to a one-sample problem. The induced one-sample problem can be easily tested by the classical Hotelling’s T ² test when the size of the resulting sample is very large relative to its dimensionality. For high dimensional data, however, the dimensionality of the resulting sample is often very large, and even much larger than its sample size, which makes the classical Hotelling’s T ² test not powerful or not even well defined. To overcome this difficulty, we propose and study an L ²-norm based test. The asymptotic powers of the proposed L ²-norm based test and Hotelling’s T ² test are derived and theoretically compared. Methods for implementing the L ²-norm based test are described. Simulation studies are conducted to compare the L ²-norm based test and Hotelling’s T ² test when the latter can be well defined, and to compare the proposed implementation methods for the L ²-norm based test otherwise. The methodologies are motivated and illustrated by a real data example. The work was supported by the National University of Singapore Academic Research Grant (Grant No. R-155-000-085-112)     

Smooth approximations without critical points

In any separable Banach space containing c ₀ which admits a C ^k-smooth bump, every continuous function can be approximated by a C ^k-smooth function whose range of derivative is of the first category. Moreover, the approximation can be constructed in such a way that its derivative avoids a prescribed countable set (in particular the approximation can have no critical points). On the other hand, in a Banach space with the RNP, the range of the derivative of every smooth bounded bump contains a set residual in some neighbourhood of zero.     

A projected subgradient method for solving generalized mixed variational inequalities

We consider the projected subgradient method for solving generalized mixed variational inequalities. In each step, we choose an ε_k-subgradient u^k of the function f and w^k in a set-valued mapping T, followed by an orthogonal projection onto the feasible set. We prove that the sequence is weakly convergent.     

旗传递5-(v,k,2)设计的分类

本文研究了5-(v,k,2)设计的分类问题.利用典型群PSL(2,q)的子群作用于投影线的轨道定理,证明了旗传递5-(v,k,2)设计的自同构群的基柱不能与PSL(2,3n)同构.从而证明了不存在旗传递的5-(v,k,2)设计.