Update Colvars library to version 2020-01-27
One new feature (arithmetic path variables) and several smaller enhancements
or bugfixes.
Fix error check when loading an old state file
https://github.com/Colvars/colvars/pull/317
Get default values for grid boundaries when available
https://github.com/Colvars/colvars/pull/310
Allow redefining existing index groups (warn when this happens)
https://github.com/Colvars/colvars/pull/302
Simplified replica communication syntax in metadynamics
https://github.com/Colvars/colvars/pull/301
Obtain the bias_energy for ABF biases
https://github.com/Colvars/colvars/pull/294
Fix reading path file with vector CVCs
https://github.com/Colvars/colvars/pull/288
Fix segfault at deleting CVBasedPath
https://github.com/Colvars/colvars/pull/286
Parrinello's (arithmetic) pathCV in CV space
https://github.com/Colvars/colvars/pull/274
Fix race condition when starting a bundle of walkers
https://github.com/Colvars/colvars/pull/279
This commit is contained in:
129
lib/colvars/colvar_arithmeticpath.h
Normal file
129
lib/colvars/colvar_arithmeticpath.h
Normal file
@ -0,0 +1,129 @@
|
||||
#ifndef ARITHMETICPATHCV_H
|
||||
#define ARITHMETICPATHCV_H
|
||||
|
||||
#include "colvarmodule.h"
|
||||
|
||||
#include <vector>
|
||||
#include <cmath>
|
||||
#include <iostream>
|
||||
#include <limits>
|
||||
|
||||
namespace ArithmeticPathCV {
|
||||
|
||||
using std::vector;
|
||||
|
||||
enum path_sz {S, Z};
|
||||
|
||||
template <typename element_type, typename scalar_type, path_sz path_type>
|
||||
class ArithmeticPathBase {
|
||||
public:
|
||||
ArithmeticPathBase() {}
|
||||
virtual ~ArithmeticPathBase() {}
|
||||
virtual void initialize(size_t p_num_elements, size_t p_total_frames, double p_lambda, const vector<element_type>& p_element, const vector<double>& p_weights);
|
||||
virtual void updateDistanceToReferenceFrames() = 0;
|
||||
virtual void computeValue();
|
||||
virtual void computeDerivatives();
|
||||
virtual void compute();
|
||||
protected:
|
||||
scalar_type lambda;
|
||||
vector<scalar_type> weights;
|
||||
size_t num_elements;
|
||||
size_t total_frames;
|
||||
vector< vector<element_type> > frame_element_distances;
|
||||
scalar_type s;
|
||||
scalar_type z;
|
||||
vector<element_type> dsdx;
|
||||
vector<element_type> dzdx;
|
||||
private:
|
||||
// intermediate variables
|
||||
vector<scalar_type> s_numerator_frame;
|
||||
vector<scalar_type> s_denominator_frame;
|
||||
scalar_type numerator_s;
|
||||
scalar_type denominator_s;
|
||||
scalar_type normalization_factor;
|
||||
};
|
||||
|
||||
template <typename element_type, typename scalar_type, path_sz path_type>
|
||||
void ArithmeticPathBase<element_type, scalar_type, path_type>::initialize(size_t p_num_elements, size_t p_total_frames, double p_lambda, const vector<element_type>& p_element, const vector<double>& p_weights) {
|
||||
lambda = p_lambda;
|
||||
weights = p_weights;
|
||||
num_elements = p_num_elements;
|
||||
total_frames = p_total_frames;
|
||||
frame_element_distances.resize(total_frames, p_element);
|
||||
for (size_t i_frame = 0; i_frame < frame_element_distances.size(); ++i_frame) {
|
||||
for (size_t j_elem = 0; j_elem < num_elements; ++j_elem) {
|
||||
frame_element_distances[i_frame][j_elem].reset();
|
||||
}
|
||||
}
|
||||
s = scalar_type(0);
|
||||
z = scalar_type(0);
|
||||
dsdx = p_element;
|
||||
dzdx = p_element;
|
||||
s_numerator_frame.resize(total_frames, scalar_type(0));
|
||||
s_denominator_frame.resize(total_frames, scalar_type(0));
|
||||
numerator_s = scalar_type(0);
|
||||
denominator_s = scalar_type(0);
|
||||
normalization_factor = 1.0 / static_cast<scalar_type>(total_frames - 1);
|
||||
}
|
||||
|
||||
template <typename element_type, typename scalar_type, path_sz path_type>
|
||||
void ArithmeticPathBase<element_type, scalar_type, path_type>::computeValue() {
|
||||
updateDistanceToReferenceFrames();
|
||||
numerator_s = scalar_type(0);
|
||||
denominator_s = scalar_type(0);
|
||||
for (size_t i_frame = 0; i_frame < frame_element_distances.size(); ++i_frame) {
|
||||
scalar_type exponent_tmp = scalar_type(0);
|
||||
for (size_t j_elem = 0; j_elem < num_elements; ++j_elem) {
|
||||
exponent_tmp += weights[j_elem] * frame_element_distances[i_frame][j_elem] * weights[j_elem] * frame_element_distances[i_frame][j_elem];
|
||||
}
|
||||
exponent_tmp = exponent_tmp * -1.0 * lambda;
|
||||
// prevent underflow if the argument of cvm::exp is less than -708.4
|
||||
if (exponent_tmp > -708.4) {
|
||||
exponent_tmp = cvm::exp(exponent_tmp);
|
||||
} else {
|
||||
exponent_tmp = 0;
|
||||
}
|
||||
numerator_s += static_cast<scalar_type>(i_frame) * exponent_tmp;
|
||||
denominator_s += exponent_tmp;
|
||||
s_numerator_frame[i_frame] = static_cast<scalar_type>(i_frame) * exponent_tmp;
|
||||
s_denominator_frame[i_frame] = exponent_tmp;
|
||||
}
|
||||
s = numerator_s / denominator_s * normalization_factor;
|
||||
z = -1.0 / lambda * cvm::logn(denominator_s);
|
||||
}
|
||||
|
||||
template <typename element_type, typename scalar_type, path_sz path_type>
|
||||
void ArithmeticPathBase<element_type, scalar_type, path_type>::compute() {
|
||||
computeValue();
|
||||
computeDerivatives();
|
||||
}
|
||||
|
||||
template <typename element_type, typename scalar_type, path_sz path_type>
|
||||
void ArithmeticPathBase<element_type, scalar_type, path_type>::computeDerivatives() {
|
||||
for (size_t j_elem = 0; j_elem < num_elements; ++j_elem) {
|
||||
element_type dsdxj_numerator_part1(dsdx[j_elem]);
|
||||
element_type dsdxj_numerator_part2(dsdx[j_elem]);
|
||||
element_type dzdxj_numerator(dsdx[j_elem]);
|
||||
dsdxj_numerator_part1.reset();
|
||||
dsdxj_numerator_part2.reset();
|
||||
dzdxj_numerator.reset();
|
||||
for (size_t i_frame = 0; i_frame < frame_element_distances.size(); ++i_frame) {
|
||||
element_type derivative_tmp = -2.0 * lambda * weights[j_elem] * weights[j_elem] * frame_element_distances[i_frame][j_elem];
|
||||
dsdxj_numerator_part1 += s_numerator_frame[i_frame] * derivative_tmp;
|
||||
dsdxj_numerator_part2 += s_denominator_frame[i_frame] * derivative_tmp;
|
||||
dzdxj_numerator += s_denominator_frame[i_frame] * derivative_tmp;
|
||||
}
|
||||
dsdxj_numerator_part1 *= denominator_s;
|
||||
dsdxj_numerator_part2 *= numerator_s;
|
||||
if ((dsdxj_numerator_part1 - dsdxj_numerator_part2).norm() < std::numeric_limits<scalar_type>::min()) {
|
||||
dsdx[j_elem] = 0;
|
||||
} else {
|
||||
dsdx[j_elem] = (dsdxj_numerator_part1 - dsdxj_numerator_part2) / (denominator_s * denominator_s) * normalization_factor;
|
||||
}
|
||||
dzdx[j_elem] = -1.0 / lambda * dzdxj_numerator / denominator_s;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif // ARITHMETICPATHCV_H
|
||||
Reference in New Issue
Block a user