//=============================================================================
/*! return its transposed zgbmatrix */
inline _zgbmatrix t(const _zgbmatrix& mat)
{VERBOSE_REPORT;
zgbmatrix newmat(mat.n, mat.m, mat.ku, mat.kl);
for(long i=0; i<newmat.m; i++){
for(long j=std::max(long(0),i-newmat.kl); j<std::min(newmat.n,i+newmat.ku+1); j++){
newmat(i,j) =mat(j,i);
}
}
mat.destroy();
return _(newmat);
}
//=============================================================================
/*! return its inverse matrix */
inline _zgematrix i(const _zgbmatrix& mat)
{VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if(mat.m!=mat.n){
std::cerr << "[ERROR] i(_zgbmatrix&) " << std::endl
<< "This matrix is not square and has no inverse matrix." << std::endl
<< "Your input was (" << mat.m << "x" << mat.n << ")." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
zgbmatrix mat_cp(mat);
zgematrix mat_inv(mat_cp.m,mat_cp.n);
mat_inv.identity();
mat_cp.zgbsv(mat_inv);
return _(mat_inv);
}
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
//=============================================================================
/*! return its conjugate matrix */
inline _zgbmatrix conj(const _zgbmatrix& mat)
{VERBOSE_REPORT;
for(long i=0; i<mat.m; i++){
for(long j=std::max(long(0),i-mat.kl); j<std::min(mat.n,i+mat.ku+1); j++){
mat(i,j) =std::conj(mat(i,j));
}
}
return mat;
}
//=============================================================================
/*! return its conjugate transposed zgbmatrix */
inline _zgbmatrix conjt(const _zgbmatrix& mat)
{VERBOSE_REPORT;
zgbmatrix newmat(mat.n, mat.m, mat.ku, mat.kl);
for(long i=0; i<newmat.m; i++){
for(long j=std::max(long(0),i-newmat.kl); j<std::min(newmat.n,i+newmat.ku+1); j++){
newmat(i,j) =std::conj(mat(j,i));
}
}
mat.destroy();
return _(newmat);
}