多元Bernstein-Durrmeyer型多项式及其逼近特征

作为Bernstein-Durrmeyer多项式的推广,定义单纯形上的Bernstein-Durrmeyer型多项式.以最佳多项式逼近为度量,给出Bernstein-Durrmeyer型多项式Lp逼近阶的估计,并且以一个逆向不等式的形式建立其Lp逼近的逆定理,从而用最佳多项式逼近刻画该多项式Lp逼近的特征.所获结果包含了多元Bernstein-Durrmeyer多项式的相应结果.     

Operator adapted spectral element methods I: harmonic and generalized harmonic polynomials

Summary. The paper presents results on the approximation of functions which solve an elliptic differential equation by operator adapted systems of functions. Compared with standard polynomials, these operator adapted systems have superior local approximation properties. First, the case of Laplace's equation and harmonic polynomials as operator adapted functions is analyzed and rates of convergence in a Sobolev space setting are given for the approximation with harmonic polynomials. Special attention is paid to the approximation of singular functions that arise typically in corners. These results for harmonic polynomials are extended to general elliptic equations with analytic coefficients by means of the theory of Bergman and Vekua; the approximation results for Laplace's equation hold true verbatim, if harmonic polynomials are replaced with generalized harmonic polynomials. The Partition of Unity Method is used in a numerical example to construct an operator adapted spectral method for Laplace's equation that is based on approximating with harmonic polynomials locally. Received May 26, 1997 / Revised version received September 21, 1998 / Published online September 7, 1999     

单纯形上的Stancu多项式与最佳多项式逼近

作为Bernstein多项式的推广,本文定义单纯形上的多元Stancu多项式.以最佳多项式逼近为度量,建立Stancu多项式对连续函数的逼近定理与逼近阶估计,给出Stancu多项式的一个逼近逆定理,从而用最佳多项式逼近刻划Stancu多项式的逼近特征.     

Best one-sided L1 approximation to the Heaviside and sign functions

We find the polynomials of the best one-sided approximation to the Heaviside and sign functions. The polynomials are obtained by Hermite interpolation at the zeros of some Jacobi polynomials. Also we give an estimate of the error of approximation and characterize the extremal points of the convex set of the best approximants.     

Sensitivity analysis for Szegő polynomials

Szegő polynomials are orthogonal with respect to an inner product on the unit circle. Numerical methods for weighted least-squares approximation by trigonometric polynomials conveniently can be derived and expressed with the aid of Szegő polynomials. This paper discusses the conditioning of several mappings involving Szegő polynomials and, thereby, sheds light on the sensitivity of some approximation problems involving trigonometric polynomials. This Research supported in part by NSF grant DMS-0107858.     

复赋范空间中复RS集的最佳同时逼近

研究了复赋范空间中具限制系数的广义多项式集G对无穷序列的最佳同时逼近问题,得到了特征定理;当G是复RS集时还得到了惟一性定理．     

Bézier form of dual bivariate Bernstein polynomials

Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining Bézier form of the L ₂-solution of the problem of best polynomial approximation of Bézier curve or surface. In this connection, the Bézier coefficients of dual Bernstein polynomials are to be evaluated at a reasonable cost. In this paper, a set of recurrence relations satisfied by the Bézier coefficients of dual bivariate Bernstein polynomials is derived and an efficient algorithm for evaluation of these coefficients is proposed. Applications of this result to some approximation problems of Computer Aided Geometric Design (CAGD) are discussed.     

Approximation by Entire Functions on a Countable Union of Segments on the Real Axis: 3. Further Generalization

In this paper, an approximation of functions of extensive classes set on a countable unit of segments of a real axis using the entire functions of exponential type is considered. The higher the type of the approximating function is, the higher the rate of approximation near segment ends can be made, compared with their inner points. The general approximation scale, which is nonuniform over its segments, depending on the type of the entire function, is similar to the scale set out for the first time in the study of the approximation of the function by polynomials. For cases with one segment and its approximation by polynomials, this scale has allowed us to connect the so-called direct theorems, which state a possible rate of smooth function approximation by polynomials, and the inverse theorems, which give the smoothness of a function approximated by polynomials at a given rate. The approximations by entire functions on a countable unit of segments for the case of Hölder spaces have been studied by the authors in two preceding papers. This paper significantly expands the class of spaces for the functions, which are used to plot an approximation that engages the entire functions with the required properties.     

