diff options
| author |  Desire NUENTSA <desire.nuentsa_wakam@inria.fr> | 2012-09-07 13:14:57 +0200 |
|---|---|---|
| committer | Desire NUENTSA <desire.nuentsa_wakam@inria.fr> | 2012-09-07 13:14:57 +0200 |
| commit | 063705b5be5a41e324773887d3d5ae065321a719 (patch) | |
| tree | 4c1accb576a621d0377e0e753971a71e1685bc60 /Eigen/src/SparseLU | |
| parent | 2280f2490e802320838f8e51884abe8667a6112d (diff) | |
Add tutorial for sparse solvers
Diffstat (limited to 'Eigen/src/SparseLU')
| -rw-r--r-- | Eigen/src/SparseLU/SparseLU.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h index 6a6579493..e2076138a 100644 --- a/Eigen/src/SparseLU/SparseLU.h +++ b/Eigen/src/SparseLU/SparseLU.h @@ -271,7 +271,7 @@ void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) //First copy the whole input matrix. m_mat = mat; - m_mat.Uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. FIXME : This vector is filled but not subsequently used. + m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. FIXME : This vector is filled but not subsequently used. //Then, permute only the column pointers for (int i = 0; i < mat.cols(); i++) { @@ -356,7 +356,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) // Apply the column permutation computed in analyzepattern() // m_mat = matrix * m_perm_c.inverse(); m_mat = matrix; - m_mat.Uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. + m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. //Then, permute only the column pointers for (int i = 0; i < matrix.cols(); i++) { |