The Weierstrass polynomial approximation theorem

Groundwater is being contaminated rapidly due to various anthropogenic activities and geogenic sources. In this direction, assessment of water quality analysis is the basic requirement for nurturing the human being and its evolution. The Water Quality Index (WQI) parameter has been widely used in determining water quality globally. The study aims to provide the suitability of groundwater in the specified region using the polynomial approximation method for drinking and irrigation purposes along with the computation of WQI using the conventional method. Weierstrass's polynomial approximation theorem along with longitudinal and latitudinal values has been used to evaluate the polynomial regarding various physicochemical parameters. To validate the obtained results from the present approach, groundwater quality data collected and analyzed from the Pindrawan tank area in Raipur district, Chhattisgarh, India, have been used. The result is obtained, i.e., the intermediate value of the parameters obtained correctly from the mathematical modeling, with an average error of 7%. This polynomial approximation method can also be used as the substitute of inverse modeling to determine the location of the source in the two-dimensional system. The approach output can be beneficial to administrators in making decisions on groundwater quality and gaining insight into the tradeoff between system benefit and environmental requirement.

Possibility of Approximation: 1. Basic notions 2. Linear operators 3. Approximation theorems 4. The theorem of Stone 5. Notes Polynomials of Best Approximation: 1. Existence of polynomials of best approximation 2. Characterization of polynomials of best approximation 3. Applications of convexity 4. Chebyshev systems 5. Uniqueness of polynomials of best approximation 6. Chebyshev's theorem 7. Chebyshev polynomials 8. Approximation of some complex functions 9. Notes Properties of Polynomials and Moduli of Continuity: 1. Interpolation 2. Inequalities of Bernstein 3. The inequality of Markov 4. Growth of polynomials in the complex plane 5. Moduli of continuity 6. Moduli of smoothness 7. Classes of functions 8. Notes The Degree of Approximation by Trigonometric Polynomials: 1. Generalities 2. The theorem of Jackson 3. The degree of approximation of differentiable functions 4. Inverse theorems 5. Differentiable functions 6. Notes The Degree of Approximation by Algebraic Polynomials: 1. Preliminaries 2. The approximation theorems 3. Inequalities for the derivatives of polynomials 4. Inverse theorems 5. Approximation of analytic functions 6. Notes Approximation by Rational Functions. Functions of Several Variables: 1. Degree of rational approximation 2. Inverse theorems 3. Periodic functions of several variables 4. Approximation by algebraic polynomials 5. Notes Approximation by Linear Polynomial Operators: 1. Sums of de la Vallee-Poussin. Positive operators 2. The principle of uniform boundedness 3. Operators that preserve trigonometric polynomials 4. Trigonometric saturation classes 5. The saturation class of the Bernstein polynomials 6. Notes Approximation of Classes of Functions: 1. Introduction 2. Approximation in the space 3. The degree of approximation of the classes 4. Distance matrices 5. Approximation of the classes 6. Arbitrary moduli of continuity Approximation by operators 7. Analytic functions 8. Notes Widths: 1. Definitions and basic properties 2. Sets of continuous and differentiable functions 3. Widths of balls 4. Applications of theorem 2 5. Differential operators 6. Widths of the sets 7. Notes Entropy: 1. Entropy and capacity 2. Sets of continuous and differentiable functions 3. Entropy of classes of analytic functions 4. More general sets of analytic functions 5. Relations between entropy and widths 6. Notes Representation of Functions of Several Variables by Functions of One Variable: 1. The Theorem of Kolmogorov 2. The fundamental lemma 3. The completion of the proof 4. Functions not representable by superpositions 5. Notes Bibliography Index.

A direct theorem for best polynomial approximation of a function in L p [ − 1 , 1 ] , 0 > p > 1 {L_p}[ - 1,1],\;0 > p > 1 , has recently been established. Here we present a matching inverse theorem. In particular, we obtain as a corollary the equivalence for 0 > α > k 0 > \alpha > k between E n ( f ) p = O ( n − α ) {E_n}{(f)_p} = O({n^{ - \alpha }}) and ω φ k ( f , t ) p = O ( t α ) \omega _\varphi ^k{(f,t)_p} = O({t^\alpha }) . The present result complements the known direct and inverse theorem for best polynomial approximation in L p [ − 1 , 1 ] , 1 ⩽ p ⩽ ∞ {L_p}[ - 1,1],\;1 \leqslant p \leqslant \infty . Analogous results for approximating periodic functions by trigonometric polynomials in L p [ − π , π ] , 0 > p ⩽ ∞ {L_p}[ - \pi ,\pi ],0 > p \leqslant \infty , are known.

Standard and nonstandard polynomial approximation

Introduction Statement of main results Properties of harmonic functions Polynomial inequalities with exponential weights Entire functions of exponential type and their approximation properties Polynomial interpolation and approximation of entire functions of exponential type Proofs of the limit theorems Applications Multidimensional limit theorems of polynomial approximation with exponential weights Examples Appendix A. Negativity of a kernel Bibliography Index.

The paper contains an account of some recent results concerning complex finite-difference moduli of smoothness of functions on sets of the complex plane and their applications to polynomial approximation problems and con-formal mapping theory. There are given: the general normality result for the moduli of smoothness for a class of sets including all those appearing in the well known direct theorems of polynomial approximation with exact order of approximation; results on moduli of smoothness of function superpositions and applications to conformai mapping; and also strongly local theorems of polynomial approximation, local and global versions of such theorems with mixed majorants.

The Weierstrass polynomial approximation theorem plays a central role in showing approximation capability of polynomial-based higher-order feedforward networks. The Bernstein polynomials are a family of polynomials which satisfy the Weierstrass polynomial theorem. Baldi (1991) interpreted the Bernstein polynomials in connectionist framework and argued that they can be viewed as a model for biological bell-shaped receptive fields. However, due to their strict constraint of equally-spaced input points, their connectionist interpretation has some problems in the real-world setting. In this paper, we present the modified Bernstein polynomials which have lesser constraints on the position of input points. The modified Bernstein polynomials can directly utilize given input/output data with a minor constraint on the position of the input points. We present theorems that show the approximation capability of the modified Bernstein polynomials. The relationship between the modified Bernstein polynomials and other higher-order feedforward network approaches is also discussed. >

Polynomial approximation with doubling weights having finitely many zeros and singularities

Uniform polynomial approximation

We prove here some polynomial approximation theorems, somewhat related to the Szasz-Mfintz theorem, but where the domain of approximation is the integers, by dualizing a gap theorem of C. l ~ Y I for periodic entire functions. In another Paper [7], we shall prove, by similar means, a completeness theorem ibr some special sets of entire functions. I t is well known (see, for example [l]) tha t i f E is the space of all entire functions in the topology of uniform convergence on compact sets, then the dual space of continuous complex-valued linear functionals on E may be represented as E0, the space of entire functions of exponential type. Now let E (1) b e the space of entire functions of period 1. Then it may be shown that the dual of E (1) can be represented as E0 (l), where E0(1) is the following quotient space of E0: define / ~ g for functions 1, g e E0 i f / _ g is a multiple of sin z~z, and let E0 (l) be the space of equivalence classes of E0 modulo this relation of equivalence. Now E0(1) is apparent ly the same space as the space of restrictions of functions in E0 to the integers Z. Each such restriction is just a two-sided sequence of complex numbers, of at most exponential growth. ConVersely, it is easy to interpolate any such sequence by an entire function of exponential type. Thus, the dual of E(1) is just the space of all such sequences. Actually, we establish this identification by another procedure. To any theorem about periodic entire functions will correspond a theorem about the space of sequences described above. In [6], C. RI~NYI proved an interesting gap theorem, reproduced below. We show by means of duality tha t certain theorems of polynomial approximation are equivalent to this theorem. The domain of approximation is the integers in one case, and the positive integers in another ease. To our knowledge, the problem of polynomial approximation on the integers has not been Considered except in the note [3]. We know of no direct proof of our results. Ultimately, the R ~ Y I result depends on a simple application of Rolle's theorem. I t Would be of interest to have more precise gap theorems than the R~NYr theorem and also to have direct proofs of the results we prove by means of it.

This paper discusses the approximations with the local basis of the second level and the sixth order. We call it the approximation of the second level because in addition to the function values in the grid nodes it uses the values of the function, and the first and the second derivatives of the function. Here the polynomial approximations and the non-polynomial approximations of a special form are discussed. The non-polynomial approximation has the properties of polynomial and trigonometric functions. The approximations are twice continuously differentiable. Approximation theorems are given. These approximations use the values of the function at the nodes, the values of the first and the second derivatives of the function at the nodes, and the local basis splines. These basis splines are used for constructing variational-difference schemes for solving boundary value problems for differential equations. Numerical examples are given

Polynomial Approximation on Compact Sets

We consider the problem of polynomial approximation to a real valued functionf defined on a compact set\(\mathbb{X}\). An approximation theorem is proven in terms of the newly defined modulus of approximation. It is shown to imply a multidimensional Jackson type theorem which is stronger than previously known results even for the interval [−1, 1]. A strong multidimensional Bernstein type inverse theorem is also proven. We allow quite general approximation quasi-norms including\(\mathcal{L}^{q} \) for 0<q≤∞.

Weighted Polynomial Approximation for Weights with Slowly Varying Extremal Density

The present review paper provides recent results on convexity and its applications to the constrained extension of linear operators, motivated by the existence of subgradients of continuous convex operators, the Markov moment problem and related Markov operators, approximation using the Krein–Milman theorem, related optimization, and polynomial approximation on unbounded subsets. In many cases, the Mazur–Orlicz theorem also leads to Markov operators as solutions. The common point of all these results is the Hahn–Banach theorem and its consequences, supplied by specific results in polynomial approximation. All these theorems or their proofs essentially involve the notion of convexity.