|
Intrepid
|
00001 // @HEADER 00002 // ************************************************************************ 00003 // 00004 // Intrepid Package 00005 // Copyright (2007) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Pavel Bochev (pbboche@sandia.gov) 00038 // Denis Ridzal (dridzal@sandia.gov), or 00039 // Kara Peterson (kjpeter@sandia.gov) 00040 // 00041 // ************************************************************************ 00042 // @HEADER 00043 00049 #ifndef INTREPID_CUBATURE_LINESORTED_HPP 00050 #define INTREPID_CUBATURE_LINESORTED_HPP 00051 00052 #include "Intrepid_ConfigDefs.hpp" 00053 #include "Intrepid_Cubature.hpp" 00054 #include "Intrepid_BurkardtRules.hpp" 00055 #include "Teuchos_Assert.hpp" 00056 #include "Teuchos_Array.hpp" 00057 #include "Intrepid_FieldContainer.hpp" 00058 00059 namespace Intrepid { 00060 00061 enum EIntrepidGrowth { 00062 GROWTH_DEFAULT = 0, 00063 GROWTH_SLOWLIN, 00064 GROWTH_SLOWLINODD, 00065 GROWTH_MODLIN, 00066 GROWTH_SLOWEXP, 00067 GROWTH_MODEXP, 00068 GROWTH_FULLEXP 00069 }; 00070 00088 template<class Scalar, class ArrayPoint = FieldContainer<Scalar>, class ArrayWeight = ArrayPoint> 00089 class CubatureLineSorted : public Intrepid::Cubature<Scalar,ArrayPoint,ArrayWeight> { 00090 00091 private: 00092 00095 std::map<Scalar,int> points_; // keys = nodes, map values = location of weights 00096 00099 std::vector<Scalar> weights_; 00100 00103 int numPoints_; 00104 00108 int degree_; 00109 00112 EIntrepidBurkardt rule_type_; 00113 00116 static const char *cubature_name_; 00117 00118 public: 00119 00120 ~CubatureLineSorted() {} 00121 00127 CubatureLineSorted(int degree = 0, EIntrepidBurkardt rule = BURK_CLENSHAWCURTIS, bool isNormalized = false); 00128 00133 CubatureLineSorted(EIntrepidBurkardt rule = BURK_CLENSHAWCURTIS, int numPoints = 0, bool isNormalized = false); 00134 00135 CubatureLineSorted(std::vector<Scalar> & points, std::vector<Scalar> & weights); 00136 00137 // Access Operators 00144 void getCubature(ArrayPoint & cubPoints, 00145 ArrayWeight & cubWeights) const; 00146 00149 int getNumPoints() const; 00150 00154 void getAccuracy(std::vector<int> & accuracy) const; 00155 00158 int getDimension() const; 00159 00162 const char* getName() const; 00163 00166 Scalar getNode(typename std::map<Scalar,int>::iterator it); 00167 00170 Scalar getWeight(int weight); 00171 00174 Scalar getWeight(Scalar point); 00175 00178 typename std::map<Scalar,int>::iterator begin(void); 00179 00182 typename std::map<Scalar,int>::iterator end(void); 00183 00187 void update(Scalar alpha2, CubatureLineSorted<Scalar> & cubRule2, Scalar alpha1); 00188 }; 00189 00190 int growthRule1D(int index, EIntrepidGrowth growth, EIntrepidBurkardt rule); 00191 00192 } // Intrepid Namespace 00193 00194 // include templated definitions 00195 #include <Intrepid_CubatureLineSortedDef.hpp> 00196 00197 #endif
1.7.6.1