/usr/include/palabos/multiGrid/gridRefinement.hh is in libplb-dev 1.5~r1+repack1-2build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 | /* This file is part of the Palabos library.
*
* Copyright (C) 2011-2015 FlowKit Sarl
* Route d'Oron 2
* 1010 Lausanne, Switzerland
* E-mail contact: contact@flowkit.com
*
* The most recent release of Palabos can be downloaded at
* <http://www.palabos.org/>
*
* The library Palabos is free software: you can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* The library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/* Main author: Daniel Lagrava
**/
/** \file
* Coupling between grids of different refinement level -- generic implementation.
*/
#ifndef GRID_REFINEMENT_HH
#define GRID_REFINEMENT_HH
#include "multiGrid/gridRefinement.h"
namespace plb {
/** This function interpolates a function at the point (xValue,yValue)
* using the 2D Lagrangien formula using the vectors knownX, knownY and
* knownF. knownF must have knownX.size()*knownY.size() elements.
*/
template<typename T>
T interpolateValue(std::vector<T> const& knownX, std::vector<T> const& knownY,
std::vector<std::vector<T> > const& knownF, T xValue, T yValue){
// computation of the x coefficients of the polynomial
std::vector<T> Linx;
for (plint iX = 0; iX<(plint)knownX.size(); ++iX){
T res = 1.;
for (plint i = 0; i<(plint)knownX.size(); ++i){
if (i!=iX){
res *= (xValue-knownX[i])/(knownX[iX]-knownX[i]);
}
}
Linx.push_back(res);
}
// computation of the y coefficients of the polynomial
std::vector<T> Limy;
for (plint iY = 0; iY<(plint)knownY.size(); ++iY){
T res = 1.;
for (plint i = 0; i<(plint)knownY.size(); ++i){
if (i!=iY){
res *= (yValue-knownY[i])/(knownY[iY]-knownY[i]);
}
}
Limy.push_back(res);
}
// joining the whole following the given formula
T result = 0.;
for (plint iX=0; iX<(plint)knownX.size(); ++iX){
for (plint iY=0; iY<(plint)knownY.size(); ++iY){
result += Linx[iX]*Limy[iY]*knownF[iX][iY];
}
}
return result;
}
/* *************** Class ConvectiveRescaleEngine **************************** */
template<typename T, template<typename U> class Descriptor>
const T ConvectiveRescaleEngine<T,Descriptor>::toFine_xDxInv = (T) 2.;
template<typename T, template<typename U> class Descriptor>
const T ConvectiveRescaleEngine<T,Descriptor>::toFine_xDt = (T)1./(T)2.;
template<typename T, template<typename U> class Descriptor>
const T ConvectiveRescaleEngine<T,Descriptor>::toCoarse_xDxInv = (T)1./(T)2.;
template<typename T, template<typename U> class Descriptor>
const T ConvectiveRescaleEngine<T,Descriptor>::toCoarse_xDt = (T)2.;
template<typename T, template<typename U> class Descriptor>
ConvectiveRescaleEngine<T,Descriptor>::ConvectiveRescaleEngine(plint order_)
: order(order_)
{ }
template<typename T, template<typename U> class Descriptor>
void ConvectiveRescaleEngine<T,Descriptor>::scaleCoarseFine (
Cell<T,Descriptor> const& coarseCell, std::vector<T>& decomposedFineValues ) const
{
coarseCell.getDynamics().decompose(coarseCell, decomposedFineValues, order);
T tauCoarse = 1./coarseCell.getDynamics().getOmega();
T tauFine = 2.*tauCoarse - (T)1./(T)2.;
if (order == 0){
for (plint iFneq=0; iFneq<Descriptor<T>::q; ++iFneq) {
decomposedFineValues[1+Descriptor<T>::d+iFneq] *= tauFine/tauCoarse;
}
}
else {
for (plint iPineq=0; iPineq < SymmetricTensor<T,Descriptor>::n; ++iPineq) {
decomposedFineValues[1+Descriptor<T>::d+iPineq] *= tauFine/tauCoarse;
}
}
coarseCell.getDynamics().rescale( decomposedFineValues, toFine_xDxInv,
toFine_xDt, order );
}
template<typename T, template<typename U> class Descriptor>
void ConvectiveRescaleEngine<T,Descriptor>::scaleFineCoarse (
Cell<T,Descriptor> const& fineCell, std::vector<T>& decomposedCoarseValues ) const
{
// decompose the fine cell populations
fineCell.getDynamics().decompose(fineCell, decomposedCoarseValues, order);
// computation of the factor associated with both tau
T tauFine = 1./fineCell.getDynamics().getOmega();
T tauCoarse = (tauFine+(T)1./(T)2.)/(T)2.;
if (order == 0){
for (plint iFneq=0; iFneq < Descriptor<T>::q; ++iFneq) {
decomposedCoarseValues[1+Descriptor<T>::d+iFneq] *= tauCoarse/tauFine;
}
}
else {
for (plint iPineq=0; iPineq < SymmetricTensor<T,Descriptor>::n; ++iPineq) {
decomposedCoarseValues[1+Descriptor<T>::d+iPineq] *= tauCoarse/tauFine;
}
}
// rescale and copy the values inside decomposedCoarseValues
fineCell.getDynamics().rescale(decomposedCoarseValues, toCoarse_xDxInv,
toCoarse_xDt, order);
}
template<typename T, template<typename U> class Descriptor>
void ConvectiveRescaleEngine<T,Descriptor>::recompose (
Cell<T,Descriptor>& cell, std::vector<T> const& decomposedValues ) const
{
cell.getDynamics().recompose(cell, decomposedValues, order);
}
template<typename T, template<typename U> class Descriptor>
plint ConvectiveRescaleEngine<T,Descriptor>::getDecompositionOrder() const {
return order;
}
template<typename T, template<typename U> class Descriptor>
ConvectiveRescaleEngine<T,Descriptor>* ConvectiveRescaleEngine<T,Descriptor>::clone() const {
return new ConvectiveRescaleEngine<T,Descriptor>(*this);
}
/* *************** Class NoScalingEngine ************************************ */
template<typename T, template<typename U> class Descriptor>
NoScalingEngine<T,Descriptor>::NoScalingEngine(plint order_)
: order(order_)
{ }
template<typename T, template<typename U> class Descriptor>
void NoScalingEngine<T,Descriptor>::scaleCoarseFine (
Cell<T,Descriptor> const& coarseCell, std::vector<T>& decomposedFineValues ) const
{
coarseCell.getDynamics().decompose(coarseCell, decomposedFineValues, order);
}
template<typename T, template<typename U> class Descriptor>
void NoScalingEngine<T,Descriptor>::scaleFineCoarse (
Cell<T,Descriptor> const& fineCell, std::vector<T>& decomposedCoarseValues ) const
{
fineCell.getDynamics().decompose(fineCell, decomposedCoarseValues, order);
}
template<typename T, template<typename U> class Descriptor>
void NoScalingEngine<T,Descriptor>::recompose (
Cell<T,Descriptor>& cell, std::vector<T> const& decomposedValues ) const
{
cell.getDynamics().recompose(cell, decomposedValues, order);
}
template<typename T, template<typename U> class Descriptor>
plint NoScalingEngine<T,Descriptor>::getDecompositionOrder() const {
return order;
}
template<typename T, template<typename U> class Descriptor>
NoScalingEngine<T,Descriptor>* NoScalingEngine<T,Descriptor>::clone() const {
return new NoScalingEngine<T,Descriptor>(*this);
}
/* ************* Interpolations ****************** */
/// [pop1 x pop2] we interpolate over the x
template<typename T>
void linearInterpolation(std::vector<T>& pop1, std::vector<T>& pop2, std::vector<T>& decomposedValues)
{
PLB_PRECONDITION( pop1.size() == pop2.size() );
decomposedValues.resize(pop1.size());
for (pluint iVal=0; iVal<decomposedValues.size(); ++iVal) {
decomposedValues[iVal] = 1./2. * (
pop1[iVal] + pop2[iVal] );
}
}
/// [pop1 pop2 x pop3 pop4] we interpolate over the x
template<typename T>
void cubicCenteredInterpolation(std::vector<T>& pop1, std::vector<T>& pop2,
std::vector<T>& pop3, std::vector<T>& pop4,
std::vector<T>& decomposedValues )
{
PLB_PRECONDITION( pop1.size() == pop2.size() );
decomposedValues.resize(pop1.size());
for (pluint iVal=0; iVal<decomposedValues.size(); ++iVal) {
decomposedValues[iVal] = 9./16. * (
pop2[iVal] + pop3[iVal] ) -
1./16. * (pop1[iVal] + pop4[iVal] );
}
}
/// [pop1 x pop2 pop3] we interpolate over the x
template<typename T>
void quadraticNonCenteredInterpolation(std::vector<T>& pop1, std::vector<T>& pop2,
std::vector<T>& pop3, std::vector<T>& decomposedValues )
{
PLB_PRECONDITION( pop1.size() == pop2.size() && pop3.size() == pop1.size() );
decomposedValues.resize(pop1.size());
for (pluint iVal=0; iVal<decomposedValues.size(); ++iVal) {
decomposedValues[iVal] = 3./8.*pop1[iVal] + 3./4.*pop2[iVal] -1./8.*pop3[iVal];
}
}
} // namespace plb
#endif // GRID_REFINEMENT_HH
|