---

matrix_int.cc

Go to the documentation of this file.

#include<gslwrap/matrix_double.h>
#include<gslwrap/matrix_int.h>
#include<gslwrap/vector_int.h>
#include<iomanip.h>

#define type_is_int
#ifdef type_is
#define type_is_double
#endif

namespace gsl
{

matrix_int::matrix_int():m(NULL)
{
}

matrix_int::matrix_int( size_t rows, size_t cols , bool clear)
{
   if(clear){m = gsl_matrix_int_calloc( rows, cols );}
   else     {m = gsl_matrix_int_alloc ( rows, cols );}
}


matrix_int::~matrix_int()
{
   if ( m ) {gsl_matrix_int_free( m );}
}

//  matrix_int::matrix_int( const char *filename )
//  {
//     ;
//  }

void matrix_int::dimensions( size_t *num_rows, size_t *num_cols ) const
{
   *num_rows = m->size1;
   *num_cols = m->size2;
}


void matrix_int::set_elements( const int & new_value  )
{
   gsl_matrix_int_set_all( m, new_value );
}

void matrix_int::set_dimensions( size_t new_rows, size_t new_cols )
{
   // if dimensions have changed re-allocate matrix
   if ( m && (get_rows() != new_rows || get_cols() != new_cols )) {
              gsl_matrix_int_free( m );
   }

   // allocate
   m = gsl_matrix_int_calloc( new_rows, new_cols );
}


void matrix_int::load( const char *filename )
{
   FILE * f = fopen( filename, "r" ) ;
   matrix temp;
   gsl_matrix_fread ( f, temp.m );
   fclose (f);
   *this = temp;
}

void matrix_int::save( const char *filename ) const
{
   FILE * f = fopen( filename, "w" ) ;
   matrix temp = *this;
   gsl_matrix_fwrite ( f, temp.m );
   fclose ( f );
}

ostream& operator<< ( ostream& os, const matrix_int & m )
{
   size_t i, j;

   os.setf( ios::fixed );

//FIXME for aCC (doesn't find correct outstream function
//     for ( i = 0; i < m.get_rows(); i++ ) {
//         for ( j = 0; j < m.get_cols() - 1; j++ ) {
//                 os << setprecision( 6 ) << setw( 11 ) ;//<< m.get_element( i, j ) << " ";
//         }
//         os << setprecision( 6 ) << setw( 11 ) ;//<< m.get_element( i, j ) << endl;
//     }

   for ( i = 0; i < m.get_rows(); i++ ) {
           for ( j = 0; j < m.get_cols() - 1; j++ ) {
                   os << m.get_element( i, j ) << " ";
           }
           os << m.get_element( i, j ) << endl;
   }

   return os;
}



void matrix_int::load_binary( const char *filename )
{
   ;
}

void matrix_int::save_binary( const char *filename ) const
{
   ;
}

bool matrix_int::operator==( const matrix_int &other ) const
{
   size_t i, j;
   
   // first check for same dimensions
   if ( size1() != other.size1() || size2() != other.size2() )
   {
      return false;
   }

   for ( i = 0; i < size1(); i++ ) {
      for ( j = 0; j < size2(); j++ ) {
         if ( this->get_element( i, j ) != other.get_element( i, j ) ) {
            return false;
         }
      }
   }

   return true;
}

matrix_int matrix_int::operator+( const matrix_int &other ) const
{
        matrix_int result(*this);
        gsl_matrix_int_add( result.m, other.m );
        return result;
}

matrix_int matrix_int::operator+( const int &f ) const
{
   matrix_int result( *this );
   gsl_matrix_int_add_constant( result.m, f );

   return( result );
}

matrix_int operator+( const int &f, const matrix_int &other )
{
   matrix_int result( other );
   gsl_matrix_int_add_constant( result.m, f );

   return( result );
}

matrix_int &matrix_int::operator+=( const int &f )
{
   gsl_matrix_int_add_constant( m, f );

   return( *this );
}

matrix_int &matrix_int::operator+=( const matrix_int &other )
{
   gsl_matrix_int_add( m, other.m );

   return( *this );
}

matrix_int matrix_int::operator-( const matrix_int &other ) const
{
   matrix_int result( *this );
   gsl_matrix_int_sub( result.m, other.m );

   return( result );
}

matrix_int matrix_int::operator-( const int &f ) const
{
   matrix_int result( *this );
   gsl_matrix_int_add_constant( result.m, -f );

   return( result );
}

matrix_int operator-( const int &f, const matrix_int &other )
{
   matrix_int result( -1 * other );
   gsl_matrix_int_add_constant( result.m, f );

   return( result );
}

matrix_int &matrix_int::operator-=( const int &f )
{
   gsl_matrix_int_add_constant( m, -f );

   return( *this );
}

matrix_int &matrix_int::operator-=( const matrix_int &other )
{
   gsl_matrix_int_sub( m, other.m );

   return( *this );
}


matrix_int matrix_int::operator*( const matrix_int &other ) const
{
        matrix result( get_rows(), other.get_cols() );
#ifdef type_is_double
        gsl_linalg_matmult(m,other.m,result.m);
#else //type_is_double
        matrix a=*this;
        matrix b=other;
        gsl_linalg_matmult(a.m,b.m,result.m);
#endif //type_is_double
        return result ;
}

matrix_int matrix_int::operator*( const int &f ) const
{
   matrix_int result( *this );
   gsl_matrix_int_scale( result.m, f );
   return( result );
}

matrix_int operator*( const int &f, const matrix_int &other )
{
   matrix_int result( other );
   gsl_matrix_int_scale( result.m, f );

   return( result );
}

matrix_int &matrix_int::operator*=( const int &f )
{
   gsl_matrix_int_scale( m, f );

   return( *this );
}

matrix_int &matrix_int::operator*=( const matrix_int &other )
{
   *this=(*this)*other;
   return( *this );
}

matrix_int matrix_int::operator/( const int &f ) const
{
   matrix_int result( *this );

   if ( f != 0.0 ) {
      gsl_matrix_int_scale( result.m, 1.0 / f );
   } else {
      cout << "e_r_r_o_r: division by zero." << endl;
      return( result );
   }

   return( result );
}

matrix_int &matrix_int::operator/=( const int &f )
{
   if ( f != 0.0 ) {
      gsl_matrix_int_scale( m, 1.0 / f );
   } else {
      cout << "e_rr_or: division by zero." << endl;
      return( *this );
   }

   return( *this );
}

matrix_int matrix_int::transpose() const 
{
   int i, j;
   matrix_int result( get_cols(), get_rows() );

   for ( i = 0; i < get_rows(); i++ ) {
      for ( j = 0; j < get_cols(); j++ ) {
         gsl_matrix_int_set( result.m, j, i, gsl_matrix_int_get( m, i, j ) );
      }
   }
   
   return( result );
}


matrix_int matrix_int::LU_decomp(gsl::permutation *perm,int *psign) const
{
        bool retPerm=perm!=NULL;
        if(!perm){perm = new permutation();}
        int sign;
        perm->resize( get_rows() );
        matrix result=*this;// this does conversion  if necessary
        gsl_linalg_LU_decomp(  result.m, perm->gsldata, &sign );

        if(!retPerm){delete perm;}
        if(psign){*psign=sign;}

   return result;// this does conversion  if necessary
}

matrix_int matrix_int::LU_invert() const
{
   int i, j;
   permutation p;
   matrix a=*this;
   a=a.LU_decomp(&p);
   matrix inverse(size1(),size2());
   gsl_linalg_LU_invert( a.m, p.gsldata, inverse.m );
   return inverse;
}


// returns sum of all the elements.
int matrix_int::sum() const 
{
        int i, j;
        int sum = 0;

        for ( i = 0; i < get_rows(); i++ ) {
                for ( j = 0; j < get_cols(); j++ ) {
                        sum += gsl_matrix_int_get( m, i, j );
                }
        }

        return( sum );
}

// returns logarithm of the determinant of the matrix.
double matrix_int::LU_lndet() const 
{
        matrix a=*this;
        a=a.LU_decomp();

        // calculate log determinant from LU decomposed matrix "a"
        return gsl_linalg_LU_lndet( a.m );
}

vector_int_view 
matrix_int::row( size_t rowindex )
{
        gsl_vector_int_view view=gsl_matrix_int_row(m, rowindex);
        return vector_int_view::create_vector_view(view);
}

const 
vector_int_view 
matrix_int::row( size_t rowindex ) const
{
        gsl_vector_int_view view=gsl_matrix_int_row(m, rowindex);
        return vector_int_view::create_vector_view(view);
}

vector_int_view 
matrix_int::column( size_t colindex )
{
        gsl_vector_int_view view=gsl_matrix_int_column(m, colindex);
        return vector_int_view::create_vector_view(view);
}

const 
vector_int_view 
matrix_int::column( size_t colindex ) const
{
        gsl_vector_int_view view=gsl_matrix_int_column(m, colindex);
        return vector_int_view::create_vector_view(view);
}

matrix_int matrix_int::get_row( size_t rowindex ) const 
{
        matrix_int rowmatrix( 1, get_cols() );
        gsl_vector_int *tempvector = gsl_vector_int_calloc( get_cols() );
        
        if ( rowindex < 0 || rowindex >= get_rows() )
        {
                cerr << "row index must be in range 0 to " << get_rows() - 1 << endl;
                exit( 1 );
        }

        gsl_matrix_int_get_row( tempvector, m, rowindex );
        gsl_matrix_int_set_row( rowmatrix.m, 0, tempvector );

        // tidy up
        gsl_vector_int_free( tempvector );
        
        return( rowmatrix );
}

matrix_int matrix_int::get_col( size_t colindex ) const 
{
        matrix_int columnmatrix( get_rows(), 1 );
        gsl_vector_int *tempvector = gsl_vector_int_calloc( get_rows() );
        
        if ( colindex < 0 || colindex >= get_cols() )
        {
                cerr << "column index must be in range 0 to " << get_cols() - 1 << endl;
                exit( 1 );
        }
        
        gsl_matrix_int_get_col( tempvector, m, colindex );
        gsl_matrix_int_set_col( columnmatrix.m, 0, tempvector );
        for ( int i = 0; i < get_rows(); i++ )
                cout << gsl_vector_int_get( tempvector, i ) << endl;

        // tidy up
        gsl_vector_int_free( tempvector );
        
        return( columnmatrix );
}

matrix_int matrix_int::row_sum() const 
{
        int     i;
        matrix_int sum( get_rows(), 1 );
        
        sum.set_zero();
        for ( i = 0; i < get_rows(); i++ ) {
                sum.set_element( i, 0, get_row( i ).sum() );
        }
        
        return( sum );
}

matrix_int matrix_int::column_sum() const 
{
        int     i;
        matrix_int sum( 1, get_cols() );
        
        sum.set_zero( );
        for ( i = 0; i < get_cols(); i++ ) {
                sum.set_element( 0, i, get_col( i ).sum() );
        }
                
        return( sum );
}

double matrix_int::trace() const 
{
        int     i;
        double sum = 0.0;
        
        if ( get_rows() != get_cols() ) {
                cerr << "e_r_r_o_r: cannot calculate trace of non-square matrix.";
                cerr << endl;
                exit( 1 );
        }

        // calculate sum of diagonal elements
        for ( i = 0; i < get_rows(); i++ ) {
                sum += get_element( i, i );
        }

        return( sum );
}

// don't forget to de-allocate a, which is allocated in this method.
int matrix_int::cholesky_decomp( matrix_int &a ) const 
{
        int i, j;
        int error;
        matrix result=*this;
        // do decomposition with call to g_s_l
        error = gsl_linalg_cholesky_decomp( result.m );
        a=result;
        return error;
}

void matrix_int::identity( size_t k ) 
{
        set_dimensions( k, k );
        set_zero();
        set_diagonal( 1 );
}

void matrix_int::set_diagonal( int f ) 
{
        size_t i;
        int mn=(get_rows()<get_cols() ? get_rows() : get_cols());
        for ( i = 0; i < mn; i++ )
                        set_element( i, i, f );
}

bool matrix_int::is_square() const 
{
        if ( get_rows() == get_cols() )
                return true;
        return false;
}

double matrix_int::norm( double n ) const 
{
        int i, j;
        double sum = 0.0;
        
        for ( i = 0; i < get_rows(); i++ ) {
                for ( j = 0; j < get_cols(); j++ ) {
                        sum += pow( get_element( i, j ), n );
                }
        }
        
        return sum;
}

}

---