diff --git a/src/maths/sparse/spfactor.c b/src/maths/sparse/spfactor.c
index ddff32fcd..103392a73 100644
--- a/src/maths/sparse/spfactor.c
+++ b/src/maths/sparse/spfactor.c
@@ -333,10 +333,10 @@ spFactor(MatrixPtr eMatrix)
     assert( IS_VALID(Matrix) && !Matrix->Factored);
 
     if (Matrix->NeedsOrdering) {
-        return spOrderAndFactor( eMatrix, NULL,
+        return spOrderAndFactor( Matrix, NULL,
                                  0.0, 0.0, DIAG_PIVOTING_AS_DEFAULT );
     }
-    if (!Matrix->Partitioned) spPartition( eMatrix, spDEFAULT_PARTITION );
+    if (!Matrix->Partitioned) spPartition( Matrix, spDEFAULT_PARTITION );
     if (Matrix->Complex)
         return FactorComplexMatrix( Matrix );
 
diff --git a/src/maths/sparse/sputils.c b/src/maths/sparse/sputils.c
index b615d7882..5e173e376 100644
--- a/src/maths/sparse/sputils.c
+++ b/src/maths/sparse/sputils.c
@@ -2087,7 +2087,7 @@ spRoundoff(MatrixPtr eMatrix, RealNumber Rho)
     assert( IS_SPARSE(Matrix) && IS_FACTORED(Matrix) );
 
     /* Compute Barlow's bound if it is not given. */
-    if (Rho < 0.0) Rho = spLargestElement( eMatrix );
+    if (Rho < 0.0) Rho = spLargestElement( Matrix );
 
     /* Find the maximum number of off-diagonals in L if not previously computed. */
     if (Matrix->MaxRowCountInLowerTri < 0)