Approximation with Bernstein–Szegö polynomials

We present approximation kernels for orthogonal expansions with respect to Bernstein–Szegö polynomials. Theconstruction is derived from known results for Chebyshev polynomials of the first kind and does not pose any restrictions on the Bernstein–Szegö polynomials.     

GLOBAL SMOOTHNESS PRESERVATION BY BIVARIATE INTERPOLATION OPERATORS

1　IntroductionIn the case when Pn(f,x) represents the univariate interpolation polynomial of Her-mite-Fejér based on Chebyshev nodesof the firstkind or the univariate interpolation polyno-mials of Lagrange based on Chebyshev nodes of the second kind and± 1 ,or the univariaterational Shepard operators,the following result of partial preservation of global smoothnessis proved in[4] :If f∈Lip M(α;[-1 ,1 ] ) ,0 <α≤ 1 ,then there existsβ=β(α) <α and M′>such thatω(Pn(f ) ;h)≤ M′h…     

一些包含Chebyshev多项式和Stirling数的恒等式

利用初等方法研究Chebyshev多项式的性质,建立了广义第二类Chebyshev多项式的一个显明公式,并得到了一些包含第一类Chebyshev多项式,第一类Stirling数和Lucas数的恒等式.     

Random Sampling Scattered Data with Multivariate Bernstein Polynomials

In this paper, the multivariate Bernstein polynomials defined on a simplex are viewed as sampling operators, and a generalization by allowing the sampling operators to take place at scattered sites is studied. Both stochastic and deterministic aspects are applied in the study. On the stochastic aspect, a Chebyshev type estimate for the sampling operators is established. On the deterministic aspect, combining the theory of uniform distribution and the discrepancy method, the rate of approximating continuous function and L ^p convergence for these operators are studied, respectively.     

一个序列的组合解释及其应用

该文给出了一个序列的组合解释，讨论了这个序列在研究两类Chebyshev多项式，广义Fibonacci序列和广义Lucas序列中的一些应用.     

Bernstein Polynomial Collocation Method for Elliptic Boundary Value Problems

We present a summary of recent developments in application of Bernstein polynomials to solution of elliptic boundary value problems with a pseudospectral method. Solution is approximated using Benstein polynomial interpolant defined at points of the extrema of Chebyshev polynomials i.e. the Chebyshev-Gauss-Lobatto (CGL) nodes. This approach brings impovement comparing to the Bernstein interpolation at equidistant nodes we used previously [1]. We show that this approach leads to spectral convergence and accuracy comparable to that of pseudospectral methods with orthogonal polynomials (Chebyshev, Legendre). The algorithm is implemented in open source library bernstein-poly , which is available online. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Constructive D-Module Theory with Singular

We overview numerous algorithms in computational D-module theory together with the theoretical background as well as the implementation in the computer algebra system Singular. We discuss new approaches to the computation of Bernstein operators, of logarithmic annihilator of a polynomial, of annihilators of rational functions as well as complex powers of polynomials. We analyze algorithms for local Bernstein–Sato polynomials and also algorithms, recovering any kind of Bernstein–Sato polynomial from partial knowledge of its roots. We address a novel way to compute the Bernstein–Sato polynomial for an affine variety algorithmically. All the carefully selected nontrivial examples, which we present, have been computed with our implementation. We also address such applications as the computation of a zeta-function for certain integrals and revealing the algebraic dependence between pairwise commuting elements.     

Linearkombinationen von iterierten Bernsteinoperatoren

The Bernstein polynomials B_n(f) approximate every function f which is continuous on [0, 1] uniformly on [0, 1]. Also the derivatives of the Bernstein polynomials approach the derivatives of the function f uniformly on [0, 1], if f has continuous derivatives. In this paper we shall introduce polynomial operators, namely linear combinations of iterates of Bernstein operators, which have the same properties but, under definite conditions, approximate f more closely than the Bernstein operators.     

三对角行列式与Chebyshev多项式

给出了三对角行列式的几种算法,利用三对角行列式证明了两类Chebyshev多项式的几种显式.     

Approximation Properties by Bernstein–Durrmeyer Type Operators

In this paper, in order to make the convergence faster to a function being approximated, we modify the Bernstein–Durrmeyer type operators, which were introduced in Abel et al. (Nonlinear Anal Ser A Theory Methods Appl 68(11):3372–3381, 2008). The modified operators reproduce the constant and linear functions. The operators discussed here are different from the other modifications of Bernstein type operators. The Voronovskaja type asymptotic formula with quantitative estimate for a new type of complex Durrmeyer polynomials, attached to analytic functions in compact disks is obtained. Here, we put in evidence the overconvergence phenomenon for this kind of Durrmeyer polynomials, namely the extensions of approximation properties with exact quantitative estimates, from the real interval [0, 1/3] to compact disks in the complex plane.     

Optimality of generalized Bernstein operators

