working version of sparse LU without fill-reducing permutation

This commit is contained in:
Desire NUENTSA
2012-07-10 19:16:57 +02:00
parent 3095e4a5f9
commit de2544cc9b
3 changed files with 4 additions and 6 deletions

View File

@@ -132,7 +132,6 @@ void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, Sca
luptr += nsupr * no_zeros + no_zeros;
// triangular solve with Eigen
Map<Matrix<Scalar,Dynamic, Dynamic>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(nsupr) );
std::cout<< " Matrix \n" << A << std::endl;
VectorBlock<ScalarVector> u(tempv, 0, segsize);
u = A.template triangularView<UnitLower>().solve(u);
@@ -165,7 +164,6 @@ void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, Sca
l(i) = Scalar(0);
++isub;
}
std::cout<< jj << " : " << dense_col.transpose() << std::endl;
} // End for each column in the panel
} // End for each updating supernode