Apply suggestions from code review

To be squashed: Applied martin's suggestions.

Co-Authored-By: Martin Kronbichler <kronbichler@lnm.mw.tum.de>

diff --git a/include/deal.II/hp/refinement.h b/include/deal.II/hp/refinement.h
index 7101ab19f21e63cdebd2ee6978b8c4988eb5d23c..f526d3527d68e3fe0cce239a0de90e7cdbee4521 100644 (file)
--- a/include/deal.II/hp/refinement.h
+++ b/include/deal.II/hp/refinement.h
@@ -38,11 +38,11 @@ namespace hp
    * complexity of the numerical solution. Error estimates are an appropriate
    * means of determining where adjustments need to be made.
    *
-   * However with hp adaptivity, we have two ways to realise these adjustments:
+   * However with hp adaptivity, we have two ways to realize these adjustments:
    * For irregular solutions, h adaptive methods which dynamically assign cell
    * sizes tend to reduce the approximation error, while for smooth solutions p
    * adaptive methods are better suited in which function spaces will be
-   * selected dynamically. This namespace offers all tools to decide which type
+   * selected dynamically. This namespace collects tools to decide which type
    * of adaptive methods to apply.
    *
    * <h3>Usage</h3>
@@ -192,7 +192,7 @@ namespace hp
      *
      * With an approximation of the local Sobolev regularity index $k_K$,
      * we may assess to which finite element space our local solution on cell
-     * $K$ belongs. Since the regularity index is only an etimate, we won't
+     * $K$ belongs. Since the regularity index is only an estimate, we won't
      * use it to assign the finite element space directly, but rather consider
      * it as an indicator for adaptation. If a cell is flagged for refinement,
      * we will perform p refinement once it satisfies