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.

Eigenvalue Analysis 167<br />

the magn<strong>it</strong>ude of the eigenvalues grows w<strong>it</strong>h n. It is especially for the eigenvalues w<strong>it</strong>h<br />

the largest modulus that the ratio between the real part and the imaginary part is small.<br />

According to (7.6.3), this yields a very restrictive cond<strong>it</strong>ion on θ. For instance, in the<br />

Chebyshev case, the parameter θ is required to be proportional to 1/n 2 to achieve<br />

convergence when applying the Richardson method. This makes the spectral radius in<br />

(8.3.5) very close to 1. Consequently, the Richardson scheme is very ineffective. The<br />

s<strong>it</strong>uation is worse for the Legendre case.<br />

Concerning second-order or fourth-order problems, no improvements are observed.<br />

Although the eigenvalues are in general real and pos<strong>it</strong>ive, they are qu<strong>it</strong>e scattered. For<br />

instance, referring to problem (8.2.1), <strong>it</strong> is not difficult to obtain the estimate<br />

(8.3.6) c1 ≤ |λn,m| ≤ c2 n 4 , 1 ≤ m ≤ n − 1,<br />

where c1 and c2 are pos<strong>it</strong>ive constants.<br />

Moreover, assuming that the λn,m’s are real and in increasing order, we find that λn,1<br />

converges to a real number for n → +∞, while λn,n−1 grows like n 4 . Sharper<br />

estimates are given in weideman and trefethen(1988) in the Chebyshev case, and<br />

in vandeven (1990) in the Legendre case. For the proof of (8.3.6), when −1 < α < 1,<br />

−1 < β < 1, we refer the reader to section 8.6.<br />

Thus, the cond<strong>it</strong>ion number of the matrix corresponding to the system (7.4.9) is ex-<br />

pected to be very large. The minimal spectral radius obtained from (8.3.5) is ρ =<br />

(λn,n−1 − λn,1)/(λn,n−1 + λn,1), relative to the choice θ := 2/(λn,n−1 + λn,1) (see<br />

isaacson and keller(1966), p.84). Therefore, ρ is very close to 1, and the con-<br />

vergence of the scheme is unbelievably slow. The s<strong>it</strong>uation becomes extremely bad<br />

for fourth-order problems. In heinrichs(1989), the author suggests a way to replace<br />

problem (7.4.9) w<strong>it</strong>h an equivalent one, whose matrix has a reduced cond<strong>it</strong>ion number.<br />

Such an improvement is still insufficient when applied w<strong>it</strong>hin the framework of <strong>it</strong>erative<br />

techniques.<br />

It is time now to introduce the idea of precond<strong>it</strong>ioning. We note that the scheme<br />

(7.6.2) can be interpreted as a byproduct of the Richardson method w<strong>it</strong>h θ = 1, applied<br />

to the system

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

Saved successfully!

Ooh no, something went wrong!