1 |
gezelter |
507 |
/* |
2 |
gezelter |
246 |
* 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 |
gezelter |
1390 |
* 1. Redistributions of source code must retain the above copyright |
10 |
gezelter |
246 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
gezelter |
246 |
* notice, this list of conditions and the following disclaimer in the |
14 |
|
|
* documentation and/or other materials provided with the |
15 |
|
|
* distribution. |
16 |
|
|
* |
17 |
|
|
* This software is provided "AS IS," without a warranty of any |
18 |
|
|
* kind. All express or implied conditions, representations and |
19 |
|
|
* warranties, including any implied warranty of merchantability, |
20 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
21 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
22 |
|
|
* be liable for any damages suffered by licensee as a result of |
23 |
|
|
* using, modifying or distributing the software or its |
24 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
25 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
26 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
27 |
|
|
* damages, however caused and regardless of the theory of liability, |
28 |
|
|
* arising out of the use of or inability to use software, even if the |
29 |
|
|
* University of Notre Dame has been advised of the possibility of |
30 |
|
|
* such damages. |
31 |
gezelter |
1390 |
* |
32 |
|
|
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
33 |
|
|
* research, please cite the appropriate papers when you publish your |
34 |
|
|
* work. Good starting points are: |
35 |
|
|
* |
36 |
|
|
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
37 |
|
|
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
38 |
|
|
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
39 |
|
|
* [4] Vardeman & Gezelter, in progress (2009). |
40 |
gezelter |
246 |
*/ |
41 |
|
|
|
42 |
|
|
#include "constraints/Rattle.hpp" |
43 |
|
|
#include "primitives/Molecule.hpp" |
44 |
|
|
#include "utils/simError.h" |
45 |
gezelter |
1390 |
namespace OpenMD { |
46 |
gezelter |
246 |
|
47 |
gezelter |
507 |
Rattle::Rattle(SimInfo* info) : info_(info), maxConsIteration_(10), consTolerance_(1.0e-6) { |
48 |
gezelter |
246 |
|
49 |
|
|
if (info_->getSimParams()->haveDt()) { |
50 |
gezelter |
507 |
dt_ = info_->getSimParams()->getDt(); |
51 |
gezelter |
246 |
} else { |
52 |
gezelter |
507 |
sprintf(painCave.errMsg, |
53 |
|
|
"Integrator Error: dt is not set\n"); |
54 |
|
|
painCave.isFatal = 1; |
55 |
|
|
simError(); |
56 |
gezelter |
246 |
} |
57 |
|
|
|
58 |
|
|
currentSnapshot_ = info_->getSnapshotManager()->getCurrentSnapshot(); |
59 |
gezelter |
507 |
} |
60 |
gezelter |
246 |
|
61 |
gezelter |
507 |
void Rattle::constraintA() { |
62 |
gezelter |
246 |
if (info_->getNConstraints() > 0) { |
63 |
gezelter |
507 |
doConstraint(&Rattle::constraintPairA); |
64 |
gezelter |
246 |
} |
65 |
gezelter |
507 |
} |
66 |
|
|
void Rattle::constraintB() { |
67 |
gezelter |
246 |
if (info_->getNConstraints() > 0) { |
68 |
gezelter |
507 |
doConstraint(&Rattle::constraintPairB); |
69 |
gezelter |
246 |
} |
70 |
gezelter |
507 |
} |
71 |
gezelter |
246 |
|
72 |
gezelter |
507 |
void Rattle::doConstraint(ConstraintPairFuncPtr func) { |
73 |
gezelter |
246 |
Molecule* mol; |
74 |
|
|
SimInfo::MoleculeIterator mi; |
75 |
|
|
ConstraintElem* consElem; |
76 |
|
|
Molecule::ConstraintElemIterator cei; |
77 |
|
|
ConstraintPair* consPair; |
78 |
|
|
Molecule::ConstraintPairIterator cpi; |
79 |
|
|
|
80 |
|
|
for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) { |
81 |
gezelter |
507 |
for (consElem = mol->beginConstraintElem(cei); consElem != NULL; consElem = mol->nextConstraintElem(cei)) { |
82 |
|
|
consElem->setMoved(true); |
83 |
|
|
consElem->setMoving(false); |
84 |
|
|
} |
85 |
gezelter |
246 |
} |
86 |
|
|
|
87 |
|
|
//main loop of constraint algorithm |
88 |
|
|
bool done = false; |
89 |
|
|
int iteration = 0; |
90 |
|
|
while(!done && iteration < maxConsIteration_){ |
91 |
gezelter |
507 |
done = true; |
92 |
gezelter |
246 |
|
93 |
gezelter |
507 |
//loop over every constraint pair |
94 |
gezelter |
246 |
|
95 |
gezelter |
507 |
for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) { |
96 |
|
|
for (consPair = mol->beginConstraintPair(cpi); consPair != NULL; consPair = mol->nextConstraintPair(cpi)) { |
97 |
gezelter |
246 |
|
98 |
|
|
|
99 |
gezelter |
507 |
//dispatch constraint algorithm |
100 |
|
|
if(consPair->isMoved()) { |
101 |
|
|
int exeStatus = (this->*func)(consPair); |
102 |
gezelter |
246 |
|
103 |
gezelter |
507 |
switch(exeStatus){ |
104 |
|
|
case consFail: |
105 |
|
|
sprintf(painCave.errMsg, |
106 |
|
|
"Constraint failure in Rattle::constrainA, Constraint Fail\n"); |
107 |
|
|
painCave.isFatal = 1; |
108 |
|
|
simError(); |
109 |
gezelter |
246 |
|
110 |
gezelter |
507 |
break; |
111 |
|
|
case consSuccess: |
112 |
|
|
//constrain the pair by moving two elements |
113 |
|
|
done = false; |
114 |
|
|
consPair->getConsElem1()->setMoving(true); |
115 |
|
|
consPair->getConsElem2()->setMoving(true); |
116 |
|
|
break; |
117 |
|
|
case consAlready: |
118 |
|
|
//current pair is already constrained, do not need to move the elements |
119 |
|
|
break; |
120 |
|
|
default: |
121 |
|
|
sprintf(painCave.errMsg, "ConstraintAlgorithm::doConstrain() Error: unrecognized status"); |
122 |
|
|
painCave.isFatal = 1; |
123 |
|
|
simError(); |
124 |
|
|
break; |
125 |
|
|
} |
126 |
|
|
} |
127 |
|
|
} |
128 |
|
|
}//end for(iter->first()) |
129 |
gezelter |
246 |
|
130 |
|
|
|
131 |
gezelter |
507 |
for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) { |
132 |
|
|
for (consElem = mol->beginConstraintElem(cei); consElem != NULL; consElem = mol->nextConstraintElem(cei)) { |
133 |
|
|
consElem->setMoved(consElem->getMoving()); |
134 |
|
|
consElem->setMoving(false); |
135 |
|
|
} |
136 |
|
|
} |
137 |
gezelter |
246 |
|
138 |
gezelter |
507 |
iteration++; |
139 |
gezelter |
246 |
}//end while |
140 |
|
|
|
141 |
|
|
if (!done){ |
142 |
|
|
sprintf(painCave.errMsg, |
143 |
|
|
"Constraint failure in Rattle::constrainA, too many iterations: %d\n", |
144 |
|
|
iteration); |
145 |
|
|
painCave.isFatal = 1; |
146 |
|
|
simError(); |
147 |
|
|
} |
148 |
gezelter |
507 |
} |
149 |
gezelter |
246 |
|
150 |
gezelter |
507 |
int Rattle::constraintPairA(ConstraintPair* consPair){ |
151 |
|
|
ConstraintElem* consElem1 = consPair->getConsElem1(); |
152 |
|
|
ConstraintElem* consElem2 = consPair->getConsElem2(); |
153 |
gezelter |
246 |
|
154 |
gezelter |
507 |
Vector3d posA = consElem1->getPos(); |
155 |
|
|
Vector3d posB = consElem2->getPos(); |
156 |
gezelter |
246 |
|
157 |
gezelter |
507 |
Vector3d pab = posA -posB; |
158 |
gezelter |
246 |
|
159 |
gezelter |
507 |
//periodic boundary condition |
160 |
gezelter |
246 |
|
161 |
gezelter |
507 |
currentSnapshot_->wrapVector(pab); |
162 |
gezelter |
246 |
|
163 |
tim |
963 |
RealType pabsq = pab.lengthSquare(); |
164 |
gezelter |
246 |
|
165 |
tim |
963 |
RealType rabsq = consPair->getConsDistSquare(); |
166 |
|
|
RealType diffsq = rabsq - pabsq; |
167 |
gezelter |
246 |
|
168 |
gezelter |
507 |
// the original rattle code from alan tidesley |
169 |
|
|
if (fabs(diffsq) > (consTolerance_ * rabsq * 2)){ |
170 |
gezelter |
246 |
|
171 |
gezelter |
507 |
Vector3d oldPosA = consElem1->getPrevPos(); |
172 |
|
|
Vector3d oldPosB = consElem2->getPrevPos(); |
173 |
gezelter |
246 |
|
174 |
gezelter |
507 |
Vector3d rab = oldPosA - oldPosB; |
175 |
gezelter |
246 |
|
176 |
gezelter |
507 |
currentSnapshot_->wrapVector(rab); |
177 |
gezelter |
246 |
|
178 |
tim |
963 |
RealType rpab = dot(rab, pab); |
179 |
|
|
RealType rpabsq = rpab * rpab; |
180 |
gezelter |
246 |
|
181 |
gezelter |
507 |
if (rpabsq < (rabsq * -diffsq)){ |
182 |
|
|
return consFail; |
183 |
|
|
} |
184 |
gezelter |
246 |
|
185 |
tim |
963 |
RealType rma = 1.0 / consElem1->getMass(); |
186 |
|
|
RealType rmb = 1.0 / consElem2->getMass(); |
187 |
gezelter |
246 |
|
188 |
tim |
963 |
RealType gab = diffsq / (2.0 * (rma + rmb) * rpab); |
189 |
gezelter |
246 |
|
190 |
gezelter |
507 |
Vector3d delta = rab * gab; |
191 |
gezelter |
246 |
|
192 |
gezelter |
507 |
//set atom1's position |
193 |
|
|
posA += rma * delta; |
194 |
|
|
consElem1->setPos(posA); |
195 |
gezelter |
246 |
|
196 |
gezelter |
507 |
//set atom2's position |
197 |
|
|
posB -= rmb * delta; |
198 |
|
|
consElem2->setPos(posB); |
199 |
gezelter |
246 |
|
200 |
gezelter |
507 |
delta /= dt_; |
201 |
gezelter |
246 |
|
202 |
gezelter |
507 |
//set atom1's velocity |
203 |
|
|
Vector3d velA = consElem1->getVel(); |
204 |
|
|
velA += rma * delta; |
205 |
|
|
consElem1->setVel(velA); |
206 |
gezelter |
246 |
|
207 |
gezelter |
507 |
//set atom2's velocity |
208 |
|
|
Vector3d velB = consElem2->getVel(); |
209 |
|
|
velB -= rmb * delta; |
210 |
|
|
consElem2->setVel(velB); |
211 |
gezelter |
246 |
|
212 |
gezelter |
507 |
return consSuccess; |
213 |
|
|
} |
214 |
|
|
else |
215 |
|
|
return consAlready; |
216 |
|
|
|
217 |
gezelter |
246 |
} |
218 |
|
|
|
219 |
|
|
|
220 |
gezelter |
507 |
int Rattle::constraintPairB(ConstraintPair* consPair){ |
221 |
gezelter |
246 |
ConstraintElem* consElem1 = consPair->getConsElem1(); |
222 |
|
|
ConstraintElem* consElem2 = consPair->getConsElem2(); |
223 |
|
|
|
224 |
|
|
|
225 |
|
|
Vector3d velA = consElem1->getVel(); |
226 |
|
|
Vector3d velB = consElem2->getVel(); |
227 |
|
|
|
228 |
|
|
Vector3d dv = velA - velB; |
229 |
|
|
|
230 |
|
|
Vector3d posA = consElem1->getPos(); |
231 |
|
|
Vector3d posB = consElem2->getPos(); |
232 |
|
|
|
233 |
|
|
Vector3d rab = posA - posB; |
234 |
|
|
|
235 |
|
|
currentSnapshot_->wrapVector(rab); |
236 |
|
|
|
237 |
tim |
963 |
RealType rma = 1.0 / consElem1->getMass(); |
238 |
|
|
RealType rmb = 1.0 / consElem2->getMass(); |
239 |
gezelter |
246 |
|
240 |
tim |
963 |
RealType rvab = dot(rab, dv); |
241 |
gezelter |
246 |
|
242 |
tim |
963 |
RealType gab = -rvab / ((rma + rmb) * consPair->getConsDistSquare()); |
243 |
gezelter |
246 |
|
244 |
|
|
if (fabs(gab) > consTolerance_){ |
245 |
|
|
Vector3d delta = rab * gab; |
246 |
|
|
|
247 |
|
|
velA += rma * delta; |
248 |
|
|
consElem1->setVel(velA); |
249 |
|
|
|
250 |
|
|
velB -= rmb * delta; |
251 |
|
|
consElem2->setVel(velB); |
252 |
|
|
|
253 |
|
|
return consSuccess; |
254 |
|
|
} |
255 |
|
|
else |
256 |
|
|
return consAlready; |
257 |
|
|
|
258 |
gezelter |
507 |
} |
259 |
gezelter |
246 |
|
260 |
|
|
} |