working version of sparse LU with unsymmetric supernodes and fill-reducing permutation

This commit is contained in:
Desire NUENTSA
2012-07-13 17:32:25 +02:00
parent e529bc9cc1
commit 773804691a
4 changed files with 35 additions and 68 deletions

View File

@@ -44,7 +44,6 @@
*/
#ifndef SPARSELU_COLUMN_DFS_H
#define SPARSELU_COLUMN_DFS_H
/**
* \brief Performs a symbolic factorization on column jcol and decide the supernode boundary
*
@@ -234,6 +233,9 @@ int LU_column_dfs(const int m, const int jcol, IndexVector& perm_r, int maxsuper
jptr = xlsub(jcol); // Not yet compressed
jm1ptr = xlsub(jcolm1);
// Use supernodes of type T2 : see SuperLU paper
if ( (nextl-jptr != jptr-jm1ptr-1) ) jsuper = IND_EMPTY;
// Make sure the number of columns in a supernode doesn't
// exceed threshold
if ( (jcol - fsupc) >= maxsuper) jsuper = IND_EMPTY;