Approximation theory for exponential weights.

dc.contributor.author	Kubayi, David Giyani.
dc.date.accessioned	2018-12-18T12:36:45Z
dc.date.available	2018-12-18T12:36:45Z
dc.date.issued	1998
dc.description.abstract	Much of weighted polynomial approximation originated with the famous Bernstein qualitative approximation problem of 1910/11. The classical Bernstein approximation problem seeks conditions on the weight functions \V such that the set of functions {W(x)Xn};;"=l is fundamental in the class of suitably weighted continuous functions on R, vanishing at infinity. Many people worked on the problem for at least 40 years. Here we present a short survey of techniques and methods used to prove Markov and Bernstein inequalities as they underlie much of weighted polynomial approximation. Thereafter, we survey classical techniques used to prove Jackson theorems in the unweighted setting. But first we start, by reviewing some elementary facts about orthogonal polynomials and the corresponding weight function on the real line. Finally we look at one of the processes (If approximation, the Lagrange interpolation and present the most recent results concerning mean convergence of Lagrange interpolation for Freud and Erdos weights.	en_ZA
dc.description.librarian	Andrew Chakane 2018	en_ZA
dc.identifier.uri	https://hdl.handle.net/10539/26227
dc.language.iso	en	en_ZA
dc.subject	Approximation theory.	en_ZA
dc.subject	Orthogonal polynomials.	en_ZA
dc.subject	Polynomials.	en_ZA
dc.title	Approximation theory for exponential weights.	en_ZA
dc.type	Thesis	en_ZA

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1