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 ba...

The aim of this work is to find numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N . The solutions are exact at these points, apart from round-off computer errors and the convergence of o...

The paper extends the applicability of our Matlab package Chebpack to find (generalized) Chebyshev polynomial approximations of the solutions of some Abel integral equations with algebraic singularities. Numerical examples confirm the efficiency of this approach.

In this note, we consider a question of Móri regarding estimating the deviation of the kth terms of two discrete probability distributions in terms of the supremum distance between their generating functions over the interval [0, 1]. An optimal bound for distributions on finite support is obtained. Properties of Chebyshev polynomials are employed.

Faber polynomials corresponding to rational exterior mapping functions of degree (m,m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are de...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

Given a probability measure μ with infinite support on the unit circle ∂D = {z : |z| = 1}, we consider a sequence of paraorthogonal polynomials hn(z, λ) vanishing at z = λ where λ ∈ ∂D is fixed. We prove that for any fixed z0 6∈ supp(dμ) distinct from λ, we can find an explicit ρ > 0 independent of n such that either hn or hn+1 (or both) has no zero inside the disk B(z0, ρ), with the possible e...

In his Ph.D. Thesis of 1897, Dickson introduced certain permutation polynomials whose Galois groups are essentially the dihedral groups. These are now called Dickson polynomials of the first kind, to distinguish them from their variations introduced by Schur in 1923, which are now called Dickson polynomials of the second kind. In the last few decades there have been extensive investigations of ...