AbstractLinAlgPack: C++ Interfaces For Vectors, Matrices And Related Linear Algebra Objects  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
AbstractLinAlgPack_COOMatrixTmplConvertToSparseCompressedColumnDef.hpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #ifndef COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H
43 #define COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H
44 
45 #include "AbstractLinAlgPack_COOMatrixTmplConvertToSparseCompressedColumnDecl.hpp"
46 
47 namespace AbstractLinAlgPack {
48 
49 template<class T_COOM>
50 size_type COOM_num_in_column(
51  const T_COOM& m
53  , size_type col_offset
54  , const IVector::value_type* col_perm
55  , size_type* num_in_col )
56 {
57  if(!m.nz()) return 0;
58  if( trans == BLAS_Cpp::no_trans ) {
59  // non transposed
60  typename T_COOM::difference_type loc_co = m.col_offset();
61  for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr )
62  num_in_col[ col_perm[ col_offset + loc_co + itr->col_j() -1 ] -1 ]++;
63  }
64  else {
65  // transposed
66  typename T_COOM::difference_type loc_ro = m.row_offset();
67  for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) {
68  const size_type i = itr->row_i();
69  num_in_col[ col_perm[ col_offset + loc_ro + i - 1 ] - 1 ]++;
70  }
71  }
72  return m.nz();
73 }
74 
75 template<class T_COOM>
76 void COOM_insert_nonzeros(
77  const T_COOM& m
78  , BLAS_Cpp::Transp trans
79  , value_type alpha
80  , size_type row_offset
81  , size_type col_offset
82  , const IVector::value_type* row_perm
83  , const IVector::value_type* col_perm
84  , size_type* next_nz_in_col
85  , FortranTypes::f_dbl_prec* D_val
86  , FortranTypes::f_int* D_row_i )
87 {
88  if(!m.nz()) return;
89  typename T_COOM::difference_type
90  loc_ro = m.row_offset(),
91  loc_co = m.col_offset();
92  if( trans == BLAS_Cpp::no_trans ) {
93  // non transposed
94  for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) {
95  const size_type
96  i = loc_ro + itr->row_i(),
97  j = loc_co + itr->col_j();
98  const size_type
99  ele = next_nz_in_col[ col_perm[ col_offset + j - 1 ] - 1 ]++;
100  D_val[ ele - 1 ] = alpha * itr->value();
101  if(D_row_i)
102  D_row_i[ ele - 1 ] = row_perm[ row_offset + i - 1 ];
103  }
104  }
105  else {
106  // transposed
107  for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) {
108  const size_type
109  i = loc_co + itr->col_j(),
110  j = loc_ro + itr->row_i();
111  const size_type
112  ele = next_nz_in_col[ col_perm[ col_offset + j - 1 ] - 1 ]++;
113  D_val[ ele - 1 ] = alpha * itr->value();
114  if(D_row_i)
115  D_row_i[ ele - 1 ] = row_perm[ row_offset + i - 1 ];
116  }
117  }
118 }
119 
120 template<class T_COOM>
121 value_type COOM_insert_scaled_nonzeros(
122  const T_COOM& m
123  , BLAS_Cpp::Transp trans
124  , value_type scaled_max_ele
125  , size_type row_offset
126  , size_type col_offset
127  , const IVector::value_type* row_perm
128  , const IVector::value_type* col_perm
129  , size_type* next_nz_in_col
130  , FortranTypes::f_dbl_prec* D_val
131  , FortranTypes::f_int* D_row_i )
132 {
133  value_type alpha = 0;
134  for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) {
135  register const value_type val = ::fabs( itr->value() );
136  if( val > alpha ) alpha = val;
137  }
138  // scaled_max_ele = max|alpha*A| = alpha * max|A|
139  alpha = scaled_max_ele / alpha;
140  COOM_insert_nonzeros( m, trans, alpha, row_offset
141  , col_offset, row_perm, col_perm, next_nz_in_col, D_val, D_row_i );
142  return alpha;
143 }
144 
145 } // end namespace AbstractLinAlgPack
146 
147 #endif // COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H
size_t size_type
Transp