dgbmatrix-misc.hpp

Go to the documentation of this file.

//=============================================================================
/*! clear all the matrix data and set the sizes 0 */
inline void dgbmatrix::clear()
{CPPL_VERBOSE_REPORT;
  m =0;
  n =0;
  kl =0;
  ku =0;
  delete [] array;
  array=NULL;
  delete [] darray;
  darray=NULL;
}


//=============================================================================
/*! change the matrix into a zero matrix */
inline dgbmatrix& dgbmatrix::zero()
{CPPL_VERBOSE_REPORT;
  const CPPL_INT size =(kl+ku+1)*n;
  for(CPPL_INT i=0; i<size; i++){
    array[i] =0.0;
  }
  return *this;
}

//=============================================================================
/*! change the matrix into an identity matrix */
inline dgbmatrix& dgbmatrix::identity()
{CPPL_VERBOSE_REPORT;
#ifdef  CPPL_DEBUG
  if(m!=n){
    ERROR_REPORT;
    std::cerr << "Only square matrix can be a identity matrix." << std::endl
              << "The matrix size was " << m << "x" << n << "." << std::endl;
    exit(1);
  }
#endif//CPPL_DEBUG
  
  const CPPL_INT size =(kl+ku+1)*n;
  for(CPPL_INT i=0; i<size; i++){
    array[i] =0.0;
  }
  for(CPPL_INT i=0; i<m; i++){
    operator()(i,i) =1.0;
  }
  return *this;
}

//=============================================================================
/*! change sign(+/-) of the matrix */
inline void dgbmatrix::chsign()
{CPPL_VERBOSE_REPORT;
  const CPPL_INT size =(kl+ku+1)*n;
  for(CPPL_INT i=0; i<size; i++){
    array[i] =-array[i];
  }
}
//=============================================================================
/*! make a deep copy of the matrix */
inline void dgbmatrix::copy(const dgbmatrix& mat)
{CPPL_VERBOSE_REPORT;
  m =mat.m;
  n =mat.n;
  kl =mat.kl;
  ku =mat.ku;
  delete [] array;
  array =new double[(mat.kl+mat.ku+1)*mat.n];
  delete [] darray;
  darray =new double*[n];
  for(int i=0; i<n; i++){
    darray[i] =&array[i*(kl+ku+1)];
  }
  
  CPPL_INT size =(mat.kl+mat.ku+1)*mat.n;
  CPPL_INT inc =1;
  dcopy_(&size, mat.array, &inc, array, &inc);
}

//=============================================================================
/*! make a shallow copy of the matrix\n
  This function is not designed to be used in project codes. */
inline void dgbmatrix::shallow_copy(const _dgbmatrix& mat)
{CPPL_VERBOSE_REPORT;
  m =mat.m;
  n =mat.n;
  kl =mat.kl;
  ku =mat.ku;
  delete [] array;
  array =mat.array;
  delete [] darray;
  darray =mat.darray;
  
  mat.nullify();
}

//=============================================================================
/*! resize the matrix */
inline dgbmatrix& dgbmatrix::resize(const CPPL_INT& _m, const CPPL_INT& _n,
                                    const CPPL_INT& _kl, const CPPL_INT& _ku)
{CPPL_VERBOSE_REPORT;
#ifdef  CPPL_DEBUG
  if( _m<0 || _n<0 || _kl<0 || _ku<0 || _m<_kl || _n<_ku ){
    ERROR_REPORT;
    std::cerr << "It is impossible to make a matrix you ordered. " << std::endl
              << "Your input was (" << _m << "," << _n << ","<< _ku << "," << _kl << ")." << std::endl;
    exit(1);
  }
#endif//CPPL_DEBUG
  
  m =_m;
  n =_n;
  kl =_kl;
  ku =_ku;
  delete [] array;
  array =new double[(kl+ku+1)*n];
  delete [] darray;
  darray =new double*[n];
  for(int i=0; i<n; i++){ darray[i] =&array[i*(kl+ku+1)]; }
  
  return *this;
}

///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////

//=============================================================================
/*! get row of the matrix */
inline _drovector dgbmatrix::row(const CPPL_INT& _m) const
{CPPL_VERBOSE_REPORT;
#ifdef  CPPL_DEBUG
  if( _m<0 || _m>m ){
    ERROR_REPORT;
    std::cerr << "Input row number must be between 0 and " << m << "." << std::endl
              << "Your input was " << _m << "." << std::endl;
    exit(1);
  }
#endif//CPPL_DEBUG
  
  drovector v( drovector(n).zero() );
  
  const CPPL_INT jmax =std::min(n,_m+ku+1);
  for(CPPL_INT j=std::max(CPPL_INT(0),_m-kl); j<jmax; j++){
    v(j)=(*this)(_m,j);
  }
  
  return _(v);
}

//=============================================================================
/*! get column of the matrix */
inline _dcovector dgbmatrix::col(const CPPL_INT& _n) const
{CPPL_VERBOSE_REPORT;
#ifdef  CPPL_DEBUG
  if( _n<0 || _n>n ){
    ERROR_REPORT;
    std::cerr << "Input row number must be between 0 and " << n << "." << std::endl
              << "Your input was " << _n << "." << std::endl;
    exit(1);
  }
#endif//CPPL_DEBUG
  
  dcovector v( dcovector(m).zero() );
  
  const CPPL_INT imax =std::min(m,_n+kl+1);
  for(CPPL_INT i=std::max(CPPL_INT(0),_n-ku); i<imax; i++){
    v(i)=(*this)(i,_n);
  }
  
  return _(v);
}

///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////

//=============================================================================
/*! swap two matrices */
inline void swap(dgbmatrix& A, dgbmatrix& B)
{CPPL_VERBOSE_REPORT;
  CPPL_INT A_m =A.m, A_n =A.n, A_kl =A.kl, A_ku =A.ku;
  double* A_array =A.array;
  double** A_darray=A.darray;
  A.m=B.m; A.n=B.n; A.kl=B.kl; A.ku=B.ku; A.array=B.array; A.darray=B.darray;
  B.m=A_m; B.n=A_n; B.kl=A_kl; B.ku=A_ku; B.array=A_array; B.darray=A_darray;
}

//=============================================================================
/*! convert user object to smart-temporary object */
inline _dgbmatrix _(dgbmatrix& mat)
{CPPL_VERBOSE_REPORT;
  _dgbmatrix newmat;
  
  //////// shallow copy ////////
  newmat.m =mat.m;
  newmat.n =mat.n;
  newmat.kl =mat.kl;
  newmat.ku =mat.ku;
  newmat.array =mat.array;
  newmat.darray =mat.darray;
  
  //////// nullify ////////
  mat.m =0;
  mat.n =0;
  mat.kl =0;
  mat.ku =0;
  mat.array =NULL;
  mat.darray =NULL;
  
  return newmat;
}