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

Add tutorial for sparse solvers

Browse Source
This commit is contained in:
Desire NUENTSA
2012-09-07 13:14:57 +02:00
parent 2280f2490e
commit 063705b5be
5 changed files with 115 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -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++)
{