Math 2.0

Approximations and expansions Definition

Weighted polynomial approximation

Builds on Continuous functionPolynomial functionError of best approximation

Definition

Let w ⁣:ℝ→[0,∞)w \colon \R \to [0, \infty) be a continuous function, called the weight, such that xkw(x)→0x^k w(x) \to 0 as ∣x∣→∞\abs{x} \to \infty for every integer k≥0k \ge 0. Let CwC_w be the space of continuous functions f ⁣:ℝ→ℝf \colon \R \to \R with f(x)w(x)→0f(x) w(x) \to 0 as ∣x∣→∞\abs{x} \to \infty, with the seminorm ∥f∥w=sup⁡x∈ℝ∣f(x)∣w(x)\norm{f}_w = \sup_{x \in \R} \abs{f(x)} w(x). Let 𝒫n\mathcal{P}_n be the set of real polynomial functions of degree at most nn. Weighted polynomial approximation is the approximation of f∈Cwf \in C_w by elements of 𝒫n\mathcal{P}_n, measured by the weighted error En(f)w=inf⁡{∥f−p∥w:p∈𝒫n}.E_n(f)_w = \inf\set{\norm{f - p}_w : p \in \mathcal{P}_n} .

Remarks

The decay condition on ww ensures that every polynomial lies in CwC_w, so En(f)wE_n(f)_w is finite. En(f)wE_n(f)_w is the error of best approximation of ff from 𝒫n\mathcal{P}_n in the seminorm ∥⋅∥w\norm{\cdot}_w. Polynomials are dense in CwC_w exactly when En(f)w→0E_n(f)_w \to 0 for every f∈Cwf \in C_w; Bernstein's approximation problem asks for which weights this holds. The same name is used for the weighted LpL^p error inf⁡p(∫ℝ∣f−p∣pw dx)1/p\inf_p \left( \int_\R \abs{f - p}^p w \, dx \right)^{1/p}, and for weights on an interval. Example: w(x)=e−x2w(x) = e^{-x^2} satisfies the decay condition, since xke−x2→0x^k e^{-x^2} \to 0 for each kk. The function f(x)=∣x∣f(x) = \abs{x} is continuous with ∣x∣e−x2→0\abs{x} e^{-x^2} \to 0, so f∈Cwf \in C_w, and En(f)w≤∥f∥w=sup⁡x∣x∣e−x2=e−1/2/2E_n(f)_w \le \norm{f}_w = \sup_x \abs{x} e^{-x^2} = e^{-1/2}/\sqrt{2} for every nn, using p=0p = 0. In the weighted L2L^2 version with the same weight, the best constant approximation of x2x^2 is c=∫x2e−x2dx/∫e−x2dx=1/2c = \int x^2 e^{-x^2} dx \big/ \int e^{-x^2} dx = 1/2. Non-example: w≡1w \equiv 1 fails the decay condition, and then ∥p∥w=∞\norm{p}_w = \infty for every nonconstant polynomial pp.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Continuous function concept
  2. Error of best approximation concept
  3. Polynomial function concept
  4. Weighted polynomial approximation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Approximation_theory
About this page
TagZJD91FNTCY
URIm2://ZJD91FNTCY
Kinddefinition
WritingW0 stub
MSC41A81, 41A10
DefinesWeighted polynomial approximation
UsesContinuous function, Polynomial function, Error of best approximation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.