7   for(CPPL_INT 
i=0; 
i<newmat.
m; 
i++){
 
    8     for(CPPL_INT j=0; j<newmat.
n; j++){
 
   23     std::cerr << 
"This matrix is not square and has no inverse matrix." << std::endl
 
   24               << 
"Your input was (" << mat.
m << 
"x" << mat.
n << 
")." << std::endl;
 
   31   mat_cp.
dgesv(mat_inv);
 
   45   CPPL_INT mn =mat.
m*mat.
n;
 
   47   CPPL_INT index =idamax_(&mn, mat.
array, &inc) -1;
 
   56   CPPL_INT mn =mat.
m*mat.
n;
 
   58   return mat.
array[idamax_(&mn, mat.
array, &inc) -1];
 
void idamax(CPPL_INT &i, CPPL_INT &j, const dgematrix &mat)
 
_dgematrix t(const dgematrix &mat)
 
CPPL_INT m
matrix row size 
 
double damax(const dgematrix &mat)
 
double * array
1D array to store matrix data 
 
CPPL_INT n
matrix column size 
 
Real Double-precision General Dence Matrix Class. 
 
CPPL_INT dgesv(dgematrix &)
 
(DO NOT USE) Smart-temporary Real Double-precision General Dence Matrix Class 
 
_dgematrix i(const dgematrix &mat)
 
_dcovector _(dcovector &vec)