diff --git a/MathLib/LinAlg/PETSc/PETScLinearSolver.h b/MathLib/LinAlg/PETSc/PETScLinearSolver.h
index 4e8aab6ced1a0b23f30b5e0658969203a784059d..cba1a2a2c3d8f32c2e0e2f763b0f3c97ce26b814 100644
--- a/MathLib/LinAlg/PETSc/PETScLinearSolver.h
+++ b/MathLib/LinAlg/PETSc/PETScLinearSolver.h
@@ -61,10 +61,10 @@ class PETScLinearSolver
 
         /*!
             \brief Get number of iterations.
-            If function solve(...) returns false, it returns the maximum
-            iterations.
+            If function solve(...) returns false, the return value is
+            exactly the maximum iterations.
         */
-        PetscInt getIterations() const
+        PetscInt getNumberOfIterations() const
         {
             PetscInt its = 0;
             KSPGetIterationNumber(_solver, &its);
@@ -76,7 +76,7 @@ class PETScLinearSolver
         /// that preconditioner matrix may vary.
         PETScMatrix &_A;
 
-        KSP _solver; ///< Slover type.
+        KSP _solver; ///< Solver type.
         PC _pc;      ///< Preconditioner type.
 };
 
diff --git a/Tests/MathLib/TestLinearSolver.cpp b/Tests/MathLib/TestLinearSolver.cpp
index 2881cc6ed3a79ed4d63b74e58c97543a406a1ede..68b2f6f2f034ae03bfde86328f23eea35a596542 100644
--- a/Tests/MathLib/TestLinearSolver.cpp
+++ b/Tests/MathLib/TestLinearSolver.cpp
@@ -183,7 +183,7 @@ void checkLinearSolverInterface(T_MATRIX &A, T_VECTOR &b, const std::string &pre
     T_LINEAR_SOVLER ls(A, prefix_name);
     ls.solve(b, x);
     
-    EXPECT_GT(ls.getIterations(), 0u);
+    EXPECT_GT(ls.getNumberOfIterations(), 0u);
     
     x.getGlobalVector(x1);
     ASSERT_ARRAY_NEAR(x0, x1, 6, 1e-5);