
Numerical Methods 273
then multiply the result by M again, and so on, repeatedly. The effect is to amplify
at an exponentially growing rate the component of a\ that is parallel to the lowest
eigenvector ê\. After multiplying a\ by M r times, the result is the vector
N
E
\
V
:êi{êi ·α\). Write a\ in a basis given by ê„ and begin mul- (10.15)
' «plying by M.
i=l
Because a\ has been chosen randomly, there is no reason for â-ê\ to vanish, and
as r grows, the term proportional to this factor must grow to dominate the sum.
The rapidity with which this happens depends upon the separation between λι and
\2',
if they are degenerate, then the first two terms in the sum grow together. In
any event, after sufficient multiplication of M upon a\, the result is proportional
to êi, and both the lowest eigenvector and eigenvalue are determined. What of the
next-lowest eigenvalue? It may be found by using the knowledge of ê\ to eliminate
anything proportional to ê\ from the sum (10.15). Repeat the multiplication pro-
cess,
but beginning with
cÎ2
= a\—ê\{ê\-a) rather than a\. If even a small bit of ë\
is left in the result due to numerical error, it will grow exponentially rapidly when
02 is multiplied by M. After every one or two multiplications one needs to project
out the component of
ë\
again. However, now the part of the sum dominated by the
next-lowest eigenvalue will grow exponentially out of all the rest, giving ëi. Given
êi, «3 =
0.2
—
êïiai
-ë-i),
provides a starting point for finding êj, and so on.
The task of multiplying an 800 x 800 matrix a few times into a vector is a great
improvement over the task of finding 800 eigenvalues, but is still burdensome. A
great virtue of using plane waves as basis functions lies in the fact that no matrix
of such a size needs to be stored at all, and its action upon wave vectors can be
computed much more rapidly than might at first seem possible.
Consider, for example, any Hamiltonian of the form
pi In order for this method to be effective, U should be a
ryr \-U (R\ P
seu
d°P
ote
ntial, smaller than the true ionic potential and ( i n I f.\
1™ \ )■ without a singularity near the origin. ^ ' '
The goal now is to find the lowest eigenvalues and corresponding eigenvectors of
Eq. (10.16), using the form of Schrödinger's equation displayed in Eq. (7.33) and
taking the wave function φ to have the form given in Eq. (7.35). Of course, instead
of using an infinite number of reciprocal lattice vectors, one builds ψ out of a finite
number of them. If the low-lying eigenvalues are to be deduced by multiplying ψ
by
"K
repeatedly, one must begin by ensuring that the large negative eigenvalues of
Ji are larger in absolute value than the large positive eigenvalues. Suppose
K
max
to be the magnitude of the largest reciprocal lattice vector appearing in Eq. (7.33).
The kinetic energy of the corresponding plane wave would be /i
2
A'
max
/2m = £
max
;
the kinetic energy dominates the large positive eigenvalues of "K, because the po-
tential energy of a plane wave with large
K
max
should be comparatively small. So,
taking the operator acting upon ψ to be
K' -,
This is a restatement of Eq. (7.33), with rp(q) written as V„j (K), where K is the reciprocal
lattice vector so that a
—
K = k lies in the first Brillouin zone.