00001 /* @HEADER@ */ 00002 // ************************************************************************ 00003 // 00004 // Sundance 00005 // Copyright 2011 Sandia Corporation 00006 // 00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00008 // the U.S. Government retains certain rights in this software. 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 Kevin Long (kevin.long@ttu.edu) 00038 // 00039 00040 /* @HEADER@ */ 00041 00042 #ifndef SUNDANCE_LOCALMATRIXCONTAINER_H 00043 #define SUNDANCE_LOCALMATRIXCONTAINER_H 00044 00045 #include "SundanceDefs.hpp" 00046 #include "SundanceDOFMapBuilder.hpp" 00047 00048 namespace Sundance 00049 { 00050 /** 00051 * LocalMatrixContainer is a container for local matrix and vector values. 00052 * Local matrices and vectors are stored in identical ways: as 1D arrays 00053 * of doubles. toi 00054 * 00055 * Each integrator gets its own LocalMatrixContainer object, with information on 00056 * term grouping specific to the terms handled by that integrator. To conserve 00057 * memory, all LocalMatrixContainer objects share a common pool of data vectors. After 00058 * insertion, the common pool can be reused in the next integration. It is the 00059 * responsibility of the integrator to zero out and resize each data vector 00060 * as needed. 00061 * 00062 * To leave the system as flexible as possible, this class does not specify 00063 * anything about the ordering of elements in the matrix. It is the 00064 * responsibility of the integrator and inserter classes to use a consistent 00065 * ordering. Different integrator-inserter combinations may well use different 00066 * orderings. 00067 * 00068 * It is often the case that several terms in a PDE will yield local 00069 * matrices that have the same values, perhaps differing by a constant, 00070 * but which are associated with different test and unknown functions. For this reason, 00071 * each batch of local matrix values has associated with it arrays 00072 * of (test, unk) pairs and coefficients. 00073 */ 00074 class LocalMatrixContainer 00075 { 00076 public: 00077 /** */ 00078 LocalMatrixContainer(const Array<int>& isTwoForm, 00079 const Array<Array<int> >& testID, 00080 const Array<Array<int> >& unkID, 00081 const Array<Array<double> >& coeffs); 00082 00083 /** Return the data vector for the i-th batch */ 00084 const RCP<Array<double> >& dataVector(int i) const 00085 {return workspace()[i];} 00086 00087 /** Indicate whether the i-th batch is a two form */ 00088 bool isTwoForm(int i) const {return isTwoForm_[i];} 00089 00090 /** Return the array of testIDs whose local matrix values are grouped int 00091 * the i-th batch */ 00092 const Array<int>& testID(int i) const {return testID_[i];} 00093 00094 /** Return the array of unkIDs whose local matrix values are grouped int 00095 * the i-th batch */ 00096 const Array<int>& unkID(int i) const {return unkID_[i];} 00097 00098 /** Return the array of coefficients to be used with the i-th batch */ 00099 const Array<double>& coeffs(int i) const {return coeffs_[i];} 00100 00101 private: 00102 00103 /** */ 00104 static Array<RCP<Array<double> > >& workspace() 00105 {static Array<RCP<Array<double> > > rtn; return rtn;} 00106 00107 /** */ 00108 Array<int> isTwoForm_; 00109 00110 /** */ 00111 Array<Array<int> > testID_; 00112 00113 /** */ 00114 Array<Array<int> > unkID_; 00115 00116 /** */ 00117 Array<Array<double> > coeffs_; 00118 }; 00119 } 00120 00121 00122 00123 #endif