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.

Ordinary Differential Equations 187<br />

(9.2.13) Ĩw,nU ′ − ( Ĩw,nU) ′ w,n ≤ γ −1<br />

1 Ĩw,nU ′ − ( Ĩw,nU) ′ L 2 w (I)<br />

≤ γ −1<br />

1<br />

<br />

Ĩw,nU ′ − U ′ L 2 w (I) + ( Ĩw,nU − U) ′ L 2 w (I)<br />

<br />

, n ≥ 1.<br />

Finally, we use inequal<strong>it</strong>ies like (6.6.1) and (6.6.8) to estimate the last term. This shows<br />

that sn L 2 w (I) tends to zero for n → +∞. Thus, we get (9.2.8).<br />

As seen from the proof given above, the rate of convergence in (9.2.8) is the typical<br />

one of spectral approximations. In particular, for analytic solutions U, the decay of<br />

the error is exponential. The extension of theorem 9.2.1 to other Jacobi weights is not<br />

straightforward. Convergence estimates for the Chebyshev case can be derived from<br />

the results in solomonoff and turkel(1989). The use of collocation nodes relative to<br />

Gauss type formulas is helpful in the theoretical analysis, since <strong>it</strong> allows us to subst<strong>it</strong>ute<br />

summations w<strong>it</strong>h integrals as in (9.2.11). Unfortunately, when the weight function w<br />

is singular at the boundary, the integrals cannot be manipulated further. This is the<br />

major drawback in the analysis of approximations involving Chebyshev polynomials.<br />

For example, the quant<strong>it</strong>y <br />

I φ′ φwdx, φ ∈ Pn, φ(−1) = 0 is not in general pos<strong>it</strong>ive<br />

when w(x) = 1/ √ 1 − x 2 , x ∈ I (see gottlieb and orszag(1977), p.89).<br />

First, we show the results of numerical experiment when U is a very smooth func-<br />

tion. We choose σ = 0 and A(x) := 1+x2 , x ∈ Ī. The datum f in (9.1.3) is such that<br />

U(x) := sin (1 + x), x ∈ Ī. In table 9.2.1, we give the error En := pn − Ĩw,nU L 2 w (I) for<br />

various n, when pn is obtained w<strong>it</strong>h the scheme (9.2.7) relative to the Legendre nodes.<br />

It is evident that the convergence is extremely fast. Note that, from (9.2.9), the error<br />

pn − U L 2 w (I) is bounded by En plus a term which does not depend on the poly-<br />

nomial pn. Therefore, the examination of En gives sufficient information about the<br />

efficiency of the approximation technique. In add<strong>it</strong>ion, according to formula (3.8.10),<br />

the computation of En is obtained from the values of pn at the nodes. These values<br />

are the actual solutions of (9.2.7), after inverting the linear system corresponding to<br />

(7.4.7).

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

Saved successfully!

Ooh no, something went wrong!