devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

working version of sparse LU without fill-reducing permutation

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -234,7 +234,7 @@ class SparseLU
{
for (jcol = fsupc; jcol < fsupc + nsupc; jcol++)
{
for (i = m_Ustore.outerIndexPtr()[jcol]; i < m_Ustore.outerIndexPtr()[jcol]; i++)
for (i = m_Ustore.outerIndexPtr()[jcol]; i < m_Ustore.outerIndexPtr()[jcol+1]; i++)
{
irow = m_Ustore.innerIndexPtr()[i];
X(irow, j) -= X(jcol, j) * m_Ustore.valuePtr()[i];
@@ -454,7 +454,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix)
IndexVector xplore(m);
IndexVector repfnz(maxpanel);
IndexVector panel_lsub(maxpanel);
IndexVector xprune(n);
IndexVector xprune(n); xprune.setZero();
IndexVector marker(m*LU_NO_MARKER);
repfnz.setConstant(-1);
@@ -642,7 +642,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix)
for (i = 0; i < nseg; i++)
{
irep = segrep(i);
repfnz(irep) = IND_EMPTY;
repfnz_k(irep) = IND_EMPTY;
}
} // end SparseLU within the panel
jcol += panel_size; // Move to the next panel