Shape preserving representations and optimality of the Bernstein basis

This paper gives an affirmative answer to a conjecture given in [10]: the Bernstein basis has optimal shape preserving properties among all normalized totally positive bases for the space of polynomials of degree less than or equal ton over a compact interval. There is also a simple test to recognize normalized totally positive bases (which have good shape preserving properties), and the corresponding corner cutting algorithm to generate the Bézier polygon is also included. Among other properties, it is also proved that the Wronskian matrix of a totally positive basis on an interval [a, ) is also totally positive.Both authors were partially supported by DGICYT PS90-0121.     

Fourier transforms and generalized Lipschitz classes in uniform metric

For functions f∈L¹(R)∩C(R) with Fourier transforms in L¹(R) we give necessary and sufficient conditions for f to belong to the generalized Lipschitz classes Hω,m and hω,m in terms of behavior of .     

Interpolating polynomial wavelets on [−1,1]

The present paper gives a contribution of wavelet aspects to classical algebraic polynomial approximation theory. As is so often the case in classical approximation, the authors follow the pattern provided by the trigonometric polynomial case. Algebraic polynomial interpolating scaling functions and wavelets are constructed by using the interpolation properties of de la Vallée Poussin kernels with respect to the four kinds of Chebyshev weights. For the decomposition and reconstruction of a given function the structure of the involved matrices is studied in order to reduce the computational effort by means of fast discrete cosine and sine transforms. Dedicated to Prof. Guiseppe Mastroianni on the occasion of his 65th birthday.AMS subject classification 65D05, 65T60     

Weak subordination for convex univalent harmonic functions

For two complex-valued harmonic functions f and F defined in the open unit disk Δ with f(0)=F(0)=0, we say f is weakly subordinate to F if f(Δ)⊂F(Δ). Furthermore, if we let E be a possibly infinite interval, a function with f(⋅,t) harmonic in Δ and f(0,t)=0 for each t∈E is said to be a weak subordination chain if f(Δ,t₁)⊂f(Δ,t₂) whenever t₁,t₂∈E and t₁<t₂. In this paper, we construct a weak subordination chain of convex univalent harmonic functions using a harmonic de la Vallée Poussin mean and a modified form of Pommerenke's criterion for a subordination chain of analytic functions.     

Constructing C3 shape preserving interpolating space curves

We present a method for constructing shape-preserving C ³ interpolants in R ³. The resulting curve is obtained by adding a polynomial perturbation of high degree to a curve which is shape-preserving but not sufficiently smooth. The degree of the perturbed curve is selected in order to maintain the shape properties of the basic curve.     

On a conjecture of S.P. Robinson

In his thesis, S.P. Robinson made a conjecture concerning the polynomials

     

三次一致切矢非均匀割角曲线

研究了三次一致切矢非均匀割角 (UNC)曲线的性质 ,形状因子的作用 ,拼接方法 ,并按此法给出了用于逼近给定控制多边形的方法 .     

Shape analysis of cubic trigonometric Bézier curves with a shape parameter

For the cubic trigonometric polynomial curves with a shape parameter (TB curves, for short), the effects of the shape parameter on the TB curve are made clear, the shape features of the TB curve are analyzed. The necessary and sufficient conditions are derived for these curves having single or double inflection points, a loop or a cusp, or be locally or globally convex. The results are summarized in a shape diagram of TB curves, which is useful when using TB curves for curve and surface modeling. Furthermore the influences of shape parameter on the shape diagram and the ability for adjusting the shape of the curve are shown by graph examples, respectively.     

Sample-based polynomial approximation of rational Bézier curves

We present an iteration method for the polynomial approximation of rational Bézier curves. Starting with an initial Bézier curve, we adjust its control points gradually by the scheme of weighted progressive iteration approximations. The L_p-error calculated by the trapezoidal rule using sampled points is used to guide the iteration approximation. We reduce the L_p-error by a predefined factor at every iteration so as to obtain the best approximation with a minimum error. Numerical examples demonstrate the fast convergence of our method and indicate that results obtained using the L₁-error criterion are better than those obtained using the L₂-error and L_∞-error criteria.