11.03.2014 Views

Itinerant Spin Dynamics in Structures of ... - Jacobs University

Itinerant Spin Dynamics in Structures of ... - Jacobs University

Itinerant Spin Dynamics in Structures of ... - Jacobs University

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.

96 Chapter 5: <strong>Sp<strong>in</strong></strong> Hall Effect<br />

Us<strong>in</strong>g the recursion relations <strong>of</strong> the polynomials,<br />

T 0 (x) = 1, T −1 (x) = T 1 (x) = x,<br />

T m+1 (x) = 2xT m (x)−T m−1 (x), (5.34)<br />

and correspond<strong>in</strong>gly for the polynomials <strong>of</strong> the second k<strong>in</strong>d<br />

U 0 (x) = 1, U −1 (x) = 0,<br />

U m+1 (x) = 2xU m (x)−U m−1 (x), (5.35)<br />

one can calculate the expansion coefficients µ n iteratively. Replac<strong>in</strong>g the variable x by the<br />

Hamiltonian one can calculate various spectral quantities. The simplest example is the<br />

calculation <strong>of</strong> the spectral density,<br />

with the coefficients given by<br />

ρ(E) = 1 D<br />

µ n =<br />

∫ 1<br />

−1<br />

D−1<br />

∑<br />

k=0<br />

δ(E −E k ), (5.36)<br />

dxρ(x)T n [x] (5.37)<br />

= 1 D Tr[T n( ˜H)], (5.38)<br />

where ˜H is the rescaled Hamiltonian with all D eigenvalues <strong>in</strong>side the <strong>in</strong>terval [−1,1]. The<br />

efficiency <strong>of</strong> the procedure is not yet evident. This changes if one realizes the follow<strong>in</strong>g<br />

aspects:<br />

• Self averag<strong>in</strong>g properties allow for replac<strong>in</strong>g the trace over the operator by a relatively<br />

small number R ≪ D <strong>of</strong> random vectors<br />

|r〉 =<br />

D−1<br />

∑<br />

i=0<br />

ζ ri |i〉, (5.39)<br />

where the amplitudes ζ ri = e iφ are random phases on site i. This makes the effort for<br />

the calculation <strong>of</strong> M coefficients µ n l<strong>in</strong>ear <strong>in</strong> D.<br />

• The most time consum<strong>in</strong>g operation <strong>in</strong> this procedure is the matrix-vector multiplication<br />

(AppendixF). Due to the fact that the number <strong>of</strong> neighbors which a site has<br />

<strong>in</strong> the presented systems, the full multiplication can be replaced by sparse-matrix

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

Saved successfully!

Ooh no, something went wrong!