A -functional and the rate of convergence of some linear polynomial operators

We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

     

Simultaneous Approximation by Polynomial Projection Operators

Pointwise estimates are obtained for simultaneous approximation of a function f and its derivatives by means of an arbitrary sequence of bounded projection operators with some extra condition (1.3) (we do not require the operators to be linear) which map C_[-1,1] into polynomials of degree n, augmented by the interpolation of f at some points near ±1. The present result essentially improved those in [BaKi3], and several applications are discussed in Section 4.     

Pointwise bounds of orthogonal expansions on the real line via weighted Hilbert transforms

We study pointwise bounds of orthogonal expansions on the real line for a class of exponential weights of smooth polynomial decay at infinity. As a consequence of our main results, we establish pointwise bounds for weighted Hilbert transforms which are of independent interest. Mathematics subject classifications (2000)  41A10, 42C05     

Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid

Let _N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf : _N+2m → ℝ by algebraic polynomials on the grid Ω _N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω _N+m and Ω _N , respectively, we construct a linear operatorY _{n+2m, N} =Y _{n+2m, N} (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω _N ):

Approximation of functions of two variables by certain linear positive operators

We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using modulus of continuity. Moreover we define an rth order generalization of these operators and observe its approximation properties. Furthermore, we study the convergence of the linear positive operators in a weighted space of functions of two variables and find the rate of this convergence using weighted modulus of continuity.     

整函数权分担一个值

This paper deals with some uniqueness problems of entire functions concerning differential polynomials that share one value with finite weight in a different form. We obtain some theorems which generalize some results given by Banerjee, Fang and Hua, Zhang and Lin, Zhang, etc.     

Mean Convergence of Extended Lagrange Interpolation for Exponential Weights

In this paper, we complete our investigations of mean convergence of Lagrange interpolation for fast decaying even and smooth exponential weights on the line. In doing so, we also present a summary of recent related work on the line and [–1,1] by the authors, Szabados, Vertesi, Lubinsky and Matjila. We also emphasize the important and fundamental ideas, applied in our proofs, that were developed by Erds, Turan, Askey, Freud, Nevai, Szabados, Vértesi and their students and collaborators. These methods include forward quadrature estimates, orthogonal expansions, Hilbert transforms, bounds on Lebesgue functions and the uniform boundedness principle.     

The degree of coconvex polynomial approximation

Let change its convexity finitely many times in the interval, say times, at . We estimate the degree of approximation of by polynomials of degree , which change convexity exactly at the points . We show that provided is sufficiently large, depending on the location of the points , the rate of approximation is estimated by the third Ditzian-Totik modulus of smoothness of multiplied by a constant , which depends only on .

     

On weighted polynomial approximation with monotone weights

We construct an even weight monotone on the right half line such that the logarithmic integral of the largest -convex minorant of converges and the polynomials are dense in .     

Piecewise Coapproximation and the Whitney Inequality

All cases of the validity of the piecewise q-monotone analog of the Whitney inequality are clarified. For similar analogs of the Jackson inequality negative results are proved.     

Single machine batch scheduling to minimize the weighted number of late jobs

The single machine batch scheduling problem to minimize the weighted number of late jobs is studied. In this problem,n jobs have to be processed on a single machine. Each job has a processing time, a due date and a weight. Jobs may be combined to form batches containing contiguously scheduled jobs. For each batch, a constant set-up time is needed before the first job of this batch is processed. The completion time of each job in the batch coincides with the completion time of the last job in this batch. A job is late if it is completed after its due date. A schedule specifies the sequence of jobs and the size of each batch, i.e. the number of jobs it contains. The objective is to find a schedule which minimizes the weighted number of late jobs. This problem isNP-hard even if all due dates are equal. For the general case, we present a dynamic programming algorithm which solves the problem with equal weights inO(n ³) time. We formulate a certain scaled problem and show that our dynamic programming algorithm applied to this scaled problem provides a fully polynomial approximation scheme for the original problem. Each algorithm of this scheme has a time requirement ofO(n ³/ +n ³ logn). A side result is anO(n logn) algorithm for the problem of minimizing the maximum weight of late jobs.Supported by INTAS Project 93-257.     

Simultaneous Polynomial Approximation in the Weighted Chebyshev Norm

