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.

Ordinary Differential Equations 201<br />

Choosing as test functions the Lagrange polynomials φ := ˜l (n)<br />

i , 1 ≤ i ≤ n − 1, we<br />

obtain the relations −p ′′ n(η (n)<br />

i ) = f(η (n)<br />

i ), 1 ≤ i ≤ n − 1 (see (9.2.15) and (7.4.9)).<br />

To show that pn converges to U when n → +∞, we use theorem 9.4.1. Therefore, we<br />

must bound the error |Fw(φ) − Fw,n(φ)|, φ ∈ P 0 n. Recalling relation (3.8.15) one gets<br />

(9.4.12)<br />

<br />

Fw(φ) − Fw,n(φ) = (f − Ĩw,nf,φ)w + [( Ĩw,nf,φ)w − ( Ĩw,nf,φ)w,n] <br />

≤ f − Ĩw,nfwφw<br />

<br />

<br />

un<br />

+ <br />

<br />

2 w,n − un2 w<br />

un2 (<br />

w,n<br />

Ĩw,nf,un)w,n<br />

<br />

<br />

(φ,un)w,n <br />

<br />

unw,n unw,n <br />

<br />

≤ f − Ĩw,nfw + C |(Ĩw,nf,un)w,n|<br />

<br />

φw, ∀φ ∈ P 0 n,<br />

unw,n<br />

where un := P (α,β)<br />

n , n ∈ N, and C > 0 does not grow w<strong>it</strong>h n (see section 3.8). By<br />

formula (3.5.1) and orthogonal<strong>it</strong>y, one has (Πw,n−1ψ,un)w,n = (Πw,n−1ψ,un)w = 0,<br />

∀ψ ∈ Pn. This implies that<br />

(9.4.13)<br />

≤ γ −1<br />

1<br />

|( Ĩw,nf,un)w,n|<br />

unw,n<br />

≤ Ĩw,nf − Πw,n−1( Ĩw,nf)w,n<br />

<br />

Ĩw,nf − fw + f − Πw,n−1fw + Πw,n−1(f − Ĩw,nf)w<br />

<br />

, n ≥ 2.<br />

For the last inequal<strong>it</strong>y we used (3.8.6) and (2.1.5). By combining (9.4.12) and (9.4.13),<br />

final estimates are obtained using the results of sections 6.2 and 6.6. The results of a<br />

numerical experiment are documented in table 11.2.1.<br />

The study of the approximation of elliptic problems, on the basis of their variational<br />

formulations, is a standard technique in fin<strong>it</strong>e element or fin<strong>it</strong>e-differences methods. Cel-<br />

ebrated examples are considered for instance in aubin (1972), strang and fix(1973),<br />

ciarlet(1978), fletcher(1984), and in many other books. The simplest approxima-<br />

tion technique is in general represented by the so called Galerkin method. W<strong>it</strong>hin the<br />

framework of polynomial approximations, this procedure consists in finding pn ∈ P 0 n<br />

such that

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

Saved successfully!

Ooh no, something went wrong!