| 1 |
/* |
| 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. Redistributions of source code must retain the above copyright |
| 10 |
* notice, this list of conditions and the following disclaimer. |
| 11 |
* |
| 12 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 13 |
* 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 |
* |
| 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 |
*/ |
| 41 |
|
| 42 |
#include <stdio.h> |
| 43 |
#include <string.h> |
| 44 |
|
| 45 |
#include <cmath> |
| 46 |
#include "nonbonded/GB.hpp" |
| 47 |
#include "utils/simError.h" |
| 48 |
|
| 49 |
using namespace std; |
| 50 |
namespace OpenMD { |
| 51 |
|
| 52 |
GB::GB() : name_("GB"), initialized_(false), mu_(2.0), nu_(1.0), forceField_(NULL) {} |
| 53 |
|
| 54 |
GayBerneParam GB::getGayBerneParam(AtomType* atomType) { |
| 55 |
|
| 56 |
// Do sanity checking on the AtomType we were passed before |
| 57 |
// building any data structures: |
| 58 |
if (!atomType->isGayBerne()) { |
| 59 |
sprintf( painCave.errMsg, |
| 60 |
"GB::getGayBerneParam was passed an atomType (%s) that does\n" |
| 61 |
"\tnot appear to be a Gay-Berne atom.\n", |
| 62 |
atomType->getName().c_str()); |
| 63 |
painCave.severity = OPENMD_ERROR; |
| 64 |
painCave.isFatal = 1; |
| 65 |
simError(); |
| 66 |
} |
| 67 |
|
| 68 |
DirectionalAtomType* daType = dynamic_cast<DirectionalAtomType*>(atomType); |
| 69 |
GenericData* data = daType->getPropertyByName("GayBerne"); |
| 70 |
if (data == NULL) { |
| 71 |
sprintf( painCave.errMsg, "GB::getGayBerneParam could not find\n" |
| 72 |
"\tGay-Berne parameters for atomType %s.\n", |
| 73 |
daType->getName().c_str()); |
| 74 |
painCave.severity = OPENMD_ERROR; |
| 75 |
painCave.isFatal = 1; |
| 76 |
simError(); |
| 77 |
} |
| 78 |
|
| 79 |
GayBerneParamGenericData* gbData = dynamic_cast<GayBerneParamGenericData*>(data); |
| 80 |
if (gbData == NULL) { |
| 81 |
sprintf( painCave.errMsg, |
| 82 |
"GB::getGayBerneParam could not convert GenericData to\n" |
| 83 |
"\tGayBerneParamGenericData for atom type %s\n", |
| 84 |
daType->getName().c_str()); |
| 85 |
painCave.severity = OPENMD_ERROR; |
| 86 |
painCave.isFatal = 1; |
| 87 |
simError(); |
| 88 |
} |
| 89 |
|
| 90 |
return gbData->getData(); |
| 91 |
} |
| 92 |
|
| 93 |
LJParam GB::getLJParam(AtomType* atomType) { |
| 94 |
|
| 95 |
// Do sanity checking on the AtomType we were passed before |
| 96 |
// building any data structures: |
| 97 |
if (!atomType->isLennardJones()) { |
| 98 |
sprintf( painCave.errMsg, |
| 99 |
"GB::getLJParam was passed an atomType (%s) that does not\n" |
| 100 |
"\tappear to be a Lennard-Jones atom.\n", |
| 101 |
atomType->getName().c_str()); |
| 102 |
painCave.severity = OPENMD_ERROR; |
| 103 |
painCave.isFatal = 1; |
| 104 |
simError(); |
| 105 |
} |
| 106 |
|
| 107 |
GenericData* data = atomType->getPropertyByName("LennardJones"); |
| 108 |
if (data == NULL) { |
| 109 |
sprintf( painCave.errMsg, "GB::getLJParam could not find Lennard-Jones\n" |
| 110 |
"\tparameters for atomType %s.\n", atomType->getName().c_str()); |
| 111 |
painCave.severity = OPENMD_ERROR; |
| 112 |
painCave.isFatal = 1; |
| 113 |
simError(); |
| 114 |
} |
| 115 |
|
| 116 |
LJParamGenericData* ljData = dynamic_cast<LJParamGenericData*>(data); |
| 117 |
if (ljData == NULL) { |
| 118 |
sprintf( painCave.errMsg, |
| 119 |
"GB::getLJParam could not convert GenericData to LJParam for\n" |
| 120 |
"\tatom type %s\n", atomType->getName().c_str()); |
| 121 |
painCave.severity = OPENMD_ERROR; |
| 122 |
painCave.isFatal = 1; |
| 123 |
simError(); |
| 124 |
} |
| 125 |
|
| 126 |
return ljData->getData(); |
| 127 |
} |
| 128 |
|
| 129 |
RealType GB::getLJEpsilon(AtomType* atomType) { |
| 130 |
LJParam ljParam = getLJParam(atomType); |
| 131 |
return ljParam.epsilon; |
| 132 |
} |
| 133 |
RealType GB::getLJSigma(AtomType* atomType) { |
| 134 |
LJParam ljParam = getLJParam(atomType); |
| 135 |
return ljParam.sigma; |
| 136 |
} |
| 137 |
|
| 138 |
void GB::initialize() { |
| 139 |
|
| 140 |
ForceFieldOptions& fopts = forceField_->getForceFieldOptions(); |
| 141 |
mu_ = fopts.getGayBerneMu(); |
| 142 |
nu_ = fopts.getGayBerneNu(); |
| 143 |
ForceField::AtomTypeContainer* atomTypes = forceField_->getAtomTypes(); |
| 144 |
ForceField::AtomTypeContainer::MapTypeIterator i; |
| 145 |
AtomType* at; |
| 146 |
|
| 147 |
// GB handles all of the GB-GB interactions as well as GB-LJ cross |
| 148 |
// interactions: |
| 149 |
|
| 150 |
for (at = atomTypes->beginType(i); at != NULL; |
| 151 |
at = atomTypes->nextType(i)) { |
| 152 |
|
| 153 |
if (at->isGayBerne() || at->isLennardJones()) |
| 154 |
addType(at); |
| 155 |
} |
| 156 |
|
| 157 |
initialized_ = true; |
| 158 |
} |
| 159 |
|
| 160 |
void GB::addType(AtomType* atomType){ |
| 161 |
// add it to the map: |
| 162 |
AtomTypeProperties atp = atomType->getATP(); |
| 163 |
|
| 164 |
pair<map<int,AtomType*>::iterator,bool> ret; |
| 165 |
ret = GBMap.insert( pair<int, AtomType*>(atp.ident, atomType) ); |
| 166 |
if (ret.second == false) { |
| 167 |
sprintf( painCave.errMsg, |
| 168 |
"GB already had a previous entry with ident %d\n", |
| 169 |
atp.ident); |
| 170 |
painCave.severity = OPENMD_INFO; |
| 171 |
painCave.isFatal = 0; |
| 172 |
simError(); |
| 173 |
} |
| 174 |
|
| 175 |
RealType d1, l1, e1, er1, dw1; |
| 176 |
|
| 177 |
if (atomType->isGayBerne()) { |
| 178 |
GayBerneParam gb1 = getGayBerneParam(atomType); |
| 179 |
d1 = gb1.GB_d; |
| 180 |
l1 = gb1.GB_l; |
| 181 |
e1 = gb1.GB_eps; |
| 182 |
er1 = gb1.GB_eps_ratio; |
| 183 |
dw1 = gb1.GB_dw; |
| 184 |
} else if (atomType->isLennardJones()) { |
| 185 |
d1 = getLJSigma(atomType) / sqrt(2.0); |
| 186 |
e1 = getLJEpsilon(atomType); |
| 187 |
l1 = d1; |
| 188 |
er1 = 1.0; |
| 189 |
dw1 = 1.0; |
| 190 |
} else { |
| 191 |
sprintf( painCave.errMsg, |
| 192 |
"GB::addType was passed an atomType (%s) that does not\n" |
| 193 |
"\tappear to be a Gay-Berne or Lennard-Jones atom.\n", |
| 194 |
atomType->getName().c_str()); |
| 195 |
painCave.severity = OPENMD_ERROR; |
| 196 |
painCave.isFatal = 1; |
| 197 |
simError(); |
| 198 |
} |
| 199 |
|
| 200 |
|
| 201 |
// Now, iterate over all known types and add to the mixing map: |
| 202 |
|
| 203 |
map<int, AtomType*>::iterator it; |
| 204 |
for( it = GBMap.begin(); it != GBMap.end(); ++it) { |
| 205 |
|
| 206 |
AtomType* atype2 = (*it).second; |
| 207 |
|
| 208 |
RealType d2, l2, e2, er2, dw2; |
| 209 |
|
| 210 |
if (atype2->isGayBerne()) { |
| 211 |
GayBerneParam gb2 = getGayBerneParam(atype2); |
| 212 |
d2 = gb2.GB_d; |
| 213 |
l2 = gb2.GB_l; |
| 214 |
e2 = gb2.GB_eps; |
| 215 |
er2 = gb2.GB_eps_ratio; |
| 216 |
dw2 = gb2.GB_dw; |
| 217 |
} else if (atype2->isLennardJones()) { |
| 218 |
d2 = getLJSigma(atype2) / sqrt(2.0); |
| 219 |
e2 = getLJEpsilon(atype2); |
| 220 |
l2 = d2; |
| 221 |
er2 = 1.0; |
| 222 |
dw2 = 1.0; |
| 223 |
} |
| 224 |
|
| 225 |
GBInteractionData mixer; |
| 226 |
|
| 227 |
// Cleaver paper uses sqrt of squares to get sigma0 for |
| 228 |
// mixed interactions. |
| 229 |
|
| 230 |
mixer.sigma0 = sqrt(d1*d1 + d2*d2); |
| 231 |
mixer.xa2 = (l1*l1 - d1*d1)/(l1*l1 + d2*d2); |
| 232 |
mixer.xai2 = (l2*l2 - d2*d2)/(l2*l2 + d1*d1); |
| 233 |
mixer.x2 = (l1*l1 - d1*d1) * (l2*l2 - d2*d2) / |
| 234 |
((l2*l2 + d1*d1) * (l1*l1 + d2*d2)); |
| 235 |
|
| 236 |
// assumed LB mixing rules for now: |
| 237 |
|
| 238 |
mixer.dw = 0.5 * (dw1 + dw2); |
| 239 |
mixer.eps0 = sqrt(e1 * e2); |
| 240 |
|
| 241 |
RealType er = sqrt(er1 * er2); |
| 242 |
RealType ermu = pow(er, (1.0 / mu_)); |
| 243 |
RealType xp = (1.0 - ermu) / (1.0 + ermu); |
| 244 |
RealType ap2 = 1.0 / (1.0 + ermu); |
| 245 |
|
| 246 |
mixer.xp2 = xp * xp; |
| 247 |
mixer.xpap2 = xp * ap2; |
| 248 |
mixer.xpapi2 = xp / ap2; |
| 249 |
|
| 250 |
cerr << "mixer" << er1 << " " << er2 << " " << mu_ << " " << ermu << " " << xp <<" " << ap2 << "\n"; |
| 251 |
|
| 252 |
// only add this pairing if at least one of the atoms is a Gay-Berne atom |
| 253 |
|
| 254 |
if (atomType->isGayBerne() || atype2->isGayBerne()) { |
| 255 |
|
| 256 |
pair<AtomType*, AtomType*> key1, key2; |
| 257 |
key1 = make_pair(atomType, atype2); |
| 258 |
key2 = make_pair(atype2, atomType); |
| 259 |
|
| 260 |
MixingMap[key1] = mixer; |
| 261 |
if (key2 != key1) { |
| 262 |
MixingMap[key2] = mixer; |
| 263 |
} |
| 264 |
} |
| 265 |
} |
| 266 |
} |
| 267 |
|
| 268 |
void GB::initForce() { |
| 269 |
if (!initialized_) initialize(); |
| 270 |
} |
| 271 |
|
| 272 |
void GB::calcForce(InteractionData &idat) { |
| 273 |
|
| 274 |
if (!initialized_) initialize(); |
| 275 |
|
| 276 |
GBInteractionData mixer = MixingMap[idat.atypes]; |
| 277 |
|
| 278 |
RealType sigma0 = mixer.sigma0; |
| 279 |
RealType dw = mixer.dw; |
| 280 |
RealType eps0 = mixer.eps0; |
| 281 |
RealType x2 = mixer.x2; |
| 282 |
RealType xa2 = mixer.xa2; |
| 283 |
RealType xai2 = mixer.xai2; |
| 284 |
RealType xp2 = mixer.xp2; |
| 285 |
RealType xpap2 = mixer.xpap2; |
| 286 |
RealType xpapi2 = mixer.xpapi2; |
| 287 |
|
| 288 |
Vector3d ul1 = idat.A1->getRow(2); |
| 289 |
Vector3d ul2 = idat.A2->getRow(2); |
| 290 |
|
| 291 |
RealType a, b, g; |
| 292 |
|
| 293 |
bool i_is_LJ = idat.atypes.first->isLennardJones(); |
| 294 |
bool j_is_LJ = idat.atypes.second->isLennardJones(); |
| 295 |
|
| 296 |
if (i_is_LJ) { |
| 297 |
a = 0.0; |
| 298 |
ul1 = V3Zero; |
| 299 |
} else { |
| 300 |
a = dot(*(idat.d), ul1); |
| 301 |
} |
| 302 |
|
| 303 |
if (j_is_LJ) { |
| 304 |
b = 0.0; |
| 305 |
ul2 = V3Zero; |
| 306 |
} else { |
| 307 |
b = dot(*(idat.d), ul2); |
| 308 |
} |
| 309 |
|
| 310 |
if (i_is_LJ || j_is_LJ) |
| 311 |
g = 0.0; |
| 312 |
else |
| 313 |
g = dot(ul1, ul2); |
| 314 |
|
| 315 |
cerr << "in GB, d = " << *(idat.d) << "\n"; |
| 316 |
cerr << "abg = " << a << " " << b << " " << g <<"\n"; |
| 317 |
|
| 318 |
RealType au = a / *(idat.rij); |
| 319 |
RealType bu = b / *(idat.rij); |
| 320 |
|
| 321 |
RealType au2 = au * au; |
| 322 |
RealType bu2 = bu * bu; |
| 323 |
RealType g2 = g * g; |
| 324 |
|
| 325 |
RealType H = (xa2 * au2 + xai2 * bu2 - 2.0*x2*au*bu*g) / (1.0 - x2*g2); |
| 326 |
RealType Hp = (xpap2*au2 + xpapi2*bu2 - 2.0*xp2*au*bu*g) / (1.0 - xp2*g2); |
| 327 |
cerr << "xa2, xai2 " << xa2 << " " << xai2 << "\n"; |
| 328 |
cerr << "xpap2, xpapi2 " << xpap2 << " " << xpapi2 << "\n"; |
| 329 |
cerr << "H Hp = " << H << " " << Hp << "\n"; |
| 330 |
|
| 331 |
RealType sigma = sigma0 / sqrt(1.0 - H); |
| 332 |
RealType e1 = 1.0 / sqrt(1.0 - x2*g2); |
| 333 |
RealType e2 = 1.0 - Hp; |
| 334 |
RealType eps = eps0 * pow(e1,nu_) * pow(e2,mu_); |
| 335 |
cerr << "eps = " << eps0 << " " << e1 << " " << nu_ << " " << e2 << " " << mu_ << "\n"; |
| 336 |
RealType BigR = dw*sigma0 / (*(idat.rij) - sigma + dw*sigma0); |
| 337 |
|
| 338 |
RealType R3 = BigR*BigR*BigR; |
| 339 |
RealType R6 = R3*R3; |
| 340 |
RealType R7 = R6 * BigR; |
| 341 |
RealType R12 = R6*R6; |
| 342 |
RealType R13 = R6*R7; |
| 343 |
|
| 344 |
RealType U = *(idat.vdwMult) * 4.0 * eps * (R12 - R6); |
| 345 |
|
| 346 |
cerr << "R12, R6, eps = " << R12 << " " << R6 << " " << eps << " " << *(idat.vdwMult) << "\n"; |
| 347 |
|
| 348 |
RealType s3 = sigma*sigma*sigma; |
| 349 |
RealType s03 = sigma0*sigma0*sigma0; |
| 350 |
|
| 351 |
RealType pref1 = - *(idat.vdwMult) * 8.0 * eps * mu_ * (R12 - R6) / |
| 352 |
(e2 * *(idat.rij)); |
| 353 |
|
| 354 |
RealType pref2 = *(idat.vdwMult) * 8.0 * eps * s3 * (6.0*R13 - 3.0*R7) / |
| 355 |
(dw* *(idat.rij) * s03); |
| 356 |
|
| 357 |
RealType dUdr = - (pref1 * Hp + pref2 * (sigma0 * sigma0 * |
| 358 |
*(idat.rij) / s3 + H)); |
| 359 |
|
| 360 |
RealType dUda = pref1 * (xpap2*au - xp2*bu*g) / (1.0 - xp2 * g2) |
| 361 |
+ pref2 * (xa2 * au - x2 *bu*g) / (1.0 - x2 * g2); |
| 362 |
|
| 363 |
RealType dUdb = pref1 * (xpapi2*bu - xp2*au*g) / (1.0 - xp2 * g2) |
| 364 |
+ pref2 * (xai2 * bu - x2 *au*g) / (1.0 - x2 * g2); |
| 365 |
|
| 366 |
RealType dUdg = 4.0 * eps * nu_ * (R12 - R6) * x2 * g / (1.0 - x2*g2) |
| 367 |
+ 8.0 * eps * mu_ * (R12 - R6) * (xp2*au*bu - Hp*xp2*g) / |
| 368 |
(1.0 - xp2 * g2) / e2 + 8.0 * eps * s3 * (3.0 * R7 - 6.0 * R13) * |
| 369 |
(x2 * au * bu - H * x2 * g) / (1.0 - x2 * g2) / (dw * s03); |
| 370 |
|
| 371 |
cerr << pref1 << " " << pref2 << " " << dUdr <<" " << dUda << " " << dUdb << dUdg << "\n"; |
| 372 |
|
| 373 |
Vector3d rhat = *(idat.d) / *(idat.rij); |
| 374 |
Vector3d rxu1 = cross(*(idat.d), ul1); |
| 375 |
Vector3d rxu2 = cross(*(idat.d), ul2); |
| 376 |
Vector3d uxu = cross(ul1, ul2); |
| 377 |
|
| 378 |
cerr << "U = " << U << "\n"; |
| 379 |
cerr << "f1 = " << dUdr * rhat + dUda * ul1 + dUdb * ul2 << "\n"; |
| 380 |
cerr << "t1 = " << dUda * rxu1 - dUdg * uxu << "\n"; |
| 381 |
cerr << "t2 = " << dUdb * rxu2 - dUdg * uxu << "\n"; |
| 382 |
|
| 383 |
|
| 384 |
(*(idat.pot))[VANDERWAALS_FAMILY] += U * *(idat.sw); |
| 385 |
*(idat.f1) += dUdr * rhat + dUda * ul1 + dUdb * ul2; |
| 386 |
*(idat.t1) += dUda * rxu1 - dUdg * uxu; |
| 387 |
*(idat.t2) += dUdb * rxu2 - dUdg * uxu; |
| 388 |
*(idat.vpair) += U * *(idat.sw); |
| 389 |
|
| 390 |
return; |
| 391 |
|
| 392 |
} |
| 393 |
|
| 394 |
RealType GB::getSuggestedCutoffRadius(pair<AtomType*, AtomType*> atypes) { |
| 395 |
if (!initialized_) initialize(); |
| 396 |
|
| 397 |
RealType cut = 0.0; |
| 398 |
|
| 399 |
if (atypes.first->isGayBerne()) { |
| 400 |
GayBerneParam gb1 = getGayBerneParam(atypes.first); |
| 401 |
RealType d1 = gb1.GB_d; |
| 402 |
RealType l1 = gb1.GB_l; |
| 403 |
// sigma is actually sqrt(2)*l for prolate ellipsoids |
| 404 |
cut = max(cut, 2.5 * sqrt(2.0) * max(d1, l1)); |
| 405 |
} else if (atypes.first->isLennardJones()) { |
| 406 |
cut = max(cut, 2.5 * getLJSigma(atypes.first)); |
| 407 |
} |
| 408 |
|
| 409 |
if (atypes.second->isGayBerne()) { |
| 410 |
GayBerneParam gb2 = getGayBerneParam(atypes.second); |
| 411 |
RealType d2 = gb2.GB_d; |
| 412 |
RealType l2 = gb2.GB_l; |
| 413 |
cut = max(cut, 2.5 * sqrt(2.0) * max(d2, l2)); |
| 414 |
} else if (atypes.second->isLennardJones()) { |
| 415 |
cut = max(cut, 2.5 * getLJSigma(atypes.second)); |
| 416 |
} |
| 417 |
|
| 418 |
return cut; |
| 419 |
} |
| 420 |
} |
| 421 |
|
