| 1 | /*
|
|---|
| 2 | * Project: MoleCuilder
|
|---|
| 3 | * Description: creates and alters molecular systems
|
|---|
| 4 | * Copyright (C) 2015 Frederik Heber. All rights reserved.
|
|---|
| 5 | *
|
|---|
| 6 | *
|
|---|
| 7 | * This file is part of MoleCuilder.
|
|---|
| 8 | *
|
|---|
| 9 | * MoleCuilder is free software: you can redistribute it and/or modify
|
|---|
| 10 | * it under the terms of the GNU General Public License as published by
|
|---|
| 11 | * the Free Software Foundation, either version 2 of the License, or
|
|---|
| 12 | * (at your option) any later version.
|
|---|
| 13 | *
|
|---|
| 14 | * MoleCuilder is distributed in the hope that it will be useful,
|
|---|
| 15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 17 | * GNU General Public License for more details.
|
|---|
| 18 | *
|
|---|
| 19 | * You should have received a copy of the GNU General Public License
|
|---|
| 20 | * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 21 | */
|
|---|
| 22 |
|
|---|
| 23 | /*
|
|---|
| 24 | * ChargeSmearer.cpp
|
|---|
| 25 | *
|
|---|
| 26 | * Created on: Sep 2, 2015
|
|---|
| 27 | * Author: heber
|
|---|
| 28 | */
|
|---|
| 29 |
|
|---|
| 30 | // include config.h
|
|---|
| 31 | #ifdef HAVE_CONFIG_H
|
|---|
| 32 | #include <config.h>
|
|---|
| 33 | #endif
|
|---|
| 34 |
|
|---|
| 35 | #include "CodePatterns/MemDebug.hpp"
|
|---|
| 36 |
|
|---|
| 37 | #include "ChargeSmearer.hpp"
|
|---|
| 38 |
|
|---|
| 39 | #include "CodePatterns/Singleton_impl.hpp"
|
|---|
| 40 |
|
|---|
| 41 | #include <base/helper.hpp>
|
|---|
| 42 | #include <base/index.hpp>
|
|---|
| 43 | #include <units/particle/bspline.hpp>
|
|---|
| 44 |
|
|---|
| 45 | ChargeSmearer::ChargeSmearer() :
|
|---|
| 46 | nfc(0),
|
|---|
| 47 | meshwidth(0.),
|
|---|
| 48 | vals(NULL),
|
|---|
| 49 | int_val(0.)
|
|---|
| 50 | {}
|
|---|
| 51 |
|
|---|
| 52 | ChargeSmearer::~ChargeSmearer()
|
|---|
| 53 | {
|
|---|
| 54 | delete[] vals;
|
|---|
| 55 | }
|
|---|
| 56 |
|
|---|
| 57 | void ChargeSmearer::initializeSplineArray(
|
|---|
| 58 | const VMG::Particle::BSpline &_spl,
|
|---|
| 59 | const unsigned int _nfc,
|
|---|
| 60 | const double _meshwidth)
|
|---|
| 61 | {
|
|---|
| 62 | // check whether it is changed, if not, do nothing
|
|---|
| 63 | if ((nfc == _nfc) && (meshwidth == _meshwidth))
|
|---|
| 64 | return;
|
|---|
| 65 | nfc = _nfc;
|
|---|
| 66 | meshwidth = _meshwidth;
|
|---|
| 67 |
|
|---|
| 68 | // reallocate memory for spline values
|
|---|
| 69 | delete[] vals;
|
|---|
| 70 | double *vals = new double[VMG::Helper::intpow(2*nfc+1,3)];
|
|---|
| 71 |
|
|---|
| 72 | // recalculate spline values
|
|---|
| 73 | unsigned int c=0;
|
|---|
| 74 | int_val = 0.;
|
|---|
| 75 | for (double dir_x=-1*nfc*meshwidth; dir_x<=nfc*meshwidth; dir_x+=meshwidth) {
|
|---|
| 76 | for (double dir_y=-1*nfc*meshwidth; dir_y<=nfc*meshwidth; dir_y+=meshwidth) {
|
|---|
| 77 | for (double dir_z=-1*nfc*meshwidth; dir_z<=nfc*meshwidth; dir_z+=meshwidth) {
|
|---|
| 78 |
|
|---|
| 79 | // Compute distance from grid point to particle
|
|---|
| 80 | const double distance = std::sqrt(dir_x*dir_x+dir_y*dir_y+dir_z*dir_z);
|
|---|
| 81 | const double temp_val = _spl.EvaluateSpline(distance);
|
|---|
| 82 | vals[c++] = temp_val;
|
|---|
| 83 | int_val += temp_val;
|
|---|
| 84 | }
|
|---|
| 85 | }
|
|---|
| 86 | }
|
|---|
| 87 |
|
|---|
| 88 | /// then integrate
|
|---|
| 89 | int_val = 1.0 / (int_val * meshwidth * meshwidth * meshwidth);
|
|---|
| 90 | }
|
|---|
| 91 |
|
|---|
| 92 | void ChargeSmearer::operator()(
|
|---|
| 93 | VMG::Grid& _grid,
|
|---|
| 94 | const VMG::GridIterator &_iter,
|
|---|
| 95 | const double _charge) const
|
|---|
| 96 | {
|
|---|
| 97 | /// prepare bounds
|
|---|
| 98 | std::pair<int, int> bounds[3];
|
|---|
| 99 | for (int dim=0;dim<3;++dim) {
|
|---|
| 100 | bounds[dim].first = std::max(_iter.GetBegin()[dim], _iter.GetIndex()[dim] - (int)nfc);
|
|---|
| 101 | bounds[dim].second = std::min(_iter.GetEnd()[dim], _iter.GetIndex()[dim] + (int)nfc);
|
|---|
| 102 | }
|
|---|
| 103 |
|
|---|
| 104 | /// then transfer to grid in bounded window
|
|---|
| 105 | unsigned int c = 0;
|
|---|
| 106 | for (int i=bounds[0].first; i<=bounds[0].second; ++i)
|
|---|
| 107 | for (int j=bounds[1].first; j<=bounds[1].second; ++j)
|
|---|
| 108 | for (int k=bounds[2].first; k<=bounds[2].second; ++k)
|
|---|
| 109 | _grid(i,j,k) += vals[c++] * int_val * _charge;
|
|---|
| 110 | assert( c == (unsigned int)VMG::Helper::intpow(2*nfc+1,3) );
|
|---|
| 111 | }
|
|---|
| 112 |
|
|---|
| 113 | CONSTRUCT_SINGLETON(ChargeSmearer)
|
|---|