Intrepid
http://trilinos.sandia.gov/packages/docs/r10.12/packages/intrepid/src/Discretization/Integration/Intrepid_CubatureTensorSorted.hpp
Go to the documentation of this file.
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_TENSORSORTED_HPP
00050 #define INTREPID_CUBATURE_TENSORSORTED_HPP
00051 
00052 #include "Intrepid_CubatureLineSorted.hpp"
00053 
00054 namespace Intrepid {
00055 
00073 /* =========================================================================
00074                        Structure Definition - quadRule
00075    ========================================================================= */ 
00076 //struct quadInfo { 
00077   /*
00078     The quadRule structure contains information about a multidimensional 
00079     tensor product quadrature rule.  
00080   */
00081   //  int dim;          // Number of Spatial Dimensions
00082   //  int maxlevel;     // Maximum Order of 1D rules
00083   //  int * rule;       // 1D rules defined in each dimension
00084   //  int * growth;     // 1D growth rules defined in each dimension
00085   //  int * np;         // Number of parameters for each 1D rule
00086   //  double * param;   // Parameters for each 1D rule
00087   //};
00088 
00089 template<class Scalar, class ArrayPoint = FieldContainer<Scalar>, class ArrayWeight = ArrayPoint>
00090 class CubatureTensorSorted : public Intrepid::Cubature<Scalar,ArrayPoint,ArrayWeight> {
00091 
00092 private:  
00095   typename std::map<std::vector<Scalar>,int> points_; // keys = nodes, values = location of weights
00096   
00099   std::vector<Scalar> weights_;
00100 
00103   int numPoints_;
00104   
00108   std::vector<int> degree_;
00109 
00112   int dimension_;
00113   
00114 public:
00115 
00116   ~CubatureTensorSorted() {}
00117 
00118   //  CubatureTensorSorted() {}
00119 
00120   CubatureTensorSorted(int numPoints = 0, int dimension = 1);
00121 
00126   CubatureTensorSorted(CubatureLineSorted<Scalar> & cubLine);
00127  
00135   CubatureTensorSorted(int dimension, std::vector<int> numPoints1D, std::vector<EIntrepidBurkardt> rule1D, bool isNormalized);
00136 
00144   CubatureTensorSorted(int dimension, std::vector<int> numPoints1D, std::vector<EIntrepidBurkardt> rule1D, std::vector<EIntrepidGrowth> growth1D, bool isNormalized);
00145 
00154   CubatureTensorSorted(int dimension, int maxNumPoints, std::vector<EIntrepidBurkardt> rule1D, std::vector<EIntrepidGrowth> growth1D, bool isNormalized);
00155 
00156   // Access Operator            
00163   void getCubature(ArrayPoint  & cubPoints,
00164                    ArrayWeight & cubWeights) const;
00165 
00168   int getNumPoints() const;
00169 
00173   void getAccuracy(std::vector<int> & accuracy) const;
00174 
00177   int getDimension() const;
00178 
00181   typename std::map<std::vector<Scalar>,int>::iterator begin();
00182 
00185   typename std::map<std::vector<Scalar>,int>::iterator end();
00186 
00189   void insert(typename std::map<std::vector<Scalar>,int>::iterator it,        
00190               std::vector<Scalar> point, Scalar weight);
00191 
00194   std::vector<Scalar> getNode(typename std::map<std::vector<Scalar>,int>::iterator it);
00195 
00198   Scalar getWeight(int node);
00199 
00202   Scalar getWeight(std::vector<Scalar> point);
00203 
00207   void update(Scalar alpha2, CubatureTensorSorted<Scalar> & cubRule2, Scalar alpha1); 
00208 
00211   void normalize();
00212 
00213 };
00214 
00215 template<class Scalar>
00216 CubatureTensorSorted<Scalar> kron_prod(CubatureTensorSorted<Scalar> & rule1,
00217                                        CubatureLineSorted<Scalar>   & rule2 );
00218 
00219 } // Intrepid Namespace
00220 
00221 
00222 // include templated definitions
00223 #include <Intrepid_CubatureTensorSortedDef.hpp>
00224 
00225 #endif