00001
00003 inline _dgbmatrix t(const _dgbmatrix& mat)
00004 {
00005 #ifdef CPPL_VERBOSE
00006 std::cerr << "# [MARK] t(const _dgbmatrix&)"
00007 << std::endl;
00008 #endif//CPPL_VERBOSE
00009
00010 dgbmatrix newmat(mat.N, mat.M, mat.KU, mat.KL);
00011 for(long i=0; i<newmat.m; i++){
00012 for(long j=max(0,i-newmat.kl); j<min(newmat.n,i+newmat.ku+1); j++){
00013 newmat(i,j) =mat(j,i);
00014 }
00015 }
00016
00017 mat.destroy();
00018 return _(newmat);
00019 }
00020
00021
00023 inline _dgematrix i(const _dgbmatrix& mat)
00024 {
00025 #ifdef CPPL_VERBOSE
00026 std::cerr << "# [MARK] i(const _dgbmatrix&)"
00027 << std::endl;
00028 #endif//CPPL_VERBOSE
00029
00030 #ifdef CPPL_DEBUG
00031 if(mat.M!=mat.N){
00032 std::cerr << "[ERROR] i(_dgbmatrix&) " << std::endl
00033 << "This matrix is not square and has no inverse matrix."
00034 << std::endl
00035 << "Your input was (" << mat.M << "x" << mat.N << ")."
00036 << std::endl;
00037 exit(1);
00038 }
00039 #endif//CPPL_DEBUG
00040 dgbmatrix mat_cp;
00041 mat_cp.shallow_copy(mat);
00042
00043 dgematrix mat_inv(mat.M,mat.N);
00044 mat_inv.identity();
00045
00046 mat_cp.dgbsv(mat_inv);
00047
00048 return _(mat_inv);
00049 }