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.

Time-Dependent Problems 231<br />

= −2ζ<br />

n<br />

j=0<br />

<br />

∂pn<br />

∂x pn<br />

<br />

(η (n)<br />

j ,t) w (n)<br />

j<br />

1<br />

∂pn<br />

= −2ζ<br />

−1 ∂x pn dx = −ζp 2 n(1,t) ≤ 0.<br />

This shows that the norm pn(·,t)w,n, t ∈ [0,T], is bounded by Ĩw,nU0w,n. This<br />

last term is bounded w<strong>it</strong>h respect to n, when U0 is sufficiently regular. A proof of<br />

convergence is given, using similar arguments, by estimating the error pn − Un, where<br />

Un ∈ Pn, n ≥ 1, is a su<strong>it</strong>able projection of the solution U.<br />

Unfortunately, the same techniques are not effective when different weight functions w<br />

are considered. As pointed out in gottlieb and orszag(1977), p.89, in the Chebyshev<br />

case (w(x) = 1/ √ 1 − x 2 , x ∈] − 1,1[), we cannot expect convergence of pn to U in<br />

the norm · w. In the papers of gottlieb and turkel(1985) and salomonoff<br />

and turkel(1989), convergence estimates for Chebyshev-collocation approximations<br />

are proven in a norm weighted by the function w(x) := (1 − x)/(1 + x), x ∈] − 1,1[,<br />

but the theoretical analysis is harder than in the Legendre case.<br />

A different treatment of the boundary cond<strong>it</strong>ions is possible. We modify (10.3.6)<br />

as follows:<br />

(10.3.9)<br />

∂pn<br />

∂t (η(n)<br />

0 ,t) = −ζ ∂pn<br />

∂x (η(n) 0 ,t) − γ pn(η (n)<br />

0 ,t), ∀t ∈]0,T],<br />

where γ > 0. Basically, we are trying to force the polynomial pn to satisfy, at the<br />

point x = −1, both the boundary constraint and the differential equation (the same<br />

trick used in section 9.4 for the Neumann problem). This leads to a (n + 1) × (n + 1)<br />

differential system, where the corresponding matrix is considered in section 7.4 (see<br />

(7.4.6) for the case n = 3). The eigenvalues of this matrix are examined in section<br />

8.1. When γ is proportional to n 2 , a proof of convergence can be given. The Legendre<br />

and Chebyshev cases are examined in funaro and gottlieb(1989) and funaro and<br />

gottlieb(1988) respectively.<br />

Let us now introduce the tau method for σ ≡ 0. This is obtained by projecting<br />

equation (10.3.1) onto the space Pn−1, n ≥ 1. Then, we are concerned w<strong>it</strong>h finding<br />

pn(·,t) ∈ Pn, t ∈ [0,T], such that<br />

<br />

∂pn<br />

(10.3.10) Πw,n−1 (x,t) = −ζ<br />

∂t<br />

∂pn<br />

(x,t), ∀x ∈] − 1,1], ∀t ∈]0,T].<br />

∂x

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

Saved successfully!

Ooh no, something went wrong!