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.

210 Polynomial Approximation of Differential Equations<br />

9.6 Other techniques<br />

Variations of the principal methods exposed in the previous sections have been sug-<br />

gested by different authors, w<strong>it</strong>h the aim of preserving spectral accuracy and facil<strong>it</strong>ate<br />

numerical implementation.<br />

For example, we already noted that discretizations by the collocation method of lin-<br />

ear differential operators w<strong>it</strong>h non-constant coefficients, are much easier to implement<br />

than those using tau method. The discrepancy is more remarkable for nonlinear equa-<br />

tions (see sections 3.3 and 9.8). However, we can still work in the frequency space by<br />

combining different techniques. For instance, we modify problem (9.2.6) by setting<br />

(9.6.1)<br />

⎧<br />

⎨p<br />

⎩<br />

′ n + Πw,n−1[ Ĩw,n(Apn)] = Πw,n−1f<br />

pn(−1) = σ.<br />

in ] − 1,1],<br />

We can solve the linear system corresponding to (9.6.1) by an <strong>it</strong>erative method. In this<br />

way, whenever we need to evaluate the product Apn , we can go to the physical space<br />

by Fourier transform (see section 4.1) and perform this operation therein. We return to<br />

the frequency space by the inverse transform. Calculations are faster in the Chebyshev<br />

case, where we can use the FFT (see section 4.3). We remark that this algor<strong>it</strong>hm does<br />

not coincide w<strong>it</strong>h a genuine tau method. The computations, however, exhib<strong>it</strong> a spectral<br />

accuracy.<br />

Other methods have been developed starting from variational techniques. We con-<br />

sider for instance problem (9.1.4), which has a weak formulation given by (9.3.2)-(9.3.3)-<br />

(9.3.4) for σ1 = σ2 = 0. The Galerkin approximation is presented in (9.4.14) which<br />

is equivalent to (9.4.15). Assuming that w ≡ 1, from the orthogonal<strong>it</strong>y of Legendre<br />

polynomials, we easily wr<strong>it</strong>e the corresponding linear system, where the unknowns are<br />

the Fourier coefficients of pn, n ≥ 2. Using the same weight function, a different choice<br />

of the polynomial basis leads to the so called spectral element method introduced in<br />

patera(1984) (see also section 11.2). In this method, pn is expanded in terms of<br />

Chebyshev polynomials, i.e. pn = n<br />

k=0 ckTk. Therefore, subst<strong>it</strong>uting in (9.4.14), one<br />

obtains

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

Saved successfully!

Ooh no, something went wrong!