We show that a certain optimality property of the classical Bernstein operator also holds, when suitably reinterpreted, for generalized Bernstein operators on extended Chebyshev systems.     

On the degree of approximation by spline functions with free knots

Summary A comparison theorem is derived for Chebyshev approximation by spline functions with free knots. This generalizes a result of Bernstein for approximation by polynomials.     

一种拟Grünwald插值算子的Lp收敛速度

1 引言 设f（x）为[-1,1]上的连续函数，则以第二类Chebyshev多项式Un（x）（Un（cosθ）=sin（n＋1）θ/sinθ的全部零点{xk=cos k/n＋1 π}^n k=1为插值结点组的f的Grunwald插值多项式为     

A bivariate Markov inequality for Chebyshev polynomials of the second kind

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 has given a corresponding inequality for Chebyshev polynomials of the first kind and has obtained the extension of V.A. Markov’s theorem to real normed linear spaces as an easy corollary.To prove our inequality we construct Lagrange polynomials for the new class of nodes we consider and give a corresponding Christoffel–Darboux formula. It is enough to determine the sign of the directional derivatives of the Lagrange polynomials.     

一种拟Grünwald插值算子的L_p收敛速度

1引言 2006年3月 高等学校计算数学学报 设f(x)为卜1，1}上的连续函数，则以第二类Chebyshev多项式认(x)(Un(eoso)= 烈共坐)的全部零点{ 乙工工1口 式为 其中 k x无=Cos了一下丁7r 了L十1 犷_，为插值结点组的了的Gr如wald插值多项 G。(，，x)=艺了(x、)‘孟(x)， n. 11 一一 k     

Sampling scattered data with Bernstein polynomials: stochastic and deterministic error estimates

Viewing the classical Bernstein polynomials as sampling operators, we study a generalization by allowing the sampling operation to take place at scattered sites. We utilize both stochastic and deterministic approaches. On the stochastic side, we consider the sampling sites as random variables that obey some naturally derived probabilistic distributions, and obtain Chebyshev type estimates. On the deterministic side, we incorporate the theory of uniform distribution of point sets (within the framework of Weyl’s criterion) and the discrepancy method. We establish convergence results and error estimates under practical assumptions on the distribution of the sampling sites.     

The Genuine Bernstein-Durrmeyer Operator on a Simplex

In 1967 Durrmeyer introduced a modification of the Bernstein polynomials as a selfadjoint polynomial operator on L²[0,1] which proved to be an interesting and rich object of investigation. Incorporating Jacobi weights Berens and Xu obtained a more general class of operators, sharing all the advantages of Durrmeyer’s modification, and identified these operators as de la Vallée-Poussin means with respect to the associated Jacobi polynomial expansion. Nevertheless, all these modifications lack one important property of the Bernstein polynomials, namely the preservation of linear functions. To overcome this drawback a Bernstein-Durrmeyer operator with respect to a singular Jacobi weight will be introduced and investigated. For this purpose an orthogonal series expansion in terms generalized Jacobi polynomials and its de la Vallée-Poussin means will be considered. These Bernstein-Durrmeyer polynomials with respect to the singular weight combine all the nice properties of Bernstein-Durrmeyer polynomials with the preservation of linear functions, and are closely tied to classical Bernstein polynomials. Focusing not on the approximation behavior of the operators but on shape preserving properties, these operators we will prove them to converge monotonically decreasing, if and only if the underlying function is subharmonic with respect to the elliptic differential operator associated to the Bernstein as well as to these Bernstein-Durrmeyer polynomials. In addition to various generalizations of convexity, subharmonicity is one further shape property being preserved by these Bernstein-Durrmeyer polynomials. Finally, pointwise and global saturation results will be derived in a very elementary way.     

On the restricted Chebyshev–Boubaker polynomials

Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev–Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they satisfy, and we study certain central sequences defined by their coefficient arrays. We give an integral representation for their moments, and we show that the Hankel transforms of these moments have a simple form. We show that the (sequence) Hankel transform of the row sums of the corresponding moment matrix is defined by a family of polynomials closely related to the Chebyshev polynomials of the second kind, and that these row sums are in fact the moments of another family of orthogonal polynomials.     

Chebyshev orthogonal polynomials and the Neumann problem

In a Banach space E, we consider the Neumann problem for a second-order homogeneous equation with a constant operator coefficient densely defined in E. Under a weakened strong positivity condition on the operator coefficient (we use the approach due to V.I. Gorbachuk and A.I. Knyazyuk to the study of a-positive operators), we present a criterion for the well-posed solvability of the problem. We obtain a representation of the solution via Chebyshev operator polynomials of the first and second kind.     

Lagrange插值逼近导数的平均收敛

<正>We consider the rate of mean convergence of derivatives by Lagrange interpolation operators L_n(f,x) based on the zeros of Chebyshev polynomials of the first kind.A sharp estimate of the derivative of L_n(f,x)—f(x) in terms of the error of best approximation by polynomials of degree n is derived.