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.

Ordinary Differential Equations 209<br />

(9.5.6)<br />

+∞<br />

(−p<br />

0<br />

′′ n + 2p ′ +∞<br />

n − pn)φw dx = (<br />

0<br />

Ĩw,nf)φw dx, ∀φ ∈ P 0 n−1.<br />

In (9.5.6), w(x) := xαe−x , x ∈ I, −1 < α < 1, is the Laguerre weight function. At this<br />

point, we use the quadrature formula (3.6.1). Taking as test functions the Lagrange<br />

polynomials ˜l (n)<br />

i , 1 ≤ i ≤ n − 1, we obtain the collocation scheme<br />

⎧<br />

⎨<br />

(9.5.7)<br />

⎩<br />

−p ′′ n(η (n)<br />

i ) + 2p ′ n(η (n)<br />

i ) + (µ − 1)pn(η (n)<br />

i ) = f(η (n)<br />

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

pn(η (n)<br />

0 ) = 0,<br />

which is the same one presented in (7.4.26) w<strong>it</strong>h σ = 0, q := Ia,n−1f, and a(x) :=<br />

xw(x), x ∈ I. For the numerical implementation we suggest taking into account the<br />

results of sections 3.10 and 7.5.<br />

Other differential equations are approximated in a similar way. Examples are found<br />

in maday, pernaud-thomas and vandeven(1985), and mavriplis(1989). For the<br />

domain I ≡ R, Herm<strong>it</strong>e functions are a su<strong>it</strong>able basis for computations when the<br />

solution decays like e −x2<br />

kavian(1988).<br />

at infin<strong>it</strong>y. Results in this direction are given in funaro and<br />

The l<strong>it</strong>erature offers several other numerical techniques for the treatment of prob-<br />

lems in unbounded domains by spectral methods. For instance, one can map the do-<br />

main I in the interval ] −1,1[ and approximate the new problem by Jacobi polynomial<br />

expansions. The main difficulty is to find coordinate transformations preserving the<br />

smoothness of the problem to avoid singular<strong>it</strong>ies and retain spectral accuracy. Early<br />

results were given in grosch and orszag(1977). Further indications and comparisons<br />

are provided in boyd(1982) and boyd(1989), chapter 13. Using the mapping approach,<br />

the solution of the original problem is not required to decay exponentially at infin<strong>it</strong>y as<br />

in the case of Laguerre or Herm<strong>it</strong>e approximations.<br />

The idea of truncating the domain is often used in applications. Here, <strong>it</strong> is not<br />

easy in general to detect the appropriate size of the computational domain. In add<strong>it</strong>ion,<br />

one introduces artificial boundaries, where a non correct specification of the behavior of<br />

the approximating polynomials may cause loss in accuracy. We describe an example in<br />

section 12.2.

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

Saved successfully!

Ooh no, something went wrong!