-
Notifications
You must be signed in to change notification settings - Fork 108
Expand file tree
/
Copy pathmaths_module.py
More file actions
250 lines (183 loc) · 11.1 KB
/
maths_module.py
File metadata and controls
250 lines (183 loc) · 11.1 KB
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
#!/usr/bin/env python3
# maths_module.py
#------------------------------------------------------------------------------------------------#
# This software was written in 2016/17 #
# by Michael P. Allen <m.p.allen@warwick.ac.uk>/<m.p.allen@bristol.ac.uk> #
# and Dominic J. Tildesley <d.tildesley7@gmail.com> ("the authors"), #
# to accompany the book "Computer Simulation of Liquids", second edition, 2017 ("the text"), #
# published by Oxford University Press ("the publishers"). #
# #
# LICENCE #
# Creative Commons CC0 Public Domain Dedication. #
# To the extent possible under law, the authors have dedicated all copyright and related #
# and neighboring rights to this software to the PUBLIC domain worldwide. #
# This software is distributed without any warranty. #
# You should have received a copy of the CC0 Public Domain Dedication along with this software. #
# If not, see <http://creativecommons.org/publicdomain/zero/1.0/>. #
# #
# DISCLAIMER #
# The authors and publishers make no warranties about the software, and disclaim liability #
# for all uses of the software, to the fullest extent permitted by applicable law. #
# The authors and publishers do not recommend use of this software for any purpose. #
# It is made freely available, solely to clarify points made in the text. When using or citing #
# the software, you should not imply endorsement by the authors or publishers. #
#------------------------------------------------------------------------------------------------#
"""Routines for maths, random numbers, order parameters."""
# Routines associated with random number generation
def random_vector():
"""Returns a random unit vector as a numpy array of 3 elements."""
import numpy as np
zeta = np.random.rand(2) # Two uniformly sampled random numbers in range (0,1)
c = 2.0*zeta[0] - 1.0 # Random cos(theta) uniformly sampled in range (-1,+1)
if c >= 1.0: # Guard against very small chance of roundoff error
s = 0.0 # Set sin(theta) to zero
else:
s = np.sqrt(1.0-c**2) # Calculate sin(theta) from cos(theta), always positive
phi = zeta[1] * 2.0*np.pi # Random angle uniformly sampled in range (0,2*pi)
return np.array ( ( s*np.cos(phi), s*np.sin(phi), c ), dtype=np.float64 ) # Random unit vector
def random_perpendicular_vector ( old ):
"""Returns a uniformly sampled unit vector perpendicular to the old vector."""
import numpy as np
# Note that we do not require the reference vector to be of unit length
# However we do require its length to be greater than a small tolerance!
assert old.size==3, 'Error in old vector dimension'
norm = np.sum ( old**2 ) # Old squared length
assert not np.isclose(norm,0.0,atol=1.e-6), 'old too small {} {} {}'.format(*old)
n = old / np.sqrt(norm) # Normalized old vector
tol = 1.e-6
while True: # Loop until generated vector is not too small
e = random_vector () # Randomly oriented unit vector
proj = np.dot ( e, n ) # Projection along old
e = e - proj * n # Make e perpendicular to old
norm = np.sum ( e**2 ) # Squared length
if norm > tol: # Accept, unless e is too small (which is unlikely)
break
e = e / np.sqrt ( norm ) # Normalize
return e
def random_quaternion():
"""Returns a random unit quaternion as a numpy array of 4 elements."""
import numpy as np
while True: # Loop until within unit disk
zeta = 2.0*np.random.rand(2) - 1.0 # Two uniform random numbers between -1 and 1
norm1 = np.sum ( zeta**2 ) # Squared magnitude
if norm1 < 1.0: # Test for within unit disk
break
while True: # Loop until within unit disk
beta = 2.0*np.random.rand(2) - 1.0 # Two uniform random numbers between -1 and 1
norm2 = np.sum ( beta**2 ) # Squared magnitude
if norm2 < 1.0: # Test for within unit disk
break
f = np.sqrt ( ( 1.0 - norm1 ) / norm2 )
return np.array ( ( zeta[0], zeta[1], beta[0]*f, beta[1]*f ), dtype=np.float64 ) # Random quaternion
def random_rotate_quaternion ( angle_max, old ):
"""Returns a unit quaternion rotated by a maximum angle (in radians) relative to the old quaternion."""
import numpy as np
# Note that the reference quaternion should be normalized and we test for this
assert old.size==4, 'Error in old quaternion dimension'
assert np.isclose(np.sum(old**2),1.0), 'old normalization error {} {} {} {}'.format(*old)
axis = random_vector() # Choose random unit vector
angle = ( 2.0*np.random.rand() - 1.0 ) * angle_max # Uniform random angle in desired range
e = rotate_quaternion ( angle, axis, old ) # General rotation function
return e
def random_translate_vector ( dr_max, old ):
"""Returns a vector translated by a random amount."""
import numpy as np
# A randomly chosen vector is added to the old one
zeta = np.random.rand(3) # Three uniform random numbers in range (0,1)
zeta = 2.0*zeta - 1.0 # Now in range (-1,+1)
return old + zeta * dr_max # Move to new position
def random_rotate_vector ( angle_max, old ):
"""Returns a vector rotated by a small amount relative to the old one."""
import numpy as np
# A small randomly chosen vector is added to the old one, and the result renormalized
# Provided angle_max is << 1, it is approximately the maximum rotation angle (in radians)
# The magnitude of the rotation is not uniformly sampled, but this should not matter
# Note that the old vector should be normalized and we test for this
assert np.isclose(np.sum(old**2),1.0), 'old normalization error {} {} {}'.format(*old)
# Choose new orientation by adding random small vector
e = old + angle_max * random_vector ()
norm = np.sum ( e**2 )
return e / np.sqrt(norm) # Normalize
def metropolis ( delta ):
"""Conduct Metropolis test, with safeguards."""
import numpy as np
exponent_guard = 75.0
if delta > exponent_guard: # Too high, reject without evaluating
return False
elif delta < 0.0: # Downhill, accept without evaluating
return True
else:
zeta = np.random.rand() # Uniform random number in range (0,1)
return np.exp(-delta) > zeta # Metropolis test
# Low-level mathematical operations
def rotate_vector ( angle, axis, old ):
"""Returns a vector rotated from the old one by angle about axis."""
import numpy as np
# Note that the axis vector should be normalized and we test for this
# In general, the old vector need not be normalized, and the same goes for the result
# although quite often in our applications they will be
assert old.size == 3, 'Incorrect size of old'
assert axis.size == 3, 'Incorrect size of axis'
assert np.isclose(np.sum(axis**2),1.0), 'Non-unit vector {} {} {}'.format(*axis)
c = np.cos ( angle )
s = np.sin ( angle )
proj = np.dot ( axis, old ) # The two vectors need not be perpendicular
# Standard (Goldstein) rotation formula
e = c * old + ( 1.0 - c ) * proj * axis + s * np.cross ( axis, old )
return e
def rotate_quaternion ( angle, axis, old ):
"""Returns a quaternion rotated by angle about axis relative to old quaternion."""
import numpy as np
# Note that the axis vector should be normalized and we test for this
# In general, the old quaternion need not be normalized, and the same goes for the result
# although in our applications we only ever use unit quaternions (to represent orientations)
assert old.size==4, 'Error in old quaternion dimension'
assert axis.size==3, 'Error in axis dimension'
assert np.isclose (np.sum(axis**2),1.0), 'axis normalization error {} {} {}'.format(*axis)
# Standard formula for rotation quaternion, using half angles
rot = np.sin(0.5*angle) * axis
rot = np.array([np.cos(0.5*angle),rot[0],rot[1],rot[2]],dtype=np.float64)
e = quatmul ( rot, old ) # Apply rotation to old quaternion
return e
def quatmul ( a, b ):
"""Returns quaternion product of two supplied quaternions."""
import numpy as np
assert a.size==4, 'Error in a dimension'
assert b.size==4, 'Error in b dimension'
return np.array ( [ a[0]*b[0] - a[1]*b[1] - a[2]*b[2] - a[3]*b[3],
a[1]*b[0] + a[0]*b[1] - a[3]*b[2] + a[2]*b[3],
a[2]*b[0] + a[3]*b[1] + a[0]*b[2] - a[1]*b[3],
a[3]*b[0] - a[2]*b[1] + a[1]*b[2] + a[0]*b[3] ], dtype=np.float64 )
def nematic_order ( e ):
"""Returns a nematic orientational order parameter."""
import numpy as np
# Calculate the nematic order parameter <P2(cos(theta))>
# where theta is the angle between a molecular axis and the director
# which is the direction that maximises the order parameter
# This is obtained by finding the largest eigenvalue of
# the 3x3 second-rank traceless order tensor
# Note that this is not the same as the order parameter characterizing a crystal
n, d = e.shape
assert d==3, 'Error in e dimension '
# Order tensor: outer product of each orientation vector, summed over n molecules
q = np.sum ( e[:,:,np.newaxis]*e[:,np.newaxis,:], axis=0)
q = 1.5 * q / n # Normalize
for i in range(3):
q[i,i] = q[i,i] - 0.5 # Make traceless
evals = np.linalg.eigvalsh(q)
return evals[2]
def q_to_a ( q ):
"""Returns a 3x3 rotation matrix calculated from supplied quaternion."""
import numpy as np
# The rows of the rotation matrix correspond to unit vectors of the molecule in the space-fixed frame
# The third row a(3,:) is "the" axis of the molecule, for uniaxial molecules
# Use a to convert space-fixed to body-fixed axes thus: db = np.dot(a,ds)
# Use transpose of a to convert body-fixed to space-fixed axes thus: ds = np.dot(db,a)
# The supplied quaternion should be normalized and we check for this
assert np.isclose(np.sum(q**2),1.0), 'quaternion normalization error {} {} {} {}'.format(*q)
# Write out row by row, for clarity
a = np.empty( (3,3), dtype=np.float64 )
a[0,:] = [ q[0]**2+q[1]**2-q[2]**2-q[3]**2, 2*(q[1]*q[2]+q[0]*q[3]), 2*(q[1]*q[3]-q[0]*q[2]) ]
a[1,:] = [ 2*(q[1]*q[2]-q[0]*q[3]), q[0]**2-q[1]**2+q[2]**2-q[3]**2, 2*(q[2]*q[3]+q[0]*q[1]) ]
a[2,:] = [ 2*(q[1]*q[3]+q[0]*q[2]), 2*(q[2]*q[3]-q[0]*q[1]), q[0]**2-q[1]**2-q[2]**2+q[3]**2 ]
return a