CPPLapack Code

Status: Beta

Brought to you by: yonishi

[r168]: / trunk / include / zgbmatrix- / zgbmatrix-complex.hpp Maximize Restore History

44 lines (37 with data), 1.5 kB

//=============================================================================
/*! zgbmatrix*=comple operator */
inline zgbmatrix& zgbmatrix::operator*=(const comple& d)
{CPPL_VERBOSE_REPORT;
  zscal_((kl+ku+1)*n, d, array, 1);
  return *this;
}

//=============================================================================
/*! zgbmatrix/=comple operator */
inline zgbmatrix& zgbmatrix::operator/=(const comple& d)
{CPPL_VERBOSE_REPORT;
  zscal_((kl+ku+1)*n, 1./d, array, 1);
  return *this;
}

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

//=============================================================================
/*! zgbmatrix*comple operator */
inline _zgbmatrix operator*(const zgbmatrix& mat, const comple& d)
{CPPL_VERBOSE_REPORT;
  zgbmatrix newmat(mat.m, mat.n, mat.kl, mat.ku);
  for(long i=0; i<(newmat.kl+newmat.ku+1)*newmat.n; i++){
    newmat.array[i] =mat.array[i]*d;
  }
  
  return _(newmat);
}

//=============================================================================
/*! zgbmatrix/comple operator */
inline _zgbmatrix operator/(const zgbmatrix& mat, const comple& d)
{CPPL_VERBOSE_REPORT;
  zgbmatrix newmat(mat.m, mat.n, mat.kl, mat.ku);
  for(long i=0; i<(newmat.kl+newmat.ku+1)*newmat.n; i++){
    newmat.array[i] =mat.array[i]/d;
  }
  
  return _(newmat);
}