On the orthogonality of residual polynomials\newline of minimax polynomial preconditioning

Summary. This paper studies polynomials used in polynomial preconditioning for solving linear systems of equations. Optimum preconditioning polynomials are obtained by solving some constrained minimax approximation problems. The resulting residual polynomials are referred to as the de Boor-Rice and Grcar polynomials. It will be shown in this paper that the de Boor-Rice and Grcar polynomials are orthogonal polynomials over several intervals. More specifically, each de Boor-Rice or Grcar polynomial belongs to an orthogonal family, but the orthogonal family varies with the polynomial. This orthogonality property is important, because it enables one to generate the minimax preconditioning polynomials by three-term recursive relations. Some results on the convergence properties of certain preconditioning polynomials are also presented. Received February 1, 1992/Revised version received July 7, 1993     

球面带形平移网络逼近的Jackson定理

研究了球面带型平移网络逼近阶用球面调和多项式的最佳逼近及光滑模的刻画问题．借助于球调和多项式的最佳逼近多项式和Riesz平均构造出了单位球面Sq上的带形平移网络,并建立了球面带形平移网络对Lp(Sq)中函数一致逼近的Jackson型定理．所得结果表明球面带形平移网络可以达到球调和多项式的逼近阶．     

Multiple Orthogonal Polynomials on the Unit Circle

We introduce multiple orthogonal polynomials on the unit circle. We show how this is related to simultaneous rational approximation to Caratheodory functions (two-point Hermite-Pade approximation near zero and near infinity). We give a Riemann-Hilbert problem for which the solution is in terms of type I and type II multiple orthogonal polynomials on the unit circle, and recurrence relations are obtained from this Riemann-Hilbert problem. Some examples are given to give an idea of the behavior of the zeros of type II multiple orthogonal polynomials.     

Approximation of Smooth Functions and Constants by Polynomials with Integer and Natural Coefficients

Direct theorems on the approximation of smooth functions by polynomials with integer coefficients are strengthened. First theorems on approximation by polynomials with natural coefficients are obtained.     

On best approximation by rational and holomorphic mappings between Banach spaces

After proving a generalized version of Garkavi's theorem, we give as applications proofs of existence results on best approximation by polynomials, and fractional linear and holomorphic operators between Banach spaces. We also obtain theorems on best approximation by some types of rational functions defined in open subsets of Banach spaces. By considering a natural non-normable distance we prove that every mapping bounded on the bounded subsets of a Banach space has best approximation by polynomials of degree less than or equal to a fixed natural number n.     

The Degree Of Polynomial Approximation And Interpolation Of Analytic Functions

The rate of best polynomial approximation of an analytic function on a compact Faber set K is characterized in terms of the rate of growth of its Faber coefficients and compared with the rate of approximation by the partial sums of the Faber series. Also the convergence of sequences of interpolating polynomials constructed for various systems of nodes is studied by considering the growth of the interpolated function. Under appropriate assumptions on K the approximation by interpolating polynomials can be incorporated in the characterization theorem. Emphasis is laid on high precision in describing the rate of approximation and on admitting a large class of functions.     

具调节因子Hermite拟谱逼近的误差估计

本文研究了具调节因子的Hermite函数的拟谱方法在赋权Sobolev空间中函数的逼近.通过具调节因子的Hermite多项式的性质和相应的Gauss类型的求积公式,得到了在具调节因子的Hermite多项式的零点上的插值算子的稳定性以及误差界.并具有通常的高阶收敛性.     

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

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

球面Jackson多项式逼近的正逆定理

研究了球面Jackson多项式J_(v,s)f的逼近阶,建立了该多项式逼近的强型正向与逆向不等式.利用球面光滑模较好地刻画了Jackson多项式的逼近性能,证明了存在与v和f无关的常数C_1和C_2,使得对于定义在球面上任意p-幂勒贝格可积或连续函数f成立C_1ω(f,1/v)_p≤‖J_(v,s)f-f‖_p≤C_2ω(f,1/v)_p,其中ω(f,t)p是f的光滑模.     

Multiple orthogonal polynomials applied to matrix function evaluation

Multiple orthogonal polynomials generalize standard orthogonal polynomials by requiring orthogonality with respect to several inner products. This paper discusses an application to the approximation of matrix functions and presents quadrature rules that generalize the anti-Gauss rules proposed by Laurie.     

Polynomials with integer coefficients and their zeros

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.