GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-07-01 18:55:11 +08:00
Code Issues Packages Projects Releases Wiki Activity

correct bug in Blas 3 2D block update

Browse Source
This commit is contained in:
Desire NUENTSA 2012-09-04 11:36:57 +02:00
parent 3a22c47fb5
commit 2e38666d01
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Eigen/src/SparseLU/SparseLU_panel_bmod.h
View File

@ -49,7 +49,7 @@
* *
*/ */
template <typename DenseIndexBlock, typename IndexVector, typename ScalarVector> template <typename DenseIndexBlock, typename IndexVector, typename ScalarVector>
void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, ScalarVector& dense, ScalarVector& tempv, DenseIndexBlock& segrep, DenseIndexBlock& repfnz, LU_GlobalLU_t<IndexVector,ScalarVector>& glu) void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, ScalarVector& dense, ScalarVector& tempv, DenseIndexBlock& segrep, DenseIndexBlock& repfnz, LU_GlobalLU_t<IndexVector,ScalarVector>& glu)
{ {
typedef typename ScalarVector::Scalar Scalar; typedef typename ScalarVector::Scalar Scalar;
@ -95,7 +95,7 @@ void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, Sca
// if the blocks are large enough, use level 3 // if the blocks are large enough, use level 3
// TODO find better heuristics! // TODO find better heuristics!
if(true /*nsupc >= 50 && nrow > 50 && u_cols>6*/) if( nsupc >= 50 && nrow > 50 && u_cols>6)
{ {
Map<Matrix<Scalar,Dynamic,Dynamic> > U(tempv.data(), u_rows, u_cols); Map<Matrix<Scalar,Dynamic,Dynamic> > U(tempv.data(), u_rows, u_cols);
@ -117,13 +117,13 @@ void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, Sca
int isub = lptr + no_zeros; int isub = lptr + no_zeros;
int off = u_rows-segsize; int off = u_rows-segsize;
for (int i = 0; i < off; i++) U(i,u_col) = 0;
for (int i = 0; i < segsize; i++) for (int i = 0; i < segsize; i++)
{ {
int irow = glu.lsub(isub); int irow = glu.lsub(isub);
U(i+off,u_col) = dense_col(irow); U(i+off,u_col) = dense_col(irow);
++isub; ++isub;
} }
u_col++; u_col++;
} }
// solve U = A^-1 U // solve U = A^-1 U