Let f be analytic on the compact set E ⊂ C , of positive transfinite diameter and let Cr denote the largest equipotential curve of E such that f is analytic within Cr. Generally, the growth of an entire function is measured in terms of its order and type. Here we have established the relations between maximum modulus, maximum term and interpolation error of best uniform approximation to a funct...

This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author h...

Linear combinations of iterates of Bernstein polynomials exponentially converging to the Lagrange interpolating polynomial are given. The results are applied in CAGD to get an exponentially fast weighted progressive iterative approximation technique to fit data with finer and finer precision. AMS subject classifications: 41A25, 41A36

We investigate weighted Lp(0 < p <.) convergence of Hermite and Hermite– Fejér interpolation polynomials of higher order at the zeros of Freud orthogonal polynomials on the real line. Our results cover as special cases Lagrange, Hermite– Fejér and Krylov–Stayermann interpolation polynomials. © 2001 Academic Press

In this paper, He’s variational iteration method (VIM) is used to obtain approximate analytical solutions of the Abelian differential equation. This method is based on Lagrange multipliers for identification of optimal values of parameters in a functional. Using this method creates a sequence which tends to the exact solution of problem. The method is capable of reducing the size of calculation...

Using a new formulation of the Bézout matrix, we construct bivariate matrix polynomials expressed in a tensor-product Lagrange basis. We use these matrix polynomials to solve common tasks in computer-aided geometric design. For example, we show that these bivariate polynomials can serve as stable and efficient implicit representations of plane curves for a variety of curve intersection problems.

We study the convergence of the Laurent polynomials of Lagrange interpolation on the unit circle for continuous functions satisfying a condition about their modulus of continuity. The novelty of the result is that now the nodal systems are more general than those constituted by the n roots of complex unimodular numbers and the class of functions is different from the usually studied. Moreover, ...

Let X be a triangular array of interpolation points in a compact subset of [0; 2 ]. We obtain a necessary and su¢ cient condition for the existence of p > 0 such that the associated trigonometric polynomials are convergent in Lp. We also examine Lagrange interpolation on the unit circle. The results are analogues of our earlier ones for Lagrange interpolation on a real interval. 1. The Result I...

We prove an analogue of the Lagrange Inversion Theorem for Dirichlet series. The proof is based on studying properties convolution polynomials, which are analogues polynomials introduced by Knuth in [5].