diff --git a/dune/gfe/geodesicfeassembler.hh b/dune/gfe/geodesicfeassembler.hh
index 7be9133aa8839008cef76454992ffd251fac41f4..cdd98f405361db054429f9288f69331cebbaa418 100644
--- a/dune/gfe/geodesicfeassembler.hh
+++ b/dune/gfe/geodesicfeassembler.hh
@@ -212,7 +212,7 @@ assembleGradient(const std::vector<TargetSpace>& sol,
     {
         localView.bind(element);
 
-        // A 1d grid has two vertices
+        // The number of degrees of freedom of the current element
         const auto nDofs = localView.tree().size();
 
         // Extract local solution
diff --git a/dune/gfe/localfirstordermodel.hh b/dune/gfe/localfirstordermodel.hh
index a098c5bacc3c549d4caea909e6815fb3111c0fab..ad5c1903cf122a9caecc6a5a9179dc946eef13a0 100644
--- a/dune/gfe/localfirstordermodel.hh
+++ b/dune/gfe/localfirstordermodel.hh
@@ -13,9 +13,7 @@ class LocalFirstOrderModel
 {
 public:
 
-    /** \brief Assemble the element gradient of the energy functional
-
-    The default implementation in this class uses a finite difference approximation */
+    /** \brief Assemble the element gradient of the energy functional */
     virtual void assembleGradient(const typename Basis::LocalView& localView,
                                   const std::vector<TargetSpace>& solution,
                                   std::vector<typename TargetSpace::TangentVector>& gradient) const = 0;
diff --git a/dune/gfe/riemannianpnsolver.cc b/dune/gfe/riemannianpnsolver.cc
index 4937720c4adabd0abb1ce46a66eed4ab1a2605be..1976ed3c5f9b630f27614fed39a24e2a3d92c332 100644
--- a/dune/gfe/riemannianpnsolver.cc
+++ b/dune/gfe/riemannianpnsolver.cc
@@ -243,7 +243,7 @@ void RiemannianProximalNewtonSolver<Basis,TargetSpace,Assembler>::solve()
               std::cout << "Gradient norm: " << l2Norm_->operator()(gradient) << std::endl;
 
             if (this->verbosity_ == Solver::FULL and rank==0)
-              std::cout << "Oveall assembly took " << gradientTimer.elapsed() << " sec." << std::endl;
+              std::cout << "Overall assembly took " << gradientTimer.elapsed() << " sec." << std::endl;
             totalAssemblyTime += gradientTimer.elapsed();
 
             // Transfer matrix data
diff --git a/dune/gfe/riemanniantrsolver.cc b/dune/gfe/riemanniantrsolver.cc
index 88d4e7713aa48b760478a93cbd3ddeb323979acc..89a0e3246dc7a94ccfe28096bd644b9ee30775ea 100644
--- a/dune/gfe/riemanniantrsolver.cc
+++ b/dune/gfe/riemanniantrsolver.cc
@@ -424,7 +424,7 @@ void RiemannianTrustRegionSolver<Basis,TargetSpace,Assembler>::solve()
               std::cout << "Gradient norm: " << gradient.two_norm() << std::endl;
             }
             if (this->verbosity_ == Solver::FULL and rank==0)
-              std::cout << "Oveall assembly took " << gradientTimer.elapsed() << " sec." << std::endl;
+              std::cout << "Overall assembly took " << gradientTimer.elapsed() << " sec." << std::endl;
             totalAssemblyTime += gradientTimer.elapsed();
 
             // Transfer matrix data