//=============================================================================
/*! _zgematrix+zgbmatrix operator */
inline _zgematrix operator+(const _zgematrix& matA, const zgbmatrix& matB)
{CPPL_VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if(matA.n!=matB.n || matA.m!=matB.m){
ERROR_REPORT;
std::cerr << "These two matrises can not make a summation." << std::endl
<< "Your input was (" << matA.m << "x" << matA.n << ") + (" << matB.m << "x" << matB.n << ")." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
for(long i=0; i<matB.m; i++){
for(long j=std::max(long(0),i-matB.kl); j<std::min(matB.n,i+matB.ku+1); j++){
matA(i,j)+=matB(i,j);
}
}
return matA;
}
//=============================================================================
/*! _zgematrix-zgbmatrix operator */
inline _zgematrix operator-(const _zgematrix& matA, const zgbmatrix& matB)
{CPPL_VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if(matA.n!=matB.n || matA.m!=matB.m){
ERROR_REPORT;
std::cerr << "These two matrises can not make a summation." << std::endl
<< "Your input was (" << matA.m << "x" << matA.n << ") + (" << matB.m << "x" << matB.n << ")." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
for(long i=0; i<matB.m; i++){
for(long j=std::max(long(0),i-matB.kl); j<std::min(matB.n,i+matB.ku+1); j++){
matA(i,j)-=matB(i,j);
}
}
return matA;
}
//=============================================================================
/*! _zgematrix*zgbmatrix operator */
inline _zgematrix operator*(const _zgematrix& matA, const zgbmatrix& matB)
{CPPL_VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if(matA.n!=matB.m){
ERROR_REPORT;
std::cerr << "These two matrises can not make a product." << std::endl
<< "Your input was (" << matA.m << "x" << matA.n << ") * (" << matB.m << "x" << matB.n << ")." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
zgematrix newmat( matA.m, matB.n );
newmat.zero();
for(long i=0; i<newmat.m; i++){
for(long j=0; j<newmat.n; j++){
for(long k=std::max(long(0),j-matB.ku); k<std::min(matB.m,j+matB.kl+1); k++){
newmat(i,j)+=matA(i,k)*matB(k,j);
}
}
}
matA.destroy();
return _(newmat);
}