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.

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.

On the approximation of analytic functions in a strip

1985 ◽  
Vol 97 (3) ◽  
pp. 381-384 ◽  
Author(s):  
Dieter Klusch
Keyword(s):  
Entire Function ◽  
Real Axis ◽  
Exponential Type ◽  
Uniform Approximation ◽  
Analytic Functions ◽  
Trigonometric Polynomials ◽  
The Real ◽  
Image Position ◽  
Class Of Functions

1. Letand denote by Aδ the class of functions f analytic in the strip Sδ = {z = x + iy| |y| < δ}, real on the real axis, and satisfying |Ref(z)| ≤ 1,z∊Sδ. Then N.I. Achieser ([1], pp. 214–219; [8], pp. 137–8, 149) proved that each f∊Aδ can be uniformly approximated on the whole real axis by an entire function fc of exponential type at most c with an errorwhere ∥·∥∞ is the sup norm on ℝ. Furthermore ([7], pp. 196–201), if f∊Aδ is 2π-periodic, then the uniform approximation Ẽn (Aδ) of the class Aδ by trigonometric polynomials of degree at most n is given by

Markov's and Bernstein's Inequalities on Disjoint Intervals

1981 ◽  
Vol 33 (1) ◽  
pp. 201-209 ◽  
Author(s):  
Peter B. Borwein
Keyword(s):  
Algebraic Polynomial ◽  
Supremum Norm ◽  
Algebraic Polynomials ◽  
Image Position

In 1889, A. A. Markov proved the following inequality:INEQUALITY 1. (Markov [4]). If pn is any algebraic polynomial of degree at most n thenwhere ‖ ‖A denotes the supremum norm on A.In 1912, S. N. Bernstein establishedINEQUALITY 2. (Bernstein [2]). If pn is any algebraic polynomial of degree at most n thenfor x ∈ (a, b).In this paper we extend these inequalities to sets of the form [a, b] ∪ [c, d]. Let Πn denote the set of algebraic polynomials with real coefficients of degree at most n.THEOREM 1. Let a < b ≦ c < d and let pn ∈ Πn. Thenfor x ∈ (a, b).

Norm inequalities involving derivatives

1978 ◽  
Vol 82 (1-2) ◽  
pp. 51-70 ◽  
Author(s):  
W. D. Evans ◽  
A. Zettl
Keyword(s):  
General Class ◽  
New Method ◽  
Elementary Operator ◽  
Best Constant ◽  
New Approach ◽  
Theoretic Proof ◽  
General Class Of Functions ◽  
Image Position ◽  
Class Of Functions

SynopisisA new method for studying inequalities of the type ‖y(r)‖2<ε‖Sk−ry(k)‖2 + K(ε)‖S−ry‖2 and ‖y′‖2≦ Kp(S)‖Sy″‖ ‖S−1y‖ is presented here. With this new approach we obtain new and far reaching extensions of previously known inequalities of this sort as well as simpler proofs of the known cases. In addition we obtain an inequality of type ‖Sy′‖<ε‖(Sy′)′‖ + K(ε)‖y‖ for a general class of functions S. Also we give an elementary operator-theoretic proof of Everitt's characterization of the best constant as well as all cases of equality for

scholarly journals Poisson distribution series on a general class of analytic functions

2020 ◽  
Vol 24 (2) ◽  
pp. 241-251
Author(s):  
Basem A. Frasin
Keyword(s):  
Integral Operator ◽  
Poisson Distribution ◽  
Analytic Functions ◽  
General Class ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Class A ◽  
Poisson Distribution Series ◽  
Necessary And Sufficient

The main object of this paper is to find necessary and sufficient conditions for the Poisson distribution series to be in a general class of analytic functions with negative coefficients. Further, we consider an integral operator related to the Poisson distribution series to be in this class. A number of known or new results are shown to follow upon specializing the parameters involved in our main results.

Approximation by Unimodular Functions

1971 ◽  
Vol 23 (2) ◽  
pp. 257-269 ◽  
Author(s):  
Stephen Fisher
Keyword(s):  
Blaschke Product ◽  
Uniform Approximation ◽  
Unit Disc ◽  
Open Unit ◽  
Blaschke Products ◽  
Open Unit Disc ◽  
Pointwise Approximation ◽  
Finite Blaschke Product ◽  
Image Position ◽  
Restricted Zeros

The theorems in this paper are all concerned with either pointwise or uniform approximation by functions which have unit modulus or by convex combinations of such functions. The results are related to, and are outgrowths of, the theorems in [4; 5; 10].In § 1, we show that a function bounded by 1, which is analytic in the open unit disc Δ and continuous on may be approximated uniformly on the set where it has modulus 1 (subject to certain restrictions; see Theorem 1) by a finite Blaschke product; that is, by a function of the form*where |λ| = 1 and |αi| < 1, i = 1, …, N. In § 1 we also discuss pointwise approximation by Blaschke products with restricted zeros.

A definition of existence in terms of abstraction and disjunction

1957 ◽  
Vol 22 (4) ◽  
pp. 343-344
Author(s):  
Frederic B. Fitch
Keyword(s):  
Finite Number ◽  
Infinite Number ◽  
Recursive Relation ◽  
Basic Logic ◽  
Class A ◽  
Definition Of ◽  
Image Position

Greater economy can be effected in the primitive rules for the system K of basic logic by defining the existence operator ‘E’ in terms of two-place abstraction and the disjunction operator ‘V’. This amounts to defining ‘E’ in terms of ‘ε’, ‘έ’, ‘o, ‘ό’, ‘W’ and ‘V’, since the first five of these six operators are used for defining two-place abstraction.We assume that the class Y of atomic U-expressions has only a single member ‘σ’. Similar methods can be used if Y had some other finite number of members, or even an infinite number of members provided that they are ordered into a sequence by a recursive relation represented in K. In order to define ‘E’ we begin by defining an operator ‘D’ such thatHere ‘a’ may be thought of as an existence operator that provides existence quantification over some finite class of entities denoted by a class A of U-expressions. In other words, suppose that ‘a’ is such that ‘ab’ is in K if and only if, for some ‘e’ in A, ‘be’ is in K. Then ‘Dab’ is in K if and only if, for some ‘e and ‘f’ in A, ‘be’ or ‘b(ef)’ is in K; and ‘a’, ‘Da’, ‘D(Da)’, and so on, can be regarded as existence operators that provide for existence quantification over successively wider and wider finite classes. In particular, if ‘a’ is ‘εσ’, then A would be the class Y having ‘σ’ as its only member, and we can define the unrestricted existence operator ‘E’ in such a way that ‘Eb’ is in K if and only if some one of ‘εσb’, ‘D(εσ)b’, ‘D(D(εσ))b’, and so on, is in K.

Sign in / Sign up

Export Citation Format

Share Document