Nektar++
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
SparseUtils.cpp
Go to the documentation of this file.
1 ///////////////////////////////////////////////////////////////////////////////
2 //
3 // File: SparseUtils.hpp
4 //
5 // For more information, please see: http://www.nektar.info
6 //
7 // The MIT License
8 //
9 // Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
10 // Department of Aeronautics, Imperial College London (UK), and Scientific
11 // Computing and Imaging Institute, University of Utah (USA).
12 //
13 // License for the specific language governing rights and limitations under
14 // Permission is hereby granted, free of charge, to any person obtaining a
15 // copy of this software and associated documentation files (the "Software"),
16 // to deal in the Software without restriction, including without limitation
17 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
18 // and/or sell copies of the Software, and to permit persons to whom the
19 // Software is furnished to do so, subject to the following conditions:
20 //
21 // The above copyright notice and this permission notice shall be included
22 // in all copies or substantial portions of the Software.
23 //
24 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
25 // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
26 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
27 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
28 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
29 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
30 // DEALINGS IN THE SOFTWARE.
31 //
32 // Description: common utility functions for sparse matrices
33 //
34 ///////////////////////////////////////////////////////////////////////////////
35 
36 #include <utility>
37 #include <map>
38 
44 
45 
46 namespace Nektar{
47 
49  const unsigned int blkRows,
50  const unsigned int blkColumns,
51  const unsigned int blkDim,
52  const COOMatType& cooMat,
53  BCOMatType& bcoMat)
54  {
55  COOMatTypeConstIt entry;
57  int rowcoord, localRow, blkRowCoord;
58  int colcoord, localCol, blkColCoord;
59 
60  for(entry = cooMat.begin(); entry != cooMat.end(); entry++)
61  {
62  rowcoord = (entry->first).first;
63  colcoord = (entry->first).second;
64 
65  blkRowCoord = rowcoord / blkDim;
66  blkColCoord = colcoord / blkDim;
67 
68  CoordType blkCoords = std::make_pair(blkRowCoord,blkColCoord);
69  blk = bcoMat.find(blkCoords);
70  if (blk == bcoMat.end())
71  {
72  BCOEntryType b(blkDim*blkDim, 0.0);
73  bcoMat[blkCoords] = b;
74  }
75 
76  localRow = rowcoord % blkDim;
77  localCol = colcoord % blkDim;
78 
79  // transpose it: NIST SpBLAS expects Fortran ordering
80  // of dense subblocks
81  const unsigned int localoffset = localRow + localCol*blkDim;
82  (bcoMat[blkCoords])[localoffset] = entry->second;
83  }
84  }
85 
86  template<typename SparseStorageType>
87  std::ostream& operator<<(std::ostream& os, const NekSparseMatrix<SparseStorageType>& rhs)
88  {
89  int oswidth = 9;
90  int osprecision = 6;
91 
92  for(unsigned int i = 0; i < rhs.GetRows(); ++i)
93  {
94  os << "[";
95  for(unsigned int j = 0; j < rhs.GetColumns(); ++j)
96  {
97  os.width(oswidth);
98  os.precision(osprecision);
99  os << rhs(i,j);
100  if( j != rhs.GetColumns() - 1 )
101  {
102  os << ", ";
103  }
104  }
105  os << "]";
106  if( i != rhs.GetRows()-1 )
107  {
108  os << std::endl;
109  }
110  }
111  return os;
112  }
113 
114  template<typename SparseStorageType>
115  std::ostream& operator<<(std::ostream& os, const NekSparseDiagBlkMatrix<SparseStorageType>& rhs)
116  {
117  int oswidth = 9;
118  int osprecision = 6;
119 
120  for(unsigned int i = 0; i < rhs.GetRows(); ++i)
121  {
122  os << "[";
123  for(unsigned int j = 0; j < rhs.GetColumns(); ++j)
124  {
125  os.width(oswidth);
126  os.precision(osprecision);
127  os << rhs(i,j);
128  if( j != rhs.GetColumns() - 1 )
129  {
130  os << ", ";
131  }
132  }
133  os << "]";
134  if( i != rhs.GetRows()-1 )
135  {
136  os << std::endl;
137  }
138  }
139  return os;
140  }
141 
142  template std::ostream& operator<<(std::ostream& os, const NekSparseMatrix<StorageSmvBsr<NekDouble> >& rhs);
143  template std::ostream& operator<<(std::ostream& os, const NekSparseDiagBlkMatrix<StorageSmvBsr<NekDouble> >& rhs);
144 
145 } // namespace
std::map< CoordType, NekDouble > COOMatType
COOMatType::const_iterator COOMatTypeConstIt
BCOMatType::const_iterator BCOMatTypeConstIt
std::map< CoordType, BCOEntryType > BCOMatType
void convertCooToBco(const unsigned int blkRows, const unsigned int blkColumns, const unsigned int blkDim, const COOMatType &cooMat, BCOMatType &bcoMat)
Definition: SparseUtils.cpp:48
std::pair< IndexType, IndexType > CoordType