|
AbstractLinAlgPack: C++ Interfaces For Vectors, Matrices And Related Linear Algebra Objects
Version of the Day
|
00001 // @HEADER 00002 // *********************************************************************** 00003 // 00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization 00005 // Copyright (2003) 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 Roscoe A. Bartlett (rabartl@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 // @HEADER 00041 00042 #ifndef COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H 00043 #define COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H 00044 00045 #include "AbstractLinAlgPack_COOMatrixTmplConvertToSparseCompressedColumnDecl.hpp" 00046 00047 namespace AbstractLinAlgPack { 00048 00049 template<class T_COOM> 00050 size_type COOM_num_in_column( 00051 const T_COOM& m 00052 , BLAS_Cpp::Transp trans 00053 , size_type col_offset 00054 , const IVector::value_type* col_perm 00055 , size_type* num_in_col ) 00056 { 00057 if(!m.nz()) return 0; 00058 if( trans == BLAS_Cpp::no_trans ) { 00059 // non transposed 00060 typename T_COOM::difference_type loc_co = m.col_offset(); 00061 for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) 00062 num_in_col[ col_perm[ col_offset + loc_co + itr->col_j() -1 ] -1 ]++; 00063 } 00064 else { 00065 // transposed 00066 typename T_COOM::difference_type loc_ro = m.row_offset(); 00067 for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) { 00068 const size_type i = itr->row_i(); 00069 num_in_col[ col_perm[ col_offset + loc_ro + i - 1 ] - 1 ]++; 00070 } 00071 } 00072 return m.nz(); 00073 } 00074 00075 template<class T_COOM> 00076 void COOM_insert_nonzeros( 00077 const T_COOM& m 00078 , BLAS_Cpp::Transp trans 00079 , value_type alpha 00080 , size_type row_offset 00081 , size_type col_offset 00082 , const IVector::value_type* row_perm 00083 , const IVector::value_type* col_perm 00084 , size_type* next_nz_in_col 00085 , FortranTypes::f_dbl_prec* D_val 00086 , FortranTypes::f_int* D_row_i ) 00087 { 00088 if(!m.nz()) return; 00089 typename T_COOM::difference_type 00090 loc_ro = m.row_offset(), 00091 loc_co = m.col_offset(); 00092 if( trans == BLAS_Cpp::no_trans ) { 00093 // non transposed 00094 for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) { 00095 const size_type 00096 i = loc_ro + itr->row_i(), 00097 j = loc_co + itr->col_j(); 00098 const size_type 00099 ele = next_nz_in_col[ col_perm[ col_offset + j - 1 ] - 1 ]++; 00100 D_val[ ele - 1 ] = alpha * itr->value(); 00101 if(D_row_i) 00102 D_row_i[ ele - 1 ] = row_perm[ row_offset + i - 1 ]; 00103 } 00104 } 00105 else { 00106 // transposed 00107 for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) { 00108 const size_type 00109 i = loc_co + itr->col_j(), 00110 j = loc_ro + itr->row_i(); 00111 const size_type 00112 ele = next_nz_in_col[ col_perm[ col_offset + j - 1 ] - 1 ]++; 00113 D_val[ ele - 1 ] = alpha * itr->value(); 00114 if(D_row_i) 00115 D_row_i[ ele - 1 ] = row_perm[ row_offset + i - 1 ]; 00116 } 00117 } 00118 } 00119 00120 template<class T_COOM> 00121 value_type COOM_insert_scaled_nonzeros( 00122 const T_COOM& m 00123 , BLAS_Cpp::Transp trans 00124 , value_type scaled_max_ele 00125 , size_type row_offset 00126 , size_type col_offset 00127 , const IVector::value_type* row_perm 00128 , const IVector::value_type* col_perm 00129 , size_type* next_nz_in_col 00130 , FortranTypes::f_dbl_prec* D_val 00131 , FortranTypes::f_int* D_row_i ) 00132 { 00133 value_type alpha = 0; 00134 for( typename T_COOM::const_iterator itr = m.begin(); itr != m.end(); ++itr ) { 00135 register const value_type val = ::fabs( itr->value() ); 00136 if( val > alpha ) alpha = val; 00137 } 00138 // scaled_max_ele = max|alpha*A| = alpha * max|A| 00139 alpha = scaled_max_ele / alpha; 00140 COOM_insert_nonzeros( m, trans, alpha, row_offset 00141 , col_offset, row_perm, col_perm, next_nz_in_col, D_val, D_row_i ); 00142 return alpha; 00143 } 00144 00145 } // end namespace AbstractLinAlgPack 00146 00147 #endif // COO_MATRIX_TMPL_CONVERT_TO_SPARSE_COMPRESSED_COLUMN_DEF_H
1.7.6.1