Simultaneous approximation means that a given sufficiently smooth function g:[-1, 1] and its derivatives up to order q are approximated by a single polynomial p and its derivatives. This paper deals with new error estimates (in a weighted norm with explicit constants) and corresponding algorithms in the most interesting cases q = 1 and q = 2. The described method is based on the close relationship between algebraic and trigonometric polynomial approximation.     

光滑Jordan.曲线上一类极值多项式的逼近性质

关于Bieberbach多项式的逼近性质已有许多精彩结果,然而Jordan曲线上极值多项式的逼近性质却很少被考察.本文得到了C^1+α光滑Jordan曲线上一类极值多项式的一些逼近结果.     

Approximate decoupling of multivariate polynomials using weighted tensor decomposition

Many scientific and engineering disciplines use multivariate polynomials. Decomposing a multivariate polynomial vector function into a sandwiched structure of univariate polynomials surrounded by linear transformations can provide useful insight into the function while reducing the number of parameters. Such a decoupled representation can be realized with techniques based on tensor decomposition methods, but these techniques have only been studied in the exact case. Generalizing the existing techniques to the noisy case is an important next step for the decoupling problem. For this extension, we have considered a weight factor during the tensor decomposition process, leading to an alternating weighted least squares scheme. In addition, we applied the proposed weighted decoupling algorithm in the area of system identification, and we observed smaller model errors with the weighted decoupling algorithm than those with the unweighted decoupling algorithm.     

Some Approximation Properties of Certain q-Baskakov-Beta Operators

In this paper, we propose the q analogue of modified Baskakov-Beta opera-tors. The Voronovskaja type theorem and some direct results for the above operators are discussed. The rate of convergence and weighted approximation by the operators are studied.     

The ridge function representation of polynomials and an application to neural networks

The first goal of this paper is to establish some properties of the ridge function representation for multivariate polynomials, and the second one is to apply these results to the problem of approximation by neural networks. We find that for continuous functions, the rate of approximation obtained by a neural network with one hidden layer is no slower than that of an algebraic polynomial.     

Some characteristic properties of the weighted particular Schur polynomial mean

This paper provides some characteristic properties of the weighted particular Schur polynomial mean of several variables. In addition, an elementary proof of an important inequality involving the weighted particular Schur polynomial mean is given. Various related results involving a family of the Schur polynomials, symmetric polynomials, and other associated polynomials, together with the potential for their applications, are also considered.     

Uniform boundedness of (<Emphasis Type="Italic">C</Emphasis>, 1) means of Jacobi expansions in weighted sup norms. I (The main theorems and ideas)

Lubinsky and Totik’s decomposition [11] of the Cesàro operators σ _n ^(α,β) of Jacobi expansions is modified to prove uniform boundedness in weighted sup norms, i.e., ‖w ^(a,b) σ _n ^(α,β) ‖_∞ ≦ C‖w ^(a,b) f‖_∞, whenever α,β ≧ −1/2 and a, b are within the square around (α/2 + 1/4, α/2 + 1/4) having a side length of 1. This approach uses only classical results from the theory of orthogonal polynomials and various estimates for the Jacobi weights. The present paper is concerned with the main theorems and ideas, while a second paper [7] provides some necessary estimations.      

The Integral Type Modification of Jain Operators and its Approximation Properties

Abstract

In the present paper, we discuss the approximation properties of Durrmeyer-Stancu type variant of Jain operators with the modified forms of the Beta basis functions. We establish some direct results, which include the asymptotic formula, the error estimation in terms of the modulus of continuity and weighted approximation. Also, we construct a King modification of these operators which preserves the test functions e₀ and e₁.     

Comonotone Jackson's Inequality

Let 2s points y_i=−πy_2s<…<y₁<π be given. Using these points, we define the points y_i for all integer indices i by the equality y_i=y_i+2s+2π. We shall write fΔ⁽¹⁾(Y) if f is a 2π-periodic continuous function and f does not decrease on [y_i, y_i−1], if i is odd; and f does not increase on [y_i, y_i−1], if i is even. In this article the following Theorem 1—the comonotone analogue of Jackson's inequality—is proved. 1. If fΔ⁽¹⁾(Y), then for each nonnegative integer n there is a trigonometric polynomial τ_n(x) of order n such that τ_nΔ⁽¹⁾(Y), and |f(x)−π_n(x)|c(s) ω(f; 1/(n+1)), x , where ω(f; t) is the modulus of continuity of f, c(s)=const. Depending only on s.