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.

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

In (11.2.18), the c (2)<br />

j,k ’s are the Fourier coefficients of the polynomial p′′ n,k , which,<br />

thanks to the results of section 7.1, can be expressed in terms of the cj,k’s. For any<br />

1 ≤ k ≤ m, the quant<strong>it</strong>ies fj,k, j ∈ N, are the Fourier coefficients of f in ¯ Sk w<strong>it</strong>h<br />

respect to uj,k, j ∈ N. In the Legendre case, (11.2.18)-(11.2.21) are equivalent to the<br />

variational problem (11.2.11), for a su<strong>it</strong>able right-hand side function F.<br />

We finally note that the Legendre-Galerkin method is obtained by modifying the<br />

right-hand side of (11.2.11) by F(φ) := <br />

fφdx, ∀φ ∈ Xn.<br />

I<br />

Of course, different discretizations can be used in each subdomain. An example<br />

of a problem defined in an unbounded domain, solved by coupling Legendre and La-<br />

guerre approximations, is presented in section 12.2. The coupling of fin<strong>it</strong>e element and<br />

spectral methods is considered in bernardi, maday and sacchi-landriani(1989) and<br />

bernardi, deb<strong>it</strong> and maday(1990).<br />

First-order problems are approached in a similar way. For example, the differential<br />

equation (see also (9.1.3))<br />

(11.2.22)<br />

can be wr<strong>it</strong>ten as<br />

(11.2.23)<br />

⎧<br />

⎪⎨<br />

⎧<br />

⎨U<br />

′ + AU = f in ]s0,sm],<br />

⎩<br />

U(s0) = σ,<br />

U ′ k + AUk = f in ]sk−1,sk[, 1 ≤ k ≤ m − 1,<br />

U ′ m + AUm = f in ]sm−1,sm],<br />

Uk(sk) = Uk+1(sk) 1 ≤ k ≤ m − 1,<br />

⎪⎩<br />

U1(s0) = σ,<br />

where Uk is the restriction of U to the set [sk−1,sk], 1 ≤ k ≤ m.<br />

A multidomain collocation scheme is obtained by finding the polynomials pn,k ∈ Pn,<br />

1 ≤ k ≤ m, such that<br />

(11.2.24) (p ′ n,k + Apn,k)(θ (n,k)<br />

i ) = f(θ (n,k)<br />

i ) 1 ≤ i ≤ n − 1, 1 ≤ k ≤ m − 1,<br />

(11.2.25) (p ′ n,m + Apn,m)(θ (n,m)<br />

i ) = f(θ (n,m)<br />

i ) 1 ≤ i ≤ n,

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

Saved successfully!

Ooh no, something went wrong!