11.08.2013 Views

Untitled - Cdm.unimo.it

Untitled - Cdm.unimo.it

Untitled - Cdm.unimo.it

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Results in Approximation Theory 121<br />

Furthermore, we have the following inverse inequal<strong>it</strong>y.<br />

Theorem 6.7.3 - We can find a constant C > 0 such that, for any n ≥ 1<br />

(6.7.5) q ′ L 2 v (I) ≤ Cn q L 2 v (I), ∀q ∈ Sn.<br />

Proof - Set q = pe −x , p ∈ Pn, and recall (6.3.11).<br />

Next, we define the operator I ∗ v,n : C 0 ( Ī) → Sn−1, n ≥ 1, such that<br />

(6.7.6) I ∗ v,ng := [Iw,n(ge x )]e −x , ∀g ∈ C 0 ( Ī).<br />

In a similar way, one defines the interpolation operator Ĩ∗ v,n, based on the Gauss-Radau<br />

nodes. On the basis of theorem 6.6.4, one recovers estimates for the error g − I ∗ v,ng .<br />

Now let us set v(x) := w−1 (x) = ex2, x ∈ R, and define for any n ∈ N, the space Sn of<br />

the so called Herm<strong>it</strong>e functions. Any element of Sn is of the form pw, where p ∈ Pn.<br />

Furthermore, we introduce the operator Π ∗ v,n : L 2 v(R) → Sn, n ∈ N, such that<br />

(6.7.7) Π ∗ v,ng := [Πw,n(gv)]w, ∀g ∈ L 2 v(R).<br />

As in the previous case, we begin w<strong>it</strong>h a basic result.<br />

Lemma 6.7.4 - The following implication: f ∈ H k w(R) ⇔ g := fw ∈ H k v (R), is<br />

satisfied for any k ∈ N. Moreover, the corresponding norms are equivalent.<br />

Proof - It is possible to find real coefficients γ (k)<br />

m , 0 ≤ k ≤ m (see funaro(1991)),<br />

such that<br />

(6.7.8)<br />

<br />

R<br />

k d g<br />

dxk 2<br />

v dx =<br />

k<br />

m=0<br />

γ (k)<br />

m<br />

This completes the proof by virtue of (5.5.10) and (5.6.4).<br />

<br />

R<br />

m d f<br />

dxm 2 w dx.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!