1 |
chuckv |
1038 |
/* |
2 |
|
|
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
3 |
|
|
* |
4 |
|
|
* The University of Notre Dame grants you ("Licensee") a |
5 |
|
|
* non-exclusive, royalty free, license to use, modify and |
6 |
|
|
* redistribute this software in source and binary code form, provided |
7 |
|
|
* that the following conditions are met: |
8 |
|
|
* |
9 |
|
|
* 1. Acknowledgement of the program authors must be made in any |
10 |
|
|
* publication of scientific results based in part on use of the |
11 |
|
|
* program. An acceptable form of acknowledgement is citation of |
12 |
|
|
* the article in which the program was described (Matthew |
13 |
|
|
* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher |
14 |
|
|
* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented |
15 |
|
|
* Parallel Simulation Engine for Molecular Dynamics," |
16 |
|
|
* J. Comput. Chem. 26, pp. 252-271 (2005)) |
17 |
|
|
* |
18 |
|
|
* 2. Redistributions of source code must retain the above copyright |
19 |
|
|
* notice, this list of conditions and the following disclaimer. |
20 |
|
|
* |
21 |
|
|
* 3. Redistributions in binary form must reproduce the above copyright |
22 |
|
|
* notice, this list of conditions and the following disclaimer in the |
23 |
|
|
* documentation and/or other materials provided with the |
24 |
|
|
* distribution. |
25 |
|
|
* |
26 |
|
|
* This software is provided "AS IS," without a warranty of any |
27 |
|
|
* kind. All express or implied conditions, representations and |
28 |
|
|
* warranties, including any implied warranty of merchantability, |
29 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
30 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
31 |
|
|
* be liable for any damages suffered by licensee as a result of |
32 |
|
|
* using, modifying or distributing the software or its |
33 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
34 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
35 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
36 |
|
|
* damages, however caused and regardless of the theory of liability, |
37 |
|
|
* arising out of the use of or inability to use software, even if the |
38 |
|
|
* University of Notre Dame has been advised of the possibility of |
39 |
|
|
* such damages. |
40 |
gezelter |
1054 |
* |
41 |
|
|
* BondOrderParameter.cpp |
42 |
|
|
* OOPSE-4 |
43 |
|
|
* |
44 |
|
|
* Created by J. Daniel Gezelter on 09/26/06. |
45 |
|
|
* @author J. Daniel Gezelter |
46 |
|
|
* @version $Id: BondOrderParameter.cpp,v 1.18 2006-09-26 16:08:44 gezelter Exp $ |
47 |
|
|
* |
48 |
chuckv |
1038 |
*/ |
49 |
gezelter |
1039 |
|
50 |
chuckv |
1038 |
#include "applications/staticProps/BondOrderParameter.hpp" |
51 |
|
|
#include "utils/simError.h" |
52 |
|
|
#include "io/DumpReader.hpp" |
53 |
|
|
#include "primitives/Molecule.hpp" |
54 |
|
|
#include "utils/NumericConstant.hpp" |
55 |
gezelter |
1041 |
|
56 |
chuckv |
1038 |
namespace oopse { |
57 |
|
|
|
58 |
gezelter |
1039 |
BondOrderParameter::BondOrderParameter(SimInfo* info, |
59 |
|
|
const std::string& filename, |
60 |
|
|
const std::string& sele, |
61 |
gezelter |
1052 |
double rCut, int nbins) : StaticAnalyser(info, filename), selectionScript_(sele), evaluator_(info), seleMan_(info){ |
62 |
gezelter |
1039 |
|
63 |
gezelter |
1041 |
setOutputName(getPrefix(filename) + ".bo"); |
64 |
chuckv |
1038 |
|
65 |
gezelter |
1039 |
evaluator_.loadScriptString(sele); |
66 |
|
|
if (!evaluator_.isDynamic()) { |
67 |
|
|
seleMan_.setSelectionSet(evaluator_.evaluate()); |
68 |
chuckv |
1038 |
} |
69 |
|
|
|
70 |
gezelter |
1039 |
// Set up cutoff radius and order of the Legendre Polynomial: |
71 |
|
|
|
72 |
chuckv |
1038 |
rCut_ = rCut; |
73 |
gezelter |
1051 |
nBins_ = nbins; |
74 |
|
|
Qcount_.resize(lMax_+1); |
75 |
|
|
Wcount_.resize(lMax_+1); |
76 |
gezelter |
1048 |
|
77 |
|
|
// Q can take values from 0 to 1 |
78 |
|
|
|
79 |
|
|
MinQ_ = 0.0; |
80 |
gezelter |
1051 |
MaxQ_ = 1.1; |
81 |
gezelter |
1048 |
deltaQ_ = (MaxQ_ - MinQ_) / nbins; |
82 |
|
|
|
83 |
|
|
// W_6 for icosahedral clusters is 11 / sqrt(4199) = 0.169754, so we'll |
84 |
|
|
// use values for MinW_ and MaxW_ that are slightly larger than this: |
85 |
|
|
|
86 |
gezelter |
1052 |
MinW_ = -0.25; |
87 |
|
|
MaxW_ = 0.25; |
88 |
gezelter |
1048 |
deltaW_ = (MaxW_ - MinW_) / nbins; |
89 |
gezelter |
1053 |
|
90 |
|
|
// Make arrays for Wigner3jm |
91 |
|
|
double* THRCOF = new double[2*lMax_+1]; |
92 |
|
|
// Variables for Wigner routine |
93 |
|
|
double lPass, m1Pass, m2m, m2M; |
94 |
|
|
int error, mSize; |
95 |
|
|
mSize = 2*lMax_+1; |
96 |
|
|
|
97 |
|
|
for (int l = 0; l <= lMax_; l++) { |
98 |
|
|
lPass = (double)l; |
99 |
|
|
for (int m1 = -l; m1 <= l; m1++) { |
100 |
|
|
m1Pass = (double)m1; |
101 |
|
|
|
102 |
|
|
std::pair<int,int> lm = std::make_pair(l, m1); |
103 |
|
|
|
104 |
|
|
// Zero work array |
105 |
|
|
for (int ii = 0; ii < 2*l + 1; ii++){ |
106 |
|
|
THRCOF[ii] = 0.0; |
107 |
|
|
} |
108 |
|
|
|
109 |
|
|
// Get Wigner coefficients |
110 |
|
|
Wigner3jm(&lPass, &lPass, &lPass, |
111 |
|
|
&m1Pass, &m2m, &m2M, |
112 |
|
|
THRCOF, &mSize, &error); |
113 |
|
|
|
114 |
|
|
m2Min[lm] = (int)floor(m2m); |
115 |
|
|
m2Max[lm] = (int)floor(m2M); |
116 |
|
|
|
117 |
|
|
for (int mmm = 0; mmm < (int)(m2M - m2m); mmm++) { |
118 |
|
|
w3j[lm].push_back(THRCOF[mmm]); |
119 |
|
|
} |
120 |
|
|
} |
121 |
|
|
} |
122 |
gezelter |
1054 |
delete [] THRCOF; |
123 |
|
|
THRCOF = NULL; |
124 |
gezelter |
1039 |
} |
125 |
gezelter |
1053 |
|
126 |
gezelter |
1041 |
BondOrderParameter::~BondOrderParameter() { |
127 |
gezelter |
1048 |
Q_histogram_.clear(); |
128 |
|
|
W_histogram_.clear(); |
129 |
gezelter |
1054 |
for (int l = 0; l <= lMax_; l++) { |
130 |
|
|
for (int m = -l; m <= l; m++) { |
131 |
|
|
w3j[std::make_pair(l,m)].clear(); |
132 |
|
|
} |
133 |
|
|
} |
134 |
|
|
w3j.clear(); |
135 |
|
|
m2Min.clear(); |
136 |
|
|
m2Max.clear(); |
137 |
gezelter |
1041 |
} |
138 |
gezelter |
1054 |
|
139 |
gezelter |
1048 |
void BondOrderParameter::initalizeHistogram() { |
140 |
gezelter |
1051 |
for (int bin = 0; bin < nBins_; bin++) { |
141 |
|
|
for (int l = 0; l <= lMax_; l++) { |
142 |
|
|
Q_histogram_[std::make_pair(bin,l)] = 0; |
143 |
|
|
W_histogram_[std::make_pair(bin,l)] = 0; |
144 |
|
|
} |
145 |
|
|
} |
146 |
gezelter |
1048 |
} |
147 |
|
|
|
148 |
gezelter |
1039 |
void BondOrderParameter::process() { |
149 |
|
|
Molecule* mol; |
150 |
|
|
Atom* atom; |
151 |
|
|
RigidBody* rb; |
152 |
gezelter |
1043 |
int myIndex; |
153 |
gezelter |
1039 |
SimInfo::MoleculeIterator mi; |
154 |
|
|
Molecule::RigidBodyIterator rbIter; |
155 |
|
|
Molecule::AtomIterator ai; |
156 |
|
|
StuntDouble* sd; |
157 |
gezelter |
1043 |
Vector3d vec; |
158 |
gezelter |
1042 |
RealType costheta; |
159 |
gezelter |
1039 |
RealType phi; |
160 |
|
|
RealType r; |
161 |
|
|
RealType dist; |
162 |
gezelter |
1051 |
std::map<std::pair<int,int>,ComplexType> q; |
163 |
|
|
std::vector<RealType> q_l; |
164 |
gezelter |
1052 |
std::vector<RealType> q2; |
165 |
|
|
std::vector<ComplexType> w; |
166 |
|
|
std::vector<ComplexType> w_hat; |
167 |
gezelter |
1051 |
std::map<std::pair<int,int>,ComplexType> QBar; |
168 |
|
|
std::vector<RealType> Q2; |
169 |
|
|
std::vector<RealType> Q; |
170 |
|
|
std::vector<ComplexType> W; |
171 |
|
|
std::vector<ComplexType> W_hat; |
172 |
gezelter |
1048 |
int nBonds, Nbonds; |
173 |
gezelter |
1042 |
SphericalHarmonic sphericalHarmonic; |
174 |
gezelter |
1039 |
int i, j; |
175 |
gezelter |
1043 |
|
176 |
gezelter |
1039 |
DumpReader reader(info_, dumpFilename_); |
177 |
|
|
int nFrames = reader.getNFrames(); |
178 |
gezelter |
1041 |
frameCounter_ = 0; |
179 |
chuckv |
1038 |
|
180 |
gezelter |
1051 |
q_l.resize(lMax_+1); |
181 |
gezelter |
1052 |
q2.resize(lMax_+1); |
182 |
|
|
w.resize(lMax_+1); |
183 |
|
|
w_hat.resize(lMax_+1); |
184 |
|
|
|
185 |
gezelter |
1051 |
Q2.resize(lMax_+1); |
186 |
|
|
Q.resize(lMax_+1); |
187 |
|
|
W.resize(lMax_+1); |
188 |
|
|
W_hat.resize(lMax_+1); |
189 |
|
|
|
190 |
gezelter |
1039 |
for (int istep = 0; istep < nFrames; istep += step_) { |
191 |
|
|
reader.readFrame(istep); |
192 |
gezelter |
1041 |
frameCounter_++; |
193 |
gezelter |
1039 |
currentSnapshot_ = info_->getSnapshotManager()->getCurrentSnapshot(); |
194 |
|
|
|
195 |
|
|
if (evaluator_.isDynamic()) { |
196 |
|
|
seleMan_.setSelectionSet(evaluator_.evaluate()); |
197 |
|
|
} |
198 |
chuckv |
1038 |
|
199 |
gezelter |
1039 |
// update the positions of atoms which belong to the rigidbodies |
200 |
chuckv |
1038 |
|
201 |
gezelter |
1039 |
for (mol = info_->beginMolecule(mi); mol != NULL; |
202 |
|
|
mol = info_->nextMolecule(mi)) { |
203 |
|
|
for (rb = mol->beginRigidBody(rbIter); rb != NULL; |
204 |
|
|
rb = mol->nextRigidBody(rbIter)) { |
205 |
|
|
rb->updateAtoms(); |
206 |
|
|
} |
207 |
gezelter |
1048 |
} |
208 |
|
|
|
209 |
gezelter |
1039 |
// outer loop is over the selected StuntDoubles: |
210 |
chuckv |
1038 |
|
211 |
gezelter |
1039 |
for (sd = seleMan_.beginSelected(i); sd != NULL; |
212 |
|
|
sd = seleMan_.nextSelected(i)) { |
213 |
chuckv |
1038 |
|
214 |
gezelter |
1043 |
myIndex = sd->getGlobalIndex(); |
215 |
gezelter |
1048 |
nBonds = 0; |
216 |
gezelter |
1051 |
|
217 |
|
|
for (int l = 0; l <= lMax_; l++) { |
218 |
|
|
for (int m = -l; m <= l; m++) { |
219 |
|
|
q[std::make_pair(l,m)] = 0.0; |
220 |
|
|
} |
221 |
gezelter |
1048 |
} |
222 |
gezelter |
1039 |
|
223 |
|
|
// inner loop is over all other atoms in the system: |
224 |
|
|
|
225 |
|
|
for (mol = info_->beginMolecule(mi); mol != NULL; |
226 |
|
|
mol = info_->nextMolecule(mi)) { |
227 |
|
|
for (atom = mol->beginAtom(ai); atom != NULL; |
228 |
|
|
atom = mol->nextAtom(ai)) { |
229 |
chuckv |
1038 |
|
230 |
gezelter |
1043 |
if (atom->getGlobalIndex() != myIndex) { |
231 |
chuckv |
1038 |
|
232 |
gezelter |
1043 |
vec = sd->getPos() - atom->getPos(); |
233 |
|
|
currentSnapshot_->wrapVector(vec); |
234 |
gezelter |
1042 |
|
235 |
gezelter |
1043 |
// Calculate "bonds" and build Q_lm(r) where |
236 |
|
|
// Q_lm = Y_lm(theta(r),phi(r)) |
237 |
|
|
// The spherical harmonics are wrt any arbitrary coordinate |
238 |
|
|
// system, we choose standard spherical coordinates |
239 |
|
|
|
240 |
|
|
r = vec.length(); |
241 |
|
|
|
242 |
|
|
// Check to see if neighbor is in bond cutoff |
243 |
|
|
|
244 |
|
|
if (r < rCut_) { |
245 |
|
|
costheta = vec.z() / r; |
246 |
|
|
phi = atan2(vec.y(), vec.x()); |
247 |
gezelter |
1051 |
|
248 |
|
|
for (int l = 0; l <= lMax_; l++) { |
249 |
|
|
sphericalHarmonic.setL(l); |
250 |
|
|
for(int m = -l; m <= l; m++){ |
251 |
|
|
sphericalHarmonic.setM(m); |
252 |
|
|
q[std::make_pair(l,m)] += sphericalHarmonic.getValueAt(costheta, phi); |
253 |
|
|
} |
254 |
gezelter |
1043 |
} |
255 |
|
|
nBonds++; |
256 |
|
|
} |
257 |
|
|
} |
258 |
gezelter |
1039 |
} |
259 |
|
|
} |
260 |
gezelter |
1051 |
|
261 |
|
|
|
262 |
|
|
for (int l = 0; l <= lMax_; l++) { |
263 |
|
|
q_l[l] = 0.0; |
264 |
|
|
for(int m = -l; m <= l; m++) { |
265 |
|
|
q_l[l] += norm(q[std::make_pair(l,m)]); |
266 |
|
|
} |
267 |
|
|
q_l[l] *= 4.0*NumericConstant::PI/(RealType)(2*l + 1); |
268 |
|
|
q_l[l] = sqrt(q_l[l])/(RealType)nBonds; |
269 |
|
|
} |
270 |
gezelter |
1052 |
|
271 |
|
|
// Find second order invariant Q_l |
272 |
gezelter |
1051 |
|
273 |
gezelter |
1052 |
for (int l = 0; l <= lMax_; l++) { |
274 |
|
|
q2[l] = 0.0; |
275 |
|
|
for (int m = -l; m <= l; m++){ |
276 |
|
|
q2[l] += norm(q[std::make_pair(l,m)]); |
277 |
|
|
} |
278 |
|
|
q_l[l] = sqrt(q2[l] * 4.0 * NumericConstant::PI / |
279 |
|
|
(RealType)(2*l + 1))/(RealType)nBonds; |
280 |
|
|
} |
281 |
|
|
|
282 |
|
|
// Find Third Order Invariant W_l |
283 |
|
|
|
284 |
|
|
for (int l = 0; l <= lMax_; l++) { |
285 |
|
|
w[l] = 0.0; |
286 |
|
|
for (int m1 = -l; m1 <= l; m1++) { |
287 |
gezelter |
1053 |
std::pair<int,int> lm = std::make_pair(l, m1); |
288 |
|
|
for (int mmm = 0; mmm < (m2Max[lm] - m2Min[lm]); mmm++) { |
289 |
|
|
int m2 = m2Min[lm] + mmm; |
290 |
|
|
int m3 = -m1-m2; |
291 |
|
|
w[l] += w3j[lm][mmm] * q[lm] * |
292 |
|
|
q[std::make_pair(l,m2)] * q[std::make_pair(l,m3)]; |
293 |
gezelter |
1052 |
} |
294 |
|
|
} |
295 |
|
|
|
296 |
|
|
w_hat[l] = w[l] / pow(q2[l], 1.5); |
297 |
|
|
} |
298 |
|
|
|
299 |
|
|
collectHistogram(q_l, w_hat); |
300 |
|
|
|
301 |
gezelter |
1048 |
Nbonds += nBonds; |
302 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
303 |
|
|
for (int m = -l; m <= l; m++) { |
304 |
|
|
QBar[std::make_pair(l,m)] += q[std::make_pair(l,m)]; |
305 |
|
|
} |
306 |
gezelter |
1048 |
} |
307 |
|
|
} |
308 |
gezelter |
1047 |
} |
309 |
gezelter |
1051 |
|
310 |
gezelter |
1047 |
// Normalize Qbar2 |
311 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
312 |
|
|
for (int m = -l; m <= l; m++){ |
313 |
|
|
QBar[std::make_pair(l,m)] /= Nbonds; |
314 |
|
|
} |
315 |
gezelter |
1039 |
} |
316 |
|
|
|
317 |
gezelter |
1047 |
// Find second order invariant Q_l |
318 |
gezelter |
1039 |
|
319 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
320 |
|
|
Q2[l] = 0.0; |
321 |
|
|
for (int m = -l; m <= l; m++){ |
322 |
|
|
Q2[l] += norm(QBar[std::make_pair(l,m)]); |
323 |
|
|
} |
324 |
|
|
Q[l] = sqrt(Q2[l] * 4.0 * NumericConstant::PI / (RealType)(2*l + 1)); |
325 |
gezelter |
1039 |
} |
326 |
gezelter |
1047 |
|
327 |
|
|
// Find Third Order Invariant W_l |
328 |
|
|
|
329 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
330 |
|
|
W[l] = 0.0; |
331 |
|
|
for (int m1 = -l; m1 <= l; m1++) { |
332 |
gezelter |
1053 |
std::pair<int,int> lm = std::make_pair(l, m1); |
333 |
|
|
for (int mmm = 0; mmm < (m2Max[lm] - m2Min[lm]); mmm++) { |
334 |
|
|
int m2 = m2Min[lm] + mmm; |
335 |
|
|
int m3 = -m1-m2; |
336 |
|
|
W[l] += w3j[lm][mmm] * QBar[lm] * |
337 |
|
|
QBar[std::make_pair(l,m2)] * QBar[std::make_pair(l,m3)]; |
338 |
gezelter |
1051 |
} |
339 |
gezelter |
1047 |
} |
340 |
gezelter |
1041 |
|
341 |
gezelter |
1051 |
W_hat[l] = W[l] / pow(Q2[l], 1.5); |
342 |
gezelter |
1039 |
} |
343 |
gezelter |
1047 |
|
344 |
gezelter |
1051 |
writeOrderParameter(Q, W_hat); |
345 |
gezelter |
1047 |
} |
346 |
chuckv |
1038 |
|
347 |
gezelter |
1052 |
void BondOrderParameter::collectHistogram(std::vector<RealType> q, |
348 |
|
|
std::vector<ComplexType> what) { |
349 |
chuckv |
1038 |
|
350 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
351 |
|
|
if (q[l] >= MinQ_ && q[l] < MaxQ_) { |
352 |
|
|
int qbin = (q[l] - MinQ_) / deltaQ_; |
353 |
|
|
Q_histogram_[std::make_pair(qbin,l)] += 1; |
354 |
|
|
Qcount_[l]++; |
355 |
|
|
} else { |
356 |
|
|
sprintf( painCave.errMsg, |
357 |
|
|
"q_l value outside reasonable range\n"); |
358 |
|
|
painCave.severity = OOPSE_ERROR; |
359 |
|
|
painCave.isFatal = 1; |
360 |
|
|
simError(); |
361 |
|
|
} |
362 |
gezelter |
1048 |
} |
363 |
|
|
|
364 |
gezelter |
1052 |
for (int l = 0; l <= lMax_; l++) { |
365 |
|
|
if (real(what[l]) >= MinW_ && real(what[l]) < MaxW_) { |
366 |
|
|
int wbin = (real(what[l]) - MinW_) / deltaW_; |
367 |
|
|
W_histogram_[std::make_pair(wbin,l)] += 1; |
368 |
|
|
Wcount_[l]++; |
369 |
|
|
} else { |
370 |
|
|
sprintf( painCave.errMsg, |
371 |
|
|
"Re[w_hat] value outside reasonable range\n"); |
372 |
|
|
painCave.severity = OOPSE_ERROR; |
373 |
|
|
painCave.isFatal = 1; |
374 |
|
|
simError(); |
375 |
|
|
} |
376 |
|
|
} |
377 |
|
|
|
378 |
gezelter |
1048 |
} |
379 |
|
|
|
380 |
|
|
|
381 |
gezelter |
1052 |
void BondOrderParameter::writeOrderParameter(std::vector<RealType> Q, |
382 |
|
|
std::vector<ComplexType> What) { |
383 |
gezelter |
1051 |
|
384 |
gezelter |
1052 |
std::ofstream osq((getOutputFileName() + "q").c_str()); |
385 |
|
|
|
386 |
|
|
if (osq.is_open()) { |
387 |
gezelter |
1041 |
|
388 |
gezelter |
1052 |
osq << "# Bond Order Parameters\n"; |
389 |
|
|
osq << "# selection: (" << selectionScript_ << ")\n"; |
390 |
|
|
osq << "# \n"; |
391 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
392 |
gezelter |
1052 |
osq << "# <Q_" << l << ">: " << Q[l] << "\n"; |
393 |
gezelter |
1051 |
} |
394 |
gezelter |
1048 |
// Normalize by number of frames and write it out: |
395 |
gezelter |
1051 |
for (int i = 0; i < nBins_; ++i) { |
396 |
|
|
RealType Qval = MinQ_ + (i + 0.5) * deltaQ_; |
397 |
gezelter |
1052 |
osq << Qval; |
398 |
gezelter |
1051 |
for (int l = 0; l <= lMax_; l++) { |
399 |
gezelter |
1054 |
osq << "\t" << (RealType)Q_histogram_[std::make_pair(i,l)] / |
400 |
|
|
(RealType)Qcount_[l]; |
401 |
gezelter |
1051 |
} |
402 |
gezelter |
1052 |
osq << "\n"; |
403 |
gezelter |
1048 |
} |
404 |
|
|
|
405 |
gezelter |
1052 |
osq.close(); |
406 |
gezelter |
1047 |
|
407 |
gezelter |
1041 |
} else { |
408 |
|
|
sprintf(painCave.errMsg, "BondOrderParameter: unable to open %s\n", |
409 |
gezelter |
1052 |
(getOutputFileName() + "q").c_str()); |
410 |
gezelter |
1041 |
painCave.isFatal = 1; |
411 |
|
|
simError(); |
412 |
|
|
} |
413 |
gezelter |
1052 |
|
414 |
|
|
std::ofstream osw((getOutputFileName() + "w").c_str()); |
415 |
|
|
|
416 |
|
|
if (osw.is_open()) { |
417 |
|
|
osw << "# Bond Order Parameters\n"; |
418 |
|
|
osw << "# selection: (" << selectionScript_ << ")\n"; |
419 |
|
|
osw << "# \n"; |
420 |
|
|
for (int l = 0; l <= lMax_; l++) { |
421 |
|
|
osw << "# <W_" << l << ">: " << real(What[l]) << "\n"; |
422 |
|
|
} |
423 |
|
|
// Normalize by number of frames and write it out: |
424 |
|
|
for (int i = 0; i < nBins_; ++i) { |
425 |
|
|
RealType Wval = MinW_ + (i + 0.5) * deltaW_; |
426 |
|
|
osw << Wval; |
427 |
|
|
for (int l = 0; l <= lMax_; l++) { |
428 |
gezelter |
1054 |
osw << "\t" << (RealType)W_histogram_[std::make_pair(i,l)] / |
429 |
|
|
(RealType)Wcount_[l]; |
430 |
gezelter |
1052 |
} |
431 |
|
|
osw << "\n"; |
432 |
|
|
} |
433 |
|
|
|
434 |
|
|
osw.close(); |
435 |
|
|
} else { |
436 |
|
|
sprintf(painCave.errMsg, "BondOrderParameter: unable to open %s\n", |
437 |
|
|
(getOutputFileName() + "w").c_str()); |
438 |
|
|
painCave.isFatal = 1; |
439 |
|
|
simError(); |
440 |
|
|
} |
441 |
|
|
|
442 |
gezelter |
1041 |
} |
443 |
gezelter |
1039 |
} |