Variable degree polynomial splines are Chebyshev splines

Variable degree polynomial (VDP) splines have recently proved themselves as a valuable tool in obtaining shape preserving approximations. However, some usual properties which one would expect of a spline space in order to be useful in geometric modeling, do not follow easily from their definition. This includes total positivity (TP) and variation diminishing, but also constructive algorithms based on knot insertion. We consider variable degree polynomial splines of order $k\geqslant 2$ spanned by $\{ 1,x,\ldots x^{k-3},(x-x_i)^{m_i-1},(x_{i+1}-x)^{n_i-1} \}$ on each subinterval $[x_i,x_{i+1}\rangle\subset [0,1]$ , i?=?0,1, ...l. Most of the paper deals with non-polynomial case m _i ,n _i ?∈?[4,?∞?), and polynomial splines known as VDP–splines are the special case when m _i , n _i are integers. We describe VDP–splines as being piecewisely spanned by a Canonical Complete Chebyshev system of functions whose measure vector is determined by positive rational functions p(x), q(x). These functions are such that variable degree splines belong piecewisely to the kernel of the differential operator $\frac{d}{dx} p \frac{d}{dx} q \frac{d^{k-2}} {dx^{k-2}}$ . Although the space of splines is not based on an Extended Chebyshev system, we argue that total positivity and variation diminishing still holds. Unlike the abstract results, constructive properties, like Marsden identity, recurrences for quasi-Bernstein polynomials and knot insertion algorithms may be more involved and we prove them only for VDP splines of orders 4 and 5.     

A note on Chebyshev polynomials

New families of generating functions and identities concerning the Chebyshev polynomials are derived. It is shown that the proposed method allows the derivation of sum rules involving products of Chebyshev polynomials and addition theorems. The possiblity of extending the results to include gnerating functions involving products of Chebyshev and other polynomials is finally analyzed.

---

Sunto Si derivano nuove famiglie di funzioni generatrici e di identità relative ai polinomi di Chebyshev. Si dimostra che il metodo proposto permette la derivazione di regole di somma relative a prodotti di polinomi di Chebyshev e teoremi di addizione. La possibilità di estendere i risultati includendos funzioni generatrici di prodotti di polinomi di Chebyshev ed altri polinomi è infine analizzata.

     

A note on the degree of approximation with an optimal, discrete polynomial

A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebraic polynomial operator. The operator is based on the Gauss-Legendre quadrature formula.     

A note on semidefinite programming relaxations for polynomial optimization over a single sphere

We study two instances of polynomial optimization problem over a single sphere. The first problem is to compute the best rank-1 tensor approximation. We show the equivalence between two recent semidefinite relaxations methods. The other one arises from Bose-Einstein condensates (BEC), whose objective function is a summation of a probably nonconvex quadratic function and a quartic term. These two polynomial optimization problems are closely connected since the BEC problem can be viewed as a structured fourth-order best rank-1 tensor approximation. We show that the BEC problem is NP-hard and propose a semidefinite relaxation with both deterministic and randomized rounding procedures. Explicit approximation ratios for these rounding procedures are presented. The performance of these semidefinite relaxations are illustrated on a few preliminary numerical experiments.     

A note on realizing polynomial algebras

We characterize the polynomial algebras overZ which are realizable as the integral cohomology of some space, under the assumption that there are not two generators in the same dimension.     

A note on stability of polynomial equations

Motivated by the notion of Ulam’s type stability and some recent results of S.-M. Jung, concerning the stability of zeros of polynomials, we prove a stability result for functional equations that have polynomial forms, considerably improving the results in the literature.     

Chebyshev approximation by first degree rationals on 2-space

The uniqueness problem for Chebyshev approximation on compact subsets of 2-space by the family of ratios of constants to first degree polynomials is studied.     

A note on the signs of truncated Chebyshev polynomials

When one or more of the lowest degree terms are removed from the power series form of a Chebyshev polynomialT _n (x), the resulting polynomial is found to be of constant sign, a fact which is of importance when analysing the stability of polynomial evaluation schemes.     

High dimensional polynomial interpolation on sparse grids

We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using up to 652 065 interpolation points. This revised version was published online in June 2006 with corrections to the Cover Date.     

An efficient alternating minimization method for fourth degree polynomial optimization

Journal of Global Optimization - In this paper, we consider a class of fourth degree polynomial problems, which are NP-hard. First, we are concerned with the bi-quadratic optimization problem...     

A note on fast Fourier transforms for nonequispaced grids

In this paper, we are concerned with fast Fourier transforms for nonequispaced grids. We propose a general efficient method for the fast evaluation of trigonometric polynomials at nonequispaced nodes based on the approximation of the polynomials by special linear combinations of translates of suitable functions ϕ. We derive estimates for the approximation error. In particular, we improve the estimates given by Dutt and Rokhlin [7]. As a practical consequence, we obtain a criterion for the choice of the parameters involved in the fast transforms. This revised version was published online in August 2006 with corrections to the Cover Date.     

A Chebyshev polynomial method for line integrals with singularities

In this paper we consider a Chebyshev polynomial method for the calculation of line integrals along curves with Cauchy principal value or Hadamard finite part singularities. The major point we address is how to reconstruct the value of the integral when the parametrization of the curve is unknown and only empirical data are available at some discrete set of nodes. We replace the curve by a near‐minimax parametric polynomial approximation, and express the integrand by means of a sum of Chebyshev polynomials. We make use of a mapping property of the Hadamard finite part operator to calculate the value of the integral. This revised version was published online in June 2006 with corrections to the Cover Date.     

A note on orthonormal polynomial bases and wavelets

A simple and explicit construction of an orthnormal trigonometric polynomial basis in the spaceC of continuous periodic functions is presented. It consists simply of periodizing a well-known wavelet on the real line which is orthonormal and has compactly supported Fourier transform. Trigonometric polynomials resulting from this approach have optimal order of growth of their degrees if their indices are powers of 2. Also, Fourier sums with respect to this polynomial basis are projectors onto subspaces of trigonometric polynomials of high degree, which implies almost best approximation properties.     

A note on character sums with polynomial arguments

An improvement of Weil bound for a class of polynomials over GF(2ⁿ) is obtained.     

Baer环和拟-Baer环的多项式扩张的一点注记

I1和I2分别是环R的一个左理想和右理想,T1=R[x]和T2=R[x,x-1]分别表示多项式环和洛朗多项式环.首先给出两个例子,分别说明了T1I1不一定是T1的左理想与T2L2不一定是T2的右理想.其次给出了环的多项式扩张及洛朗扩张的理想的性质.最后证明了,若R[X](R[x,x-1])是拟-Baer环,则R也是拟-...     

A note on polynomial splines with free knots

It is observed that the tangent spaces to sets of splines with free knots can often be characterized as spaces of splines with fixed knots. It follows that some recent theorems on nonlinear approximation are applicable in this setting.This work was supported in part by the National Science Foundation.