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.

Domain-Decompos<strong>it</strong>ion Methods 257<br />

(11.2.14) p ′ nk,k(sk−1) − p ′ nk+1,k+1(sk+1) =<br />

which is suggested by the ident<strong>it</strong>y<br />

(11.2.15) U ′ (sk−1) − U ′ sk+1<br />

(sk+1) = −<br />

sk−1<br />

sk+1<br />

sk−1<br />

U ′′ dx =<br />

f dx 1 ≤ k ≤ m − 1,<br />

sk+1<br />

sk−1<br />

f dx 1 ≤ k ≤ m − 1.<br />

The integral in (11.2.14) can be computed by quadrature, for instance by the Clenshaw-<br />

Curtis formula once the values of f at the nodes are known (see section 3.7). This<br />

approach was suggested in macaraeg and streett(1986) and produces results com-<br />

parable to those based on relation (11.2.6). Going back to the example previously<br />

illustrated, (11.2.14) w<strong>it</strong>h m = 2 is obtained by setting in (11.2.13): τ1 := 2 ˜ d (1)<br />

00 ,<br />

τ2 := 2 ˜ d (1)<br />

01 , τ3 := 2 ˜ d (1)<br />

02 , τ4 := −2 ˜ d (1)<br />

20 , τ5 := −2 ˜ d (1)<br />

21 , τ6 := −2 ˜ d (1)<br />

22 , and by replacing<br />

the fourth entry of the right-hand side vector by 1<br />

−1 fdx.<br />

The spectral element method (see patera(1984) and section 9.6) uses in the Cheby-<br />

shev case a variational formulation similar to that in (11.2.11) (we recall that this cor-<br />

responds to an approximation of problem (11.2.1) w<strong>it</strong>h σ1 = σ2 = 0). In any interval<br />

¯Sk, 1 ≤ k ≤ m, we consider the expansion pn,k = n<br />

j=0<br />

(11.2.16) ˜ l (n,k)<br />

j<br />

pn,k(θ (n,k)<br />

j<br />

) ˜l (n,k)<br />

j , where<br />

(x) := ˜l (n) <br />

j (2x − sk − sk−1)/(sk − sk−1) , ∀x ∈ ¯ Sk, 0 ≤ j ≤ n.<br />

The nodes are obtained from (11.2.3), where η (n)<br />

j , 0 ≤ j ≤ n, are the Gauss-Lobatto<br />

Chebyshev points (see (3.1.11)). The associated Lagrange polynomials ˜ l (n)<br />

j , 0 ≤ j ≤ n,<br />

are defined in (3.2.10). Next, we modify the right-hand side of (11.2.11) by defining<br />

(11.2.17)<br />

m<br />

<br />

n<br />

Fn(φ) := f(θ (n,k)<br />

<br />

i ) ˜(n,k) l i φ dx ,<br />

Sk<br />

∀φ ∈ Xn.<br />

k=1<br />

i=1<br />

The set of equations is obtained by testing on the functions φ ≡ φk,j ∈ Xn, such that<br />

⎧<br />

⎨˜(n,k)<br />

l j (x)<br />

φk,j(x) :=<br />

⎩<br />

if x ∈ ¯ 0<br />

Sk<br />

if x ∈ Ī − ¯ Sk<br />

1 ≤ j ≤ n − 1, 1 ≤ k ≤ m,

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

Saved successfully!

Ooh no, something went wrong!