11.08.2013 Views

Untitled - Cdm.unimo.it

Untitled - Cdm.unimo.it

Untitled - Cdm.unimo.it

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

106 Polynomial Approximation of Differential Equations<br />

(6.3.6) p ′ L 2 w (I) ≤ Cn 2 p L 2 w (I), ∀p ∈ Pn.<br />

Proof - We set p = n<br />

k=0 ckuk, where {uk}k∈N is the sequence of Jacobi polynomials<br />

relative to the weight function w. From relations (2.2.15) and (2.2.8), we get<br />

(6.3.7) p ′ 2 L2 a (I) =<br />

=<br />

n<br />

k=1<br />

c 2 kλk uk 2 L2 w (I) ≤ λn<br />

n<br />

k=1<br />

n<br />

k=0<br />

c 2 k u ′ k 2 L 2 a (I)<br />

c 2 k uk 2 L 2 w (I) ≤ C2 n 2 p 2 L 2 w (I),<br />

where we observed that the eigenvalue λn behaves like n 2 . To obtain (6.3.6), we first<br />

apply lemma 6.3.1 to the polynomial p ′ and then use (6.3.5).<br />

As a byproduct of the previous theorem, <strong>it</strong> is not difficult to get, for any n ≥ 1<br />

(6.3.8) p H m w (I) ≤ Cn 2(m−k) p H k w (I), ∀p ∈ Pn, ∀m,k ∈ N, m ≥ k.<br />

When w is the Legendre weight function, relation (6.3.8) is the Schmidt inequal<strong>it</strong>y (see<br />

bellman(1944)). Using different arguments, (6.3.8) was established in canuto and<br />

quarteroni (1982a) for Chebyshev weights.<br />

We study now the Laguerre case (a(x) = xw(x) = x α+1 e −x , α > −1, x ∈ I =]0,+∞[).<br />

Lemma 6.3.3 - We can find two constants C1,C2 > 0 such that, for any n ≥ 1<br />

(6.3.9)<br />

C1<br />

√<br />

√ pL2 a (I) ≤ pL2 w (I) ≤ C2 n pL2 a (I), ∀p ∈ Pn.<br />

n<br />

Proof - As done in the proof of lemma 6.3.1, let ξ (m)<br />

j , 1 ≤ j ≤ m, be the zeroes of<br />

L (α)<br />

m , m = n + 1. Then one has the inequal<strong>it</strong>y C ∗ 1 1<br />

n<br />

≤ ξ(m)<br />

j<br />

≤ C∗ 2n, 1 ≤ j ≤ m (see<br />

section 3.1), where C ∗ 1,C ∗ 2 > 0 do not depend on n. Now we can easily deduce (6.3.9).

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

Saved successfully!

Ooh no, something went wrong!