Fix some confusion from yesterday. Not a bug here because matrices have to be

square, but still harder to read than necessary.

git-svn-id: https://svn.dealii.org/trunk@28368 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/source/lac/sparse_direct.cc b/deal.II/source/lac/sparse_direct.cc
index eb42a4d19e89fac0a8a02f0c303c39b429e8d99f..8585f4cba45183b508fc87e03546e597b0d9cf20 100644 (file)
--- a/deal.II/source/lac/sparse_direct.cc
+++ b/deal.II/source/lac/sparse_direct.cc
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012 by the deal.II authors
+//    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012, 2013 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -1728,7 +1728,7 @@ factorize (const Matrix &matrix)
 
     // loop over the elements of the matrix row by row, as suggested
     // in the documentation of the sparse matrix iterator class
-    for (unsigned int row = 0; row < matrix.n(); ++row)
+    for (unsigned int row = 0; row < matrix.m(); ++row)
       {
         for (typename Matrix::const_iterator p=matrix.begin(row);
             p!=matrix.end(row); ++p)
@@ -1962,7 +1962,7 @@ void SparseDirectMUMPS::initialize_matrix (const Matrix &matrix)
 
       // loop over the elements of the matrix row by row, as suggested
       // in the documentation of the sparse matrix iterator class
-      for (unsigned int row = 0; row < matrix.n(); ++row)
+      for (unsigned int row = 0; row < matrix.m(); ++row)
         {
           for (typename Matrix::const_iterator ptr = matrix.begin (row);
               ptr != matrix.end (row); ++ptr)