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 |
|
|
|
42 |
|
|
/** |
43 |
|
|
* @file PolynomialBendType.hpp |
44 |
|
|
* @author teng lin |
45 |
|
|
* @date 11/16/2004 |
46 |
|
|
* @version 1.0 |
47 |
|
|
*/ |
48 |
|
|
|
49 |
|
|
#ifndef TYPES_POLYNOMIALBENDTYPE_HPP |
50 |
|
|
#define TYPES_POLYNOMIALBENDTYPE_HPP |
51 |
|
|
#include <iostream> |
52 |
|
|
|
53 |
|
|
#include "math/Polynomial.hpp" |
54 |
|
|
#include "types/BendType.hpp" |
55 |
|
|
|
56 |
|
|
namespace oopse { |
57 |
|
|
|
58 |
gezelter |
2204 |
/** |
59 |
|
|
* @class PolynomialBendType PolynomialBendType.hpp "types/PolynomialBendType.hpp" |
60 |
|
|
* @todo documentation |
61 |
|
|
*/ |
62 |
|
|
class PolynomialBendType : public BendType{ |
63 |
gezelter |
1930 |
|
64 |
gezelter |
2204 |
public: |
65 |
|
|
PolynomialBendType(double theta) : BendType(theta) {} |
66 |
gezelter |
1930 |
|
67 |
gezelter |
2204 |
void setCoefficient(int power, double coefficient) { |
68 |
|
|
polynomial_.setCoefficient(power, coefficient); |
69 |
|
|
} |
70 |
gezelter |
1930 |
|
71 |
gezelter |
2204 |
double getCoefficient(int power) { |
72 |
|
|
return polynomial_.getCoefficient(power); |
73 |
|
|
} |
74 |
gezelter |
1930 |
|
75 |
gezelter |
2204 |
void calcForce(double theta, double & V, double & dVdr) { |
76 |
|
|
double delta = theta - theta0_; |
77 |
|
|
V = polynomial_.evaluate(delta); |
78 |
|
|
dVdr = polynomial_.evaluateDerivative(delta); |
79 |
gezelter |
1930 |
|
80 |
gezelter |
2204 |
} |
81 |
gezelter |
1930 |
|
82 |
gezelter |
2204 |
friend std::ostream& operator <<(std::ostream& os, PolynomialBendType& pbt); |
83 |
gezelter |
1930 |
|
84 |
gezelter |
2204 |
private: |
85 |
gezelter |
1930 |
|
86 |
gezelter |
2204 |
DoublePolynomial polynomial_; |
87 |
|
|
}; |
88 |
gezelter |
1930 |
|
89 |
gezelter |
2204 |
std::ostream& operator <<(std::ostream& os, PolynomialBendType& pbt) { |
90 |
gezelter |
1930 |
DoublePolynomial::const_iterator i; |
91 |
|
|
|
92 |
|
|
i = pbt.polynomial_.begin(); |
93 |
|
|
|
94 |
|
|
if (i == pbt.polynomial_.end()) { |
95 |
gezelter |
2204 |
os << "This PolynomialBendType contains nothing" << std::endl; |
96 |
|
|
return os; |
97 |
gezelter |
1930 |
} |
98 |
|
|
|
99 |
|
|
os << "This PolynomialBendType contains below terms:" << std::endl; |
100 |
|
|
|
101 |
|
|
while(true){ |
102 |
gezelter |
2204 |
os << i->second << "*" << "(theta - " << pbt.getTheta() << ")" << "^" << i->first; |
103 |
gezelter |
1930 |
|
104 |
gezelter |
2204 |
if (++i == pbt.polynomial_.end()) { |
105 |
|
|
//if we reach the end of the polynomial pair, write out a newline and then escape the loop |
106 |
|
|
os << std::endl; |
107 |
|
|
break; |
108 |
|
|
} else { |
109 |
|
|
//otherwise, write out a "+" |
110 |
|
|
os << " + "; |
111 |
|
|
} |
112 |
gezelter |
1930 |
} |
113 |
|
|
|
114 |
|
|
return os; |
115 |
gezelter |
2204 |
} |
116 |
gezelter |
1930 |
|
117 |
|
|
|
118 |
|
|
} //end namespace oopse |
119 |
|
|
#endif //TYPES_POLYNOMIALBENDTYPE_HPP |
120 |
|
|
|