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.
zgesv(mat_inv);
46 for(CPPL_INT
i=0;
i<mat.
m;
i++){
47 for(CPPL_INT j=0; j<mat.
n; j++){
61 for(CPPL_INT
i=0;
i<newmat.
m;
i++){
62 for(CPPL_INT j=0; j<newmat.
n; j++){
79 CPPL_INT size =mat.
m*mat.
n;
81 CPPL_INT index =izamax_(&size, mat.
array, &inc) -1;
90 CPPL_INT size =mat.
m*mat.
n;
92 return mat.
array[izamax_(&size, mat.
array, &inc) -1];
comple damax(const zgematrix &mat)
void idamax(CPPL_INT &i, CPPL_INT &j, const zgematrix &mat)
CPPL_INT n
matrix column size
Complex Double-precision General Dence Matrix Class.
comple * array
1D array to store matrix data
(DO NOT USE) Smart-temporary Complex Double-precision General Dence Matrix Class
_zgematrix i(const zgematrix &mat)
_zgematrix conjt(const zgematrix &mat)
_zgematrix conj(const zgematrix &mat)
CPPL_INT m
matrix row size
_dcovector _(dcovector &vec)
CPPL_INT zgesv(zgematrix &)
_zgematrix t(const zgematrix &mat)