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.

Numerical Integration 55<br />

3.7 Clenshaw-Curtis integration formulas<br />

The formulas analyzed in the previous sections are very accurate when the weighted<br />

integral of a polynomial is needed. The weight function is strictly related to the set of<br />

nodes in which the polynomial is known. Nevertheless, very often in applications, one<br />

is concerned w<strong>it</strong>h evaluating the integral corresponding to a different weight function.<br />

For example, we would like to compute 1<br />

pdx, where p is determined at some Jacobi<br />

−1<br />

Gauss-Lobatto nodes. This time, after integrating (3.2.7), we end up w<strong>it</strong>h the formula<br />

(3.7.1)<br />

1<br />

−1<br />

p dx =<br />

n<br />

j=0<br />

p(η (n)<br />

j ) χ (n)<br />

j ,<br />

where χ (n)<br />

j := 1<br />

−1 ˜l (n)<br />

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

Of course, relation (3.7.1) is exact for all polynomials in the space Pn. Unfortunately,<br />

if the nodes are not related to zeroes of derivatives of Legendre polynomials (in this<br />

case we would obtain: χ (n)<br />

j<br />

= ˜w(n)<br />

j , 0 ≤ j ≤ n), we cannot expect the formula to be<br />

exact for polynomials of degree higher than n. On the other hand, (3.7.1) is possibly<br />

interesting for future applications. For this reason, we give the expression of the weights<br />

in the case of Chebyshev nodes (which are presented in (3.1.11)), when n ≥ 4 is even.<br />

In practice, we have<br />

(3.7.2) χ (n)<br />

j =<br />

⎧<br />

⎪⎩<br />

1<br />

n 2 − 1<br />

if j = 0,<br />

⎪⎨<br />

⎡<br />

2<br />

⎣1 −<br />

n<br />

(−1)j<br />

n2 − 1 +<br />

n/2−1 <br />

<br />

2 2kjπ<br />

cos<br />

1 − 4k2 n<br />

k=1<br />

⎤<br />

⎦ if 1 ≤ j ≤ n<br />

2 ,<br />

χ (n)<br />

n−j<br />

if n<br />

2<br />

+ 1 ≤ j ≤ n.<br />

W<strong>it</strong>h this choice of nodes and weights, relation (3.7.1) is known as Clenshaw-Curtis<br />

formula (see davis and rabinow<strong>it</strong>z(1984)). This is exact for polynomials of degree<br />

not larger than n.

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

Saved successfully!

Ooh no, something went wrong!