|
| 1 | +from multiprocessing import Pool |
| 2 | +import numpy as np |
| 3 | +from statmechcrack import CrackQ2D |
| 4 | + |
| 5 | +def Nn(L,W,Nnom,n=0,verbose=False): |
| 6 | + if n==0: |
| 7 | + return Nnom * np.ones(W, dtype=int) |
| 8 | + elif n==1: |
| 9 | + pass |
| 10 | + |
| 11 | + |
| 12 | +def gen_N(L,W,Nnom,verbose=False): |
| 13 | + N0 = Nnom * np.ones(W, dtype=int) |
| 14 | + N = [N0] |
| 15 | + if verbose: |
| 16 | + print(N[-1]) |
| 17 | + for i in range(W): |
| 18 | + N1 = Nnom * np.ones(W, dtype=int) |
| 19 | + N1[i] = Nnom+1 |
| 20 | + N.append(N1) |
| 21 | + if verbose: |
| 22 | + print(N[-1]) |
| 23 | + |
| 24 | + for i in range(W): |
| 25 | + N1 = Nnom * np.ones(W, dtype=int) |
| 26 | + N1[i] = Nnom+2 |
| 27 | + N.append(N1) |
| 28 | + if verbose: |
| 29 | + print(N[-1]) |
| 30 | + |
| 31 | + for i in range(W-1): |
| 32 | + N1 = Nnom * np.ones(W, dtype=int) |
| 33 | + N1[i] = Nnom+1 |
| 34 | + N1[i+1] = Nnom+1 |
| 35 | + N.append(N1) |
| 36 | + if verbose: |
| 37 | + print(N[-1]) |
| 38 | + |
| 39 | + for i in range(W-2): |
| 40 | + N1 = Nnom * np.ones(W, dtype=int) |
| 41 | + N1[i] = Nnom+1 |
| 42 | + N1[i+1] = Nnom+1 |
| 43 | + N1[i+2] = Nnom+1 |
| 44 | + N.append(N1) |
| 45 | + if verbose: |
| 46 | + print(N[-1]) |
| 47 | + |
| 48 | + for i in range(W-1): |
| 49 | + N1 = Nnom * np.ones(W, dtype=int) |
| 50 | + N1[i] = Nnom+1 |
| 51 | + N1[i+1] = Nnom+2 |
| 52 | + N.append(N1) |
| 53 | + if verbose: |
| 54 | + print(N[-1]) |
| 55 | + |
| 56 | + for i in range(W-2): |
| 57 | + N1 = Nnom * np.ones(W, dtype=int) |
| 58 | + N1[i] = Nnom+2 |
| 59 | + N1[i+1] = Nnom+1 |
| 60 | + N1[i+2] = Nnom+1 |
| 61 | + N.append(N1) |
| 62 | + if verbose: |
| 63 | + print(N[-1]) |
| 64 | + |
| 65 | + for i in range(W-2): |
| 66 | + N1 = Nnom * np.ones(W, dtype=int) |
| 67 | + N1[i] = Nnom+1 |
| 68 | + N1[i+1] = Nnom+2 |
| 69 | + N1[i+2] = Nnom+1 |
| 70 | + N.append(N1) |
| 71 | + if verbose: |
| 72 | + print(N[-1]) |
| 73 | + |
| 74 | + return N |
| 75 | + |
| 76 | +def calc_rates(L,W,N,verbose=False): |
| 77 | + model = CrackQ2D(L=L,W=W,N=N) |
| 78 | + rates = np.zeros(model.W) |
| 79 | + for k in range(model.W): |
| 80 | + rates[k] = model.k_isometric(2*np.ones(model.W),k) |
| 81 | + if verbose: |
| 82 | + print(N) |
| 83 | + print(rates) |
| 84 | + return [N,rates] |
| 85 | + |
| 86 | +def saveRates(N,rates,fname): |
| 87 | + ofile = open(fname,'w') |
| 88 | + nN = len(N) |
| 89 | + for i in range(nN): |
| 90 | + for n in N[i]: |
| 91 | + ofile.write('{}\t'.format(n)) |
| 92 | + ofile.write('\n') |
| 93 | + for r in rates[i]: |
| 94 | + ofile.write('{}\t'.format(r)) |
| 95 | + ofile.write('\n') |
| 96 | + ofile.close() |
| 97 | + |
| 98 | +if __name__=="__main__": |
| 99 | + L = 25 |
| 100 | + W = 11 |
| 101 | + Nnom = 7 |
| 102 | + |
| 103 | + NAll = gen_N(L,W,Nnom,verbose=True) |
| 104 | + nN = len(NAll) |
| 105 | + print(nN) |
| 106 | + |
| 107 | + Nout = [[] for i in range(nN)] |
| 108 | + rates = [[] for i in range(nN)] |
| 109 | + |
| 110 | + def mapFun(N): |
| 111 | + rates = calc_rates(L,W,N,verbose=True) |
| 112 | + return rates |
| 113 | + |
| 114 | + nproc = 30 |
| 115 | + #pool = Pool(processes=nproc) |
| 116 | + pool = Pool() |
| 117 | + for ind, res in enumerate(pool.imap(mapFun, NAll, chunksize=3)): |
| 118 | + Nout[ind] = res[0] |
| 119 | + rates[ind] = res[1] |
| 120 | + |
| 121 | + fname = 'L{}W{}.rates'.format(L,W) |
| 122 | + saveRates(NAll,rates,fname) |
0 commit comments