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.

Eigenvalue Analysis 175<br />

It is well-known that (8.6.1) has a countable set of pos<strong>it</strong>ive eigenvalues λm = π2<br />

4 m2 ,<br />

m ≥ 1, corresponding to the normalized eigenfunctions: φm(x) = sin π<br />

2<br />

m even, φm(x) = cos π<br />

2<br />

mx, x ∈ Ī,<br />

mx, x ∈ Ī, m odd. Besides, for any n ≥ 2, we have the<br />

eigenvalues λn,m, 1 ≤ m ≤ n −1, of problem (8.2.1). These will be assumed to be real,<br />

distinct and in increasing order.<br />

We are concerned w<strong>it</strong>h the asymptotic behavior of the λn,m’s when n tends to<br />

infin<strong>it</strong>y. Actually, we expect the following convergence result:<br />

(8.6.2) ∀m ≥ 1, lim<br />

n→+∞ λn,m = λm.<br />

This would suggest a technique for approximating the eigenvalues of differential opera-<br />

tors, which is a crucial problem in many applications of mathematical physics (see for<br />

instance courant and hilbert(1953), Vol.1). This procedure is investigated for the<br />

solution of a large number of problems in calogero and franco (1985). In that pa-<br />

per, discretizations of the derivative operators (denoted by Lagrangian differentiations)<br />

are obtained starting from an arb<strong>it</strong>rary set of nodes, not necessarily related to Gauss<br />

type formulas. Heuristic estimates of the rate of convergence of the lim<strong>it</strong> in (8.6.2) are<br />

presented in calogero(1983) for equispaced nodes and durand(1985) for Gauss type<br />

nodes. According to these papers the convergence is exponential, and, as pointed out by<br />

the authors in their numerical experiments, the results are defin<strong>it</strong>ely better than those<br />

obtained by other techniques, such as the fin<strong>it</strong>e-differences method.<br />

Remarks about the behavior of the eigenvalues in the Chebyshev case can be found<br />

in weideman and trefethen(1988). The authors make the following observation.<br />

For any fixed n ≥ 2, about two thirds of the eigenvalues in (8.2.1) are very close to<br />

the corresponding eigenvalues in (8.6.1). The remaining part of the spectrum deviates<br />

sharply. This behavior justifies the estimate (8.3.6), since λn,n−1 turns out to be<br />

proportional to n 4 , while λn just grows like n 2 . This fact is explained by the poor<br />

approximation properties of the eigenfunctions w<strong>it</strong>h high frequency oscillations, where<br />

the number of nodes is not sufficient to recover a satisfactory resolution (see section<br />

6.8). This does not imply that (8.6.2) is false. In fact, for fixed m, the eigenvalue<br />

λn,m begins to converge for sufficiently large n.

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

Saved successfully!

Ooh no, something went wrong!