On the Behavior of Zeros of Polynomials of Best and Near-Best Approximation

1991 ◽  
Vol 43 (5) ◽  
pp. 1010-1021
Author(s):  
K. G. Ivanov ◽  
E. B. Saff ◽  
V. Totik
Keyword(s):  
Uniform Approximation ◽  
Best Approximation ◽  
Cluster Point ◽  
Zeros Of Polynomials ◽  
Closed Disk ◽  
Best Uniform Approximation

AbstractAssume ƒ is continuous on the closed disk D1 : |z| ≤ 1, analytic in |z| ≤ 1, but not analytic on D1. Our concern is with the behavior of the zeros of the polynomials of best uniform approximation to ƒ on D1. It is known that, for such ƒ, every point of the circle |z| = 1 is a cluster point of the set of all zeros of Here we show that this property need not hold for every subsequence of the Specifically, there exists such an f for which the zeros of a suitable subsequence all tend to infinity. Further, for near-best polynomial approximants, we show that this behavior can occur for the whole sequence. Our examples can be modified to apply to approximation in the Lq-norm on |z|= 1 and to uniform approximation on general planar sets (including real intervals).

Note on Best Approximation of |x|

1979 ◽  
Vol 22 (3) ◽  
pp. 363-366
Author(s):  
Colin Bennett ◽  
Karl Rudnick ◽  
Jeffrey D. Vaaler
Keyword(s):  
General Problem ◽  
Uniform Approximation ◽  
Best Approximation ◽  
Best Uniform Approximation ◽  
Linear Fractional Transformations ◽  
Symmetric Complex ◽  
Image Position ◽  
Complex Valued ◽  
Special Case

In this note the best uniform approximation on [—1,1] to the function |x| by symmetric complex valued linear fractional transformations is determined. This is a special case of the more general problem studied in [1]. Namely, for any even, real valued function f(x) on [-1,1] satsifying 0 = f ( 0 ) ≤ f (x) ≤ f (1) = 1, determine the degree of symmetric approximationand the extremal transformations U whenever they exist.

Classical Approximation

1995 ◽  
Author(s):  
Marek A. Kowalski ◽  
Krzystof A. Sikorski ◽  
Frank Stenger
Keyword(s):  
20Th Century ◽  
Uniform Approximation ◽  
Best Approximation ◽  
Inner Product ◽  
Normed Spaces ◽  
Remez Algorithm ◽  
Best Uniform Approximation ◽  
Converse Theorems ◽  
Inner Product Spaces ◽  
Finite Dimensional

In this chapter we acquaint the reader with the theory of approximation of elements of normed spaces by elements of their finite dimensional subspaces. The theory of best approximation was originated between 1850 and 1860 by Chebyshev. His results and ideas have been extended and complemented in the 20th century by other eminent mathematicians, such as Bernstein, Jackson, and Kolmogorov. Initially, we present the classical theory of best approximation in the setting of normed spaces. Next, we discuss best approximation in unitary (inner product) spaces, and we present several practically important examples. Finally, we give a reasonably complete presentation of best uniform approximation, along with examples, the Remez algorithm, and including converse theorems about best approximation. The goal of this section is to present some general results on approximation in normed spaces.

scholarly journals Concentration of the error between a function and its polynomial of best uniform approximation

1998 ◽  
Vol 41 (3) ◽  
pp. 447-463 ◽  
Author(s):  
Maurice Hasson
Keyword(s):  
Uniform Approximation ◽  
Algebraic Polynomial ◽  
General Class ◽  
Supremum Norm ◽  
Best Uniform Approximation ◽  
Class A ◽  
Image Position ◽  
Class Of Functions

Let f be a continuous real valued function defined on [−1, 1] and let En(f) denote the degree of best uniform approximation to f by algebraic polynomial of degree at most n. The supremum norm on [a, b] is denoted by ∥.∥[a, b] and the polynomial of degree n of best uniform approximation is denoted by Pn. We find a class of functions f such that there exists a fixed a ∈(−1, 1) with the following propertyfor some positive constants C and N independent of n. Moreover the sequence is optimal in the sense that if is replaced by then the above inequality need not hold no matter how small C > 0 is chosen.We also find another, more general class a functions f for whichinfinitely often.

Sign in / Sign up

Export Citation Format

Share Document