mirror of
https://gitlab.com/libeigen/eigen.git
synced 2026-04-10 11:34:33 +08:00
Add tutorial for sparse solvers
This commit is contained in:
@@ -478,7 +478,7 @@ class SparseMatrix
|
||||
}
|
||||
|
||||
/** Turns the matrix into the uncompressed mode */
|
||||
void Uncompress()
|
||||
void uncompress()
|
||||
{
|
||||
if(m_innerNonZeros != 0)
|
||||
return;
|
||||
|
||||
@@ -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++)
|
||||
{
|
||||
|
||||
@@ -627,9 +627,7 @@ void SuperLU<MatrixType>::factorize(const MatrixType& a)
|
||||
|
||||
this->initFactorization(a);
|
||||
|
||||
//DEBUG
|
||||
// m_sluOptions.ColPerm = COLAMD;
|
||||
m_sluOptions.Equil = NO;
|
||||
m_sluOptions.ColPerm = COLAMD;
|
||||
int info = 0;
|
||||
RealScalar recip_pivot_growth, rcond;
|
||||
RealScalar ferr, berr;
|
||||
|
||||
Reference in New Issue
Block a user