/usr/include/trilinos/Intrepid_CubatureTensorSorted.hpp is in libtrilinos-intrepid-dev 12.4.2-2.
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 | // @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.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Pavel Bochev (pbboche@sandia.gov)
// Denis Ridzal (dridzal@sandia.gov), or
// Kara Peterson (kjpeter@sandia.gov)
//
// ************************************************************************
// @HEADER
/** \file Intrepid_CubatureTensorSorted.hpp
\brief Header file for the Intrepid::CubatureTensorSorted class.
\author Created by D. Kouri and D. Ridzal.
*/
#ifndef INTREPID_CUBATURE_TENSORSORTED_HPP
#define INTREPID_CUBATURE_TENSORSORTED_HPP
#include "Intrepid_CubatureLineSorted.hpp"
namespace Intrepid {
/** \class Intrepid::CubatureTensorSorted
\brief Utilizes 1D cubature (integration) rules contained in the library sandia_rules
(John Burkardt, Scientific Computing, Florida State University) within Intrepid.
This class contains ten rules:
\li Gauss-Chebyshev Type 1 - integration domain is [-1,+1] with weight w(x) = 1/sqrt(1-x^2)
\li Gauss-Chebyshev Type 2 - integration domain is [-1,+1] with weight w(x) = sqrt(1-x^2)
\li Clenshaw-Curtis - integration domain is [-1,+1] with weight w(x) = 1
\li Fejer Type 2 - integration domain is [-1,+1] with weight w(x) = 1
\li Gauss-Legendre - integration domain is [-1,+1] with weight w(x) = 1
\li Gauss-Patterson - integration domain is [-1,+1] with weight w(x) = 1
\li Trapezoidal - integration domain is [-1,+1] with weight w(x) = 1
\li Gauss-Hermite - integration domain is (-oo,+oo) with weight w(x) = exp(-x^2)
\li Hermite-Genz-Keister - integration domain is (-oo,+oo) with weight w(x) = exp(-x^2)
\li Gauss-Laguerre - integration domain is [0,+oo) with weight w(x) = exp(-x)
*/
/* =========================================================================
Structure Definition - quadRule
========================================================================= */
//struct quadInfo {
/*
The quadRule structure contains information about a multidimensional
tensor product quadrature rule.
*/
// int dim; // Number of Spatial Dimensions
// int maxlevel; // Maximum Order of 1D rules
// int * rule; // 1D rules defined in each dimension
// int * growth; // 1D growth rules defined in each dimension
// int * np; // Number of parameters for each 1D rule
// double * param; // Parameters for each 1D rule
//};
template<class Scalar, class ArrayPoint = FieldContainer<Scalar>, class ArrayWeight = ArrayPoint>
class CubatureTensorSorted : public Intrepid::Cubature<Scalar,ArrayPoint,ArrayWeight> {
private:
/** \brief Contains nodes of this cubature rule.
*/
typename std::map<std::vector<Scalar>,int> points_; // keys = nodes, values = location of weights
/** \brief Contains weights of this cubature rule.
*/
std::vector<Scalar> weights_;
/** \brief Contains the number of nodes for this cubature rule.
*/
int numPoints_;
/** \brief The degree of polynomials that are integrated
exactly by this cubature rule.
*/
std::vector<int> degree_;
/** \brief Dimension of integration domain.
*/
int dimension_;
public:
~CubatureTensorSorted() {}
// CubatureTensorSorted() {}
CubatureTensorSorted(int numPoints = 0, int dimension = 1);
/** \brief Constructor.
\param cubLine [in] - 1D cubature rule.
*/
CubatureTensorSorted(CubatureLineSorted<Scalar> & cubLine);
/** \brief Constructor.
\param dimension [in] - The number of spatial dimensions.
\param numPoints1D [in] - The number of cubature points in each direction.
\param rule1D [in] - The cubature rule for each direction.
\param isNormalized [in] - Flag whether or not to normalize the cubature weights.
*/
CubatureTensorSorted(int dimension, std::vector<int> numPoints1D, std::vector<EIntrepidBurkardt> rule1D, bool isNormalized);
/** \brief Constructor.
\param dimension [in] - The number of spatial dimensions.
\param numPoints1D [in] - The number of cubature points in each direction.
\param rule1D [in] - The cubature rule for each direction.
\param isNormalized [in] - Flag whether or not to normalize the cubature weights.
*/
CubatureTensorSorted(int dimension, std::vector<int> numPoints1D, std::vector<EIntrepidBurkardt> rule1D, std::vector<EIntrepidGrowth> growth1D, bool isNormalized);
/** \brief Constructor.
\param dimension [in] - The number of spatial dimensions.
\param maxNumPoints [in] - The maximum number of cubature points in each direction.
\param rule1D [in] - The cubature rule for each direction.
\param growth1D [in] - Growth rule for each direction.
\param isNormalized [in] - Flag whether or not to normalize the cubature weights.
*/
CubatureTensorSorted(int dimension, int maxNumPoints, std::vector<EIntrepidBurkardt> rule1D, std::vector<EIntrepidGrowth> growth1D, bool isNormalized);
// Access Operator
/** \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.
*/
void getCubature(ArrayPoint & cubPoints,
ArrayWeight & cubWeights) const;
/** \brief Returns cubature points and weights.
Method for physical space cubature, throws an exception.
\param cubPoints [out] - Array containing the cubature points.
\param cubWeights [out] - Array of corresponding cubature weights.
\param cellCoords [in] - Array of cell coordinates
*/
void getCubature(ArrayPoint& cubPoints,
ArrayWeight& cubWeights,
ArrayPoint& cellCoords) const;
/** \brief Returns the number of cubature points.
*/
int getNumPoints() const;
/** \brief Returns max. degree of polynomials that are integrated exactly.
The return vector has size 1.
*/
void getAccuracy(std::vector<int> & accuracy) const;
/** \brief Returns dimension of domain of integration.
*/
int getDimension() const;
/** \brief Initiate iterator at the beginning of data.
*/
typename std::map<std::vector<Scalar>,int>::iterator begin();
/** \brief Initiate iterator at the end of data.
*/
typename std::map<std::vector<Scalar>,int>::iterator end();
/** \brief Insert a node and weight into data near the iterator position.
*/
void insert(typename std::map<std::vector<Scalar>,int>::iterator it,
std::vector<Scalar> point, Scalar weight);
/** \brief Get a specific node described by the iterator location.
*/
std::vector<Scalar> getNode(typename std::map<std::vector<Scalar>,int>::iterator it);
/** \brief Get a specific weight described by the integer location.
*/
Scalar getWeight(int node);
/** \brief Get a specific weight described by the iterator location.
*/
Scalar getWeight(std::vector<Scalar> point);
/** \brief Replace CubatureLineSorted values with
"this = alpha1*this+alpha2*cubRule2".
*/
void update(Scalar alpha2, CubatureTensorSorted<Scalar> & cubRule2, Scalar alpha1);
/** \brief Normalize CubatureLineSorted weights.
*/
void normalize();
};
template<class Scalar>
CubatureTensorSorted<Scalar> kron_prod(CubatureTensorSorted<Scalar> & rule1,
CubatureLineSorted<Scalar> & rule2 );
} // Intrepid Namespace
// include templated definitions
#include <Intrepid_CubatureTensorSortedDef.hpp>
#endif
|