/
Hofstadter.py
56 lines (45 loc) · 1.55 KB
/
Hofstadter.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import numpy as np
import numpy.linalg as linalg
from mpl_toolkits.mplot3d.axes3d import Axes3D
import matplotlib.pyplot as plt
import fractions # Available in Py2.6 and Py3.0
from scipy.linalg import eigvals_banded
def approx2(c, maxd):
'Fast way using continued fractions'
return fractions.Fraction.from_float(c).limit_denominator(maxd)
V1=1.0
V2=1.0
a = 1.0
b = 1.0
#ks = [[0.0, 0.0], [np.pi/3.0, np.pi]]
ks = [[0.0, 0.0]]
#k = [0.0, 0.0]
steps = 1000.0
maxd = 1000
min_points = 100
fig = plt.figure(figsize=(15,15))
ax = fig.add_subplot(1, 1, 1)
symbols = ['.b', '.r']
for kidx in range(len(ks)):
k = ks[kidx]
for alpha in np.arange(1.0/steps, 1.0, 1.0/steps):
alpha_rational = approx2(alpha, maxd)
p = np.float(alpha_rational.numerator)
q = np.float(alpha_rational.denominator)
#print str(alpha) + ', ' + str(p) + '/' + str(q)
new_maxd = maxd
while p < min_points:
p += q * np.ceil((min_points - p) / q)
# print str(p/q) + ', ' + str(alpha) + ': ' + str(p) + '/' + str(q)
if p > 1:
A = np.zeros([2,p], dtype=np.complex128)
for n in range(np.int(p)):
A[1,n] = 2.0*V2*np.cos(q*b*k[1]/p + 2*np.pi*np.float(n)*q/p)
if n < (p-1):
A[0,n+1] = V1*np.exp(np.complex(0.0,q*a*k[0]/p))
d = eigvals_banded(A)
ds = np.sort(d)
ax.plot(alpha*np.ones(p), ds, symbols[kidx],linewidth=0.5,markersize=1.0)
plt.xlabel(r'$\alpha$')
plt.ylabel(r'$E$')
fig.show()