Characterization theorem of generalized polynomial of best approximation having bounded coefficients

Let the set of generalized polynomials having bounded coefficients beK={p= _jg_j. _{j j j},j=1, 2, ...,n}, whereg ₁,g ₂, ...,g _n are linearly independent continuous functions defined on the interval [a, b], _j, _j are extended real numbers satisfying _j<+, _j>-, and _{j j}. Assume thatf is a continuous function defined on a compact setX [a, b]. This paper gives the characterization theorem forp being the best uniform approximation tof fromK, and points out that the characterization theorem can be applied in calculating the approximate solution of best approximation tof fromK.     

ALTERNATION THEORY IN APPROXIMATION BY POLYNOMIALS HAVING BOUNDED COEFFICIENTS

ＡＬＴＥＲＮＡＴＩＯＮＴＨＥＯＲＹＩＮＡＰＰＲＯＸＩＭＡＴＩＯＮＢＹＰＯＬＹＮＯＭＩＡＬＳＨＡＶＩＮＧＢＯＵＮＤＥＤＣＯＥＦＦＩＣＩＥＮＴＳＸＵＳＨＵＳＨＥＮＧ（许树声）（ＪｉａｎｇｎａｎＵｎｉｖｅｒｓｉｔｙ,Ｗｕｘｉ２１４０６３,Ｃｈｉｎａ）Ａｂｓ...     

Strong uniqueness of best approximations in spaces of bounded linear operators

The present paper is concerned with problems of the strong uniqueness of thebest approximation and the characterization of a uniqueness element in operator spaces.Some results on the strong uniqueness of the best approximation operator from RS-setsare proved and the uniqueness element of a sun in the compact operator space from c_0to c_0 is characterized by the strict Kolmogorov's condition. Some recent results due toLewicki and others are extended and improved.     

On the best polynomial approximation of entire transcendental functions of generalized order

We prove a Hadamard-type theorem that associates the generalized order of growth of an entire transcendental function ƒ with the coefficients of its expansion in a Faber series. This theorem is an extension of one result of Balashov to the case of a finite simply connected domain G with boundary γ belonging to the Al'per class Λ*. Using this theorem, we obtain limit equalities that associate with a sequence of the best polynomial approximations of ƒ in certain Banach spaces of functions analytic in G. Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 60, No. 8, pp. 1011–1026, August, 2008.     

Generalized polynomial approximation providing the best reference

We pose the extremum problem of finding a polynomial approximation for a function of several variables so that this approximation by a fragment of the function provides the best reference. We obtain an upper bound for the modulus of informativity of polynomials and rational functions.Translated fromMatematickeskie Zametki, Vol. 60, No. 5, pp. 658–669, November, 1996.The author wishes to thank Yu. N. Subbotin for valuable discussions.This research was supported by the Russian Foundation for Basic Research under grant No. 93-011-196.     

On the uniqueness of elements of the best approximation and the best one-sided approximation in the spaceL 1

The problem of the uniqueness of elements of the best approximations in the spaceL ₁ [a, b] is studied. We consider the problem of the best approximation and the best (, )-approximation of continuous functions and the problem of the best one-sided approximation of continuously differentiable functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 5, pp. 475–483, May, 1994.     

On uniqueness of the polynomial of best approximation of the function cos kx by trigonometric polynomials in the L metric

In this paper we clarify a problem concerning uniqueness of the polynomial which best approximates cos kx in the L metric with respect to a trigonometric system of order n in which cos kx is absent. We prove uniqueness in the case n=(2l +l)k. In the remaining cases there is no uniqueness. An analogous problem in the C metric is solved and the relationship between n and k in the case of uniqueness ia distinguished from the conditions in the L metric.     

The distribution of extreme points in best complex polynomial approximation

LetK be a compact point set in the complex plane having positive logarithmic capacity and connected complement. For anyf continuous onK and analytic in the interior ofK we investigate the distribution of the extreme points for the error in best uniform approximation tof onK by polynomials. More precisely, if $$A_n (f): = \{ z \in K:|f(z) - p_n^* (f;z)| = \parallel f - p_n^* (f)\parallel _K \} ,$$ wherep _n ^* (f) is the polynomial of degree≤n of best uniform approximation tof onK, we show that there is a subsequencen _k with the property that the sequence of (n _k +2)-point Fekete subsets of \(A_{n_k }\) has limiting distribution (ask→∞) equal to the equilibrium distribution forK. Analogues for weighted approximation are also given.     

Existence and uniqueness of solutions of the generalized polynomial variational inequality

Optimization Letters - In this paper, we consider the generalized polynomial variational inequality, which is a subclass of generalized variational inequalities; and it covers several classes of...     

Generalized ornstein-uhlenbeck process having a characteristic operator with polynomial coefficients

Summary Let be a weighted Schwartz's space of rapidly decreasing functions, the dual space and (t) a perturbed diffusion operator with polynomial coefficients from into itself. It is proven that (t) generates the Kolmogorov evolution operator from into itself via stochastic method. As applications, we construct a unique solution of a Langevin's equation on : whereW(t) is a Brownian motion and ^*(t) is the adjoint of (t) and show a central limit theorem for interacting multiplicative diffusions.     

Strong uniqueness and second order convergence in nonlinear discrete approximation

Summary Strong uniqueness has proved to be an important condition in demonstrating the second order convergence of the generalised Gauss-Newton method for discrete nonlinear approximation problems [4]. Here we compare strong uniqueness with the multiplier condition which has also been used for this purpose. We describe strong uniqueness in terms of the local geometry of the unit ball and properties of the problem functions at the minimum point. When the norm is polyhedral we are able to give necessary and sufficient conditions for the second order convergence of the generalised Gauss-Newton algorithm.     

Coincidence of classes of functions defined by the generalized shift operator or by the order of best polynomial approximation

In this paper the coincidence of two classes of functions is proved. One of them is determined by the power order of best polynomial approximation. To define the other class, first a new nonsymmetric generalized shift operator is introduced, and next, with its help we introduce a generalized modulus of continuity whose power order determines the second class of functions. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 242–257, August, 1999.     

On best error bounds for approximation by piecewise polynomial functions

Summary An analog of the well-known Jackson-Bernstein-Zygmund theory on best approximation by trigonometric polynomials is developed for approximation methods which use piecewise polynomial functions. Interpolation and best approximation by polynomial splines, Hermite and finite element functions are examples of such methods. A direct theorem is proven for methods which are stable, quasi-linear and optimally accurate for sufficiently smooth functions. These assumptions are known to be satisfied in many cases of practical interest. Under a certain additional assumption, on the family of meshes, an inverse theorem is proven which shows that the direct theorem is sharp.The work presented in this paper was supported by the ERDA Mathematics and Computing Laboratory, Courant Institute of Mathematical Sciences, New York University, under Contract E(11-1)-3077 with the Energy Research and Development Administration.     

Barycentric-Remez algorithms for best polynomial approximation in the chebfun system

The Remez algorithm, 75 years old, is a famous method for computing minimax polynomial approximations. Most implementations of this algorithm date to an era when tractable degrees were in the dozens, whereas today, degrees of hundreds or thousands are not a problem. We present a 21st-century update of the Remez ideas in the context of the chebfun software system, which carries out numerical computing with functions rather than numbers. A crucial feature of the new method is its use of chebfun global rootfinding to locate extrema at each iterative step, based on a recursive algorithm combining ideas of Specht, Good, Boyd, and Battles. Another important feature is the use of the barycentric interpolation formula to represent the trial polynomials, which points the way to generalizations for rational approximations. We comment on available software for minimax approximation and its scientific context, arguing that its greatest importance these days is probably for fundamental studies rather than applications.