Approximation theory for exponential weights.

dc.contributor.authorKubayi, David Giyani.
dc.date.accessioned2018-12-18T12:36:45Z
dc.date.available2018-12-18T12:36:45Z
dc.date.issued1998
dc.description.abstractMuch 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.librarianAndrew Chakane 2018en_ZA
dc.identifier.urihttps://hdl.handle.net/10539/26227
dc.language.isoenen_ZA
dc.subjectApproximation theory.en_ZA
dc.subjectOrthogonal polynomials.en_ZA
dc.subjectPolynomials.en_ZA
dc.titleApproximation theory for exponential weights.en_ZA
dc.typeThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Kubayi David Giyani._Approximation theory for expo.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections