CPPLapack Code

//=============================================================================
/*! dssmatrix*dcovector operator */
inline _dcovector operator*(const dssmatrix& mat, const dcovector& vec)
{
#ifdef  CPPL_VERBOSE
  std::cerr << "# [MARK] operator*(const dssmatrix&, const dcovector&)"
            << std::endl;
#endif//CPPL_VERBOSE
  
#ifdef  CPPL_DEBUG
  if(mat.N!=vec.L){
    std::cerr << "[ERROR] operator*(const dssmatrix&, const dcovector&)" << std::endl
              << "These matrix and vector can not make a product." << std::endl
              << "Your input was (" << mat.N << "x" << mat.N << ") * (" << vec.L << ")." << std::endl;
    exit(1);
  }
#endif//CPPL_DEBUG
  
  dcovector newvec(mat.N);
  newvec.zero();
  
  ///*
  long i;
#pragma omp parallel for
  for(i=0; i<mat.m; i++){
    for(std::vector< std::pair<long,long> >::iterator p=mat.line[i].begin(); p!=mat.line[i].end(); p++){
      newvec(i) +=mat.array[p->second]*vec(p->first);
    }
  }
  //*/
    
  /*
  long c;
  //#pragma omp parallel for //NG (no reduction)
  //#pragma omp for //OK?????? not parallelized??????????
  for(long c=0; c<mat.VOL; c++){
    newvec(mat.Indx[c]) +=mat.Array[c]*vec(mat.Jndx[c]);
    if(mat.Indx[c]!=mat.Jndx[c]){
      newvec(mat.Jndx[c]) +=mat.Array[c]*vec(mat.Indx[c]);
    }
  }
  */
    
  return _(newvec);
}