1 |
gezelter |
2204 |
/* |
2 |
gezelter |
1930 |
* 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 |
|
|
*/ |
41 |
tim |
2448 |
#include <algorithm> |
42 |
tim |
1937 |
#include <cmath> |
43 |
gezelter |
1930 |
#include "types/CharmmTorsionType.hpp" |
44 |
|
|
#include "utils/NumericConstant.hpp" |
45 |
tim |
2448 |
#include "math/ChebyshevPolynomials.hpp" |
46 |
gezelter |
1930 |
namespace oopse { |
47 |
gezelter |
3173 |
CharmmTorsionType::CharmmTorsionType(std::vector<CharmmTorsionParameter>& parameters) { |
48 |
gezelter |
1930 |
std::vector<CharmmTorsionParameter>::iterator i; |
49 |
gezelter |
3173 |
i = std::max_element(parameters.begin(), parameters.end(), |
50 |
|
|
LessThanPeriodicityFunctor()); |
51 |
tim |
2448 |
if (i != parameters.end()) { |
52 |
gezelter |
3173 |
int maxPower = i->n; |
53 |
|
|
ChebyshevT T(maxPower); |
54 |
|
|
ChebyshevU U(maxPower); |
55 |
|
|
|
56 |
|
|
// convert parameters of charmm type torsion into |
57 |
|
|
// PolynomialTorsion's parameters |
58 |
gezelter |
1930 |
|
59 |
gezelter |
3173 |
DoublePolynomial finalPolynomial; |
60 |
|
|
for (i = parameters.begin(); i != parameters.end(); ++i) { |
61 |
|
|
DoublePolynomial cosTerm = T.getChebyshevPolynomial(i->n); |
62 |
|
|
cosTerm *= cos(i->delta) * i->kchi; |
63 |
|
|
DoublePolynomial sinTerm = U.getChebyshevPolynomial(i->n); |
64 |
|
|
sinTerm *= -sin(i->delta) * i->kchi; |
65 |
|
|
finalPolynomial = cosTerm + sinTerm; |
66 |
|
|
finalPolynomial += i->kchi; |
67 |
|
|
} |
68 |
|
|
torsionType_->setPolynomial(finalPolynomial); |
69 |
tim |
2448 |
} |
70 |
gezelter |
3173 |
} |
71 |
gezelter |
1930 |
} //end namespace oopse |