aboutsummaryrefslogtreecommitdiffhomepage
path: root/bench/spbench
diff options
context:
space:
mode:
authorGravatar Desire NUENTSA <desire.nuentsa_wakam@inria.fr>2012-07-06 20:18:16 +0200
committerGravatar Desire NUENTSA <desire.nuentsa_wakam@inria.fr>2012-07-06 20:18:16 +0200
commitb5a83867cac92a539b3a4d1cf8fcdcf8e9e9f5b2 (patch)
tree335db33e925cba1313098ec103e9581fe0c3f6aa /bench/spbench
parent203a0343fdfb83919ffdb486d5375d239a1b2a59 (diff)
Update Ordering interface
Diffstat (limited to 'bench/spbench')
-rw-r--r--bench/spbench/test_sparseLU.cpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/bench/spbench/test_sparseLU.cpp b/bench/spbench/test_sparseLU.cpp
index 4727cc12b..841011f30 100644
--- a/bench/spbench/test_sparseLU.cpp
+++ b/bench/spbench/test_sparseLU.cpp
@@ -17,7 +17,7 @@ int main(int argc, char **args)
typedef Matrix<double, Dynamic, Dynamic> DenseMatrix;
typedef Matrix<double, Dynamic, 1> DenseRhs;
VectorXd b, x, tmp;
- SparseLU<SparseMatrix<double, ColMajor>, AMDOrdering<double, int> > solver;
+ SparseLU<SparseMatrix<double, ColMajor>, AMDOrdering<int> > solver;
ifstream matrix_file;
string line;
int n;
@@ -52,7 +52,7 @@ int main(int argc, char **args)
}
/* Compute the factorization */
- solver.isSymmetric(true);
+// solver.isSymmetric(true);
solver.compute(A);
solver._solve(b, x);