A Note on Equivalent Theorem for Beta Operators

In this paper, we give an equivalent theorem concerning on the whole interval [0, +∞). Both the direct and converse theorems are derived. These results bridge the gap between the point-wise conclusions and global conclusions.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

Behavior of alternation points in best rational approximation

The behavior of the equioscillation points (alternants) for the error in best uniform approximation on [–1, 1] by rational functions of degreen is investigated. In general, the points of the alternants need not be dense in [–1, 1], even when approximation by rational functions of degree (m, n) is considered and asymptoticallym/n 1. We show, however, that if more thanO(logn) poles of the approximants stay at a positive distance from [–1, 1], then asymptotic denseness holds, at least for a subsequence. Furthermore, we obtain stronger distribution results when n (0 < 1) poles stay away from [–1, 1]. In the special case when a Markoff function is approximated, the distribution of the equioscillation points is related to the asymptotics for the degree of approximation.The research of this author was supported, in part, by NSF grant DMS 920-3659.     

Local approximation results for Szász-Mirakjan type operators

In this study, motivating our earlier work [O. Duman and M.A. ?zarslan, Szász-Mirakjan type operators providing a better error estimation. Appl. Math. Lett. 20, 1184–1188 (2007)], we investigate the local approximation properties of Szász-Mirakjan type operators. The second modulus of smoothness and Petree’s K-functional are considered in proving our results. Received: 17 September 2007     

On the bivariate Shepard-Lidstone operators

We propose a new combination of the bivariate Shepard operators (Coman and Trîmbi?a?, 2001 [2]) by the three point Lidstone polynomials introduced in Costabile and Dell’Accio (2005) [7]. The new combination inherits both degree of exactness and Lidstone interpolation conditions at each node, which characterize the interpolation polynomial. These new operators find application to the scattered data interpolation problem when supplementary second order derivative data are given (Kraaijpoel and van Leeuwen, 2010 [13]). Numerical comparison with other well known combinations is presented.     

On the divergence of certain Hermite-Fejér interpolation

Summary In his paper [1]P. Turán discovers the interesting behaviour of Hermite-Fejér interpolation (based on the ebyev roots) not describing the derivative values at exceptional nodes {_n} _n=1 . Answering to his question we construct such exceptional node-sequence for which the mentioned process is bounded for bounded functions whenever –1<x<1 but does not converge for a suitable continuous function at any point of the whole interval [–1, 1].     

Quasi-interpolation with translates of a function having noncompact support

We establish a result related to a theorem of de Boor and Jia [1]. Their theorem, in turn, corrected and extended a result of Fix and Strang [5] concerning controlled approximation. In our result, the approximating functions are not required to have compact support, but satisfy instead conditions on their behavior at . Our theorem includes some recent results of Jackson [6] and is closely related to the work of Buhmann [2].Communicated by Carl de Boor     

The lower estimate for linear positive operators,I

A method to prove lower estimates for linear operators is introduced. As a result the best lower estimate for certain convolution operators, for the multivariate Bernstein-Durrmeyer operators in part I and the Bernstein polynomial operators in part II (see [10]), are obtained.Communicated by Hubert Berens     

On the Durrmeyer-type modification of some discrete approximation operators

In [10], for continuous functionsf from the domain of certain discrete operatorsL _n the inequalities are proved concerning the modulus of continuity ofL _nf. Here we present analogues of the results obtained for the Durrmeyer-type modification $\tilde L_n $ ofL _n. Moreover, we give the estimates of the rate of convergence of $\tilde L_n f$ in Hölder-type norms     

On Minimal Projections in l∞ (n)

 In this paper we present an estimate of the relative projection constant for a particular class of subspaces of of codimension two. In some cases the exact value of will be calculated. Also Theorem 2.5 from [11] will be generalized. (Received 21 December 1998)     

Joint discrete universality for periodic zeta-functions

Abstract

In the paper, joint universality theorems for periodic zeta functions with multiplicative coefficients and periodic Hurwitz zeta-functions are proved. The main theorem of [11] is extended, and two new joint universality theorems on the approximation of a collection of analytic functions by discrete shifts of the above zeta-functions are obtained. For this, certain linear independence hypotheses are applied.     

A modulus of smoothness based on an algebraic addition

Summary The purpose of this paper is to present a new approach to smoothness of nonperiodic functions. We consider the space of continuous functions on [−1, 1] as well as the weighted L^p-space and introduce a modulus of smoothness that is based on an algebraic addition ⊕ defined on [−1, 1]. The present paper is mainly concerned with general properties and groundwork, whereas a second paper [4] is devoted to more complex properties, in particular to an equivalent K-functional and to the characterization of best algebraic approximation. Moreover the equivalence with the Butzer-Stens modulus will be shown there.     

Cardinal hermite interpolation with box splines II

Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L ² together with its directional derivatives mentioned above. Moreover, for data sequences inl ^p ( ^d ), 1p2, there is a spline function inL ^p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst     

Divergenzverhalten mehrdimensionaler Shannonscher Abtastreihen

The behaviour of multidimensional Shannon sampling series for continuous functions is examined. A continuous functiong ₁ εC ₀[0,1]² with support in the rectangle [0,1]×[0,1/2] is indicated in the paper for which the two dimensional Shannon sampling series diverge almost everywhere in the rectangle [0,1]×[1/2,1]. This shows that the localization principle for Shannon sampling series cannot hold in two dimensions and in higher dimensions. The result solves a problem formulated by P.L. Butzer.     

A note on an error estimate for least squares approximation

An asymptotic expansion is obtained which provides upper and lower bounds for the error of the bestL ₂ polynomial approximation of degreen forx ⁿ⁺¹ on [–1, 1]. Because the expansion proceeds in only even powers of the reciprocal of the large variable, and the error made by truncating the expansion is numerically less than, and has the same sign as the first neglected term, very good bounds can be obtained. Via a result of Phillips, these results can be extended fromx ⁿ⁺¹ to anyfC ⁿ⁺¹[–1, 1], provided upper and lower bounds for the modulus off ⁽ⁿ⁺¹⁾ are available.     

Constrained variational refinement

A non-uniform, variational refinement scheme is presented for computing piecewise linear curves that minimize a certain discrete energy functional subject to convex constraints on the error from interpolation. Optimality conditions are derived for both the fixed and free-knot problems. These conditions are expressed in terms of jumps in certain (discrete) derivatives. A computational algorithm is given that applies to constraints whose boundaries are either piecewise linear or spherical. The results are applied to closed periodic curves, open curves with various boundary conditions, and (approximate) Hermite interpolation.     

A family of Hermite interpolants by bisection algorithms

A two point subdivision scheme with two parameters is proposed to draw curves corresponding to functions that satisfy Hermite conditions on [a, b]. We build two functionsf andf ¹ on dyadic numbers and for some values of the parameters,f is in ¹ withf ¹=f. Examples are provided which show how different the curves can be.     

Riemann-Hilbert problem associated with Angelesco systems

Angelesco systems of measures with Jacobi-type weights are considered. For such systems, strong asymptotics for the related multiple orthogonal polynomials are found as well as the Szeg?-type functions. In the procedure, an approach from the Riemann-Hilbert problem plays a fundamental role.     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate. (Received 2 February 2000)     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.