/usr/include/trilinos/Intrepid_CubatureSparse.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
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 | // @HEADER
// ************************************************************************
//
// Intrepid Package
// Copyright (2007) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Pavel Bochev (pbboche@sandia.gov) or
// Denis Ridzal (dridzal@sandia.gov).
//
// ************************************************************************
// @HEADER
/** \file Intrepid_CubatureSparse.hpp
\brief Header file for the Intrepid::CubatureSparse class.
\author Created by P. Bochev, D. Ridzal, and M. Keegan.
*/
#ifndef INTREPID_CUBATURE_SPARSE_HPP
#define INTREPID_CUBATURE_SPARSE_HPP
#include "Intrepid_ConfigDefs.hpp"
#include "Intrepid_Cubature.hpp"
#include "Intrepid_CubatureDirectLineGauss.hpp"
#include "Intrepid_CubatureSparseHelper.hpp"
#include "Teuchos_TestForException.hpp"
/** \def INTREPID_CUBATURE_SPARSE2D_GAUSS_MAX
\brief The maximum degree of the polynomial that can be integrated exactly by
a sparse rule of the Gauss(-Legendre) type in 2D.
*/
#define INTREPID_CUBATURE_SPARSE2D_GAUSS_MAX 59
/** \def INTREPID_CUBATURE_SPARSE3D_GAUSS_MAX
\brief The maximum degree of the polynomial that can be integrated exactly by
a sparse of the Gauss(-Legendre) type in 3D.
*/
#define INTREPID_CUBATURE_SPARSE3D_GAUSS_MAX 57
namespace Intrepid{
template<class Scalar, int dimension_, class ArrayPoint = FieldContainer<Scalar>, class ArrayWeight = ArrayPoint>
class CubatureSparse : public Intrepid::Cubature<Scalar,ArrayPoint,ArrayWeight> {
private:
int level_;
int numPoints_;
const int degree_;
public:
~CubatureSparse() {}
CubatureSparse(const int degree);
/** \brief Returns cubature points and weights
(return arrays must be pre-sized/pre-allocated).
\param cubPoints [out] - Array containing the cubature points.
\param cubWeights [out] - Array of corresponding cubature weights.
*/
virtual void getCubature(ArrayPoint & cubPoints,
ArrayWeight & cubWeights) const;
/** \brief Returns the number of cubature points.
*/
virtual int getNumPoints() const;
/** \brief Returns dimension of the integration domain.
*/
virtual int getDimension() const;
/** \brief Returns algebraic accuracy (e.g. max. degree of polynomial
that is integrated exactly).
*/
virtual void getAccuracy(std::vector<int> & accuracy) const;
}; // end class CubatureSparse
// helper functions
template<class Scalar, int DIM>
void iterateThroughDimensions(int level,
int dims_left,
SGNodes<Scalar,DIM> & cubPointsND,
Teuchos::Array<Scalar> & partial_node,
Scalar partial_weight);
inline int factorial(int num)
{
int answer = 1;
if(num >= 1)
{
while(num > 0)
{
answer = answer*num;
num--;
}
}
else if(num == 0)
answer = 1;
else
answer = -1;
return answer;
}
inline double combination(int top, int bot)
{
double answer = factorial(top)/(factorial(bot) * factorial(top-bot));
return answer;
}
inline int iterateThroughDimensionsForNumCalc(int dims_left,
int level,
int levels_left,
int level_so_far,
Teuchos::Array<int> & nodes,
int product,
bool no_uni_quad)
{
int numNodes = 0;
for(int j = 1; j <= levels_left; j++)
{
bool temp_bool = no_uni_quad;
int temp_knots = nodes[j-1]*product;
int temp_lsf = level_so_far + j;
if(j==1)
temp_bool = false;
if(dims_left == 1)
{
if(temp_lsf < level && temp_bool == true)
numNodes += 0;
else
{
numNodes += temp_knots;
}
}
else
{
numNodes += iterateThroughDimensionsForNumCalc(dims_left-1,level, levels_left-j+1, temp_lsf, nodes, temp_knots, temp_bool);
}
}
return numNodes;
}
inline int calculateNumPoints(int dim, int level)
{
//int* uninum = new int[level];
Teuchos::Array<int> uninum(level);
uninum[0] = 1;
for(int i = 1; i <= level-1; i++)
{
uninum[i] = 2*i;
}
int numOfNodes = iterateThroughDimensionsForNumCalc(dim, level, level, 0, uninum, 1, true);
return numOfNodes;
}
} // end namespace Intrepid
// include templated definitions
#include <Intrepid_CubatureSparseDef.hpp>
#endif
|