7 for(CPPL_INT
i=0;
i<newmat.
m;
i++){
8 const CPPL_INT jmax =std::min(newmat.
n,
i+newmat.
ku+1);
9 for(CPPL_INT j=std::max(CPPL_INT(0),
i-newmat.
kl); j<jmax; j++){
10 newmat(
i,j) =mat(j,
i);
24 std::cerr <<
"This matrix is not square and has no inverse matrix." << std::endl
25 <<
"Your input was (" << mat.
m <<
"x" << mat.
n <<
")." << std::endl;
33 mat_cp.
zgbsv(mat_inv);
48 for(CPPL_INT
i=0;
i<mat.
m;
i++){
49 const CPPL_INT jmax =std::min(mat.
n,
i+mat.
ku+1);
50 for(CPPL_INT j=std::max(CPPL_INT(0),
i-mat.
kl); j<jmax; j++){
64 for(CPPL_INT
i=0;
i<newmat.
m;
i++){
65 const CPPL_INT jmax =std::min(newmat.
n,
i+newmat.
ku+1);
66 for(CPPL_INT j=std::max(CPPL_INT(0),
i-newmat.
kl); j<jmax; j++){
CPPL_INT zgbsv(zgematrix &)
CPPL_INT n
matrix column size
CPPL_INT ku
upper band width
Complex Double-precision General Dence Matrix Class.
_zgbmatrix conjt(const zgbmatrix &mat)
(DO NOT USE) Smart-temporary Complex Double-precision General Dence Matrix Class
_zgematrix i(const zgbmatrix &mat)
CPPL_INT m
matrix row size
Complex Double-precision General Band Matrix Class.
(DO NOT USE) Smart-temporary Complex Double-precision General Band Matrix Class
CPPL_INT kl
lower band width
_zgbmatrix t(const zgbmatrix &mat)
_zgbmatrix conj(const zgbmatrix &mat)
_dcovector _(dcovector &vec)