fix doxygen formula errors

see #7623

diff --git a/include/deal.II/base/quadrature_lib.h b/include/deal.II/base/quadrature_lib.h
index d6468d5f706b01349596c749efa96fc64099178c..0a1cf7e3cf18245990d43e7c3b3bcf135d0b8087 100644 (file)
--- a/include/deal.II/base/quadrature_lib.h
+++ b/include/deal.II/base/quadrature_lib.h
@@ -707,7 +707,7 @@ public:
  * \end{pmatrix}
  * \f]
  *
- * with determinant of the Jacobian equal to $J= \beta \hat \x^{2\beta-1}$.
+ * with determinant of the Jacobian equal to $J= \beta \hat x^{2\beta-1}$.
  * Such transformation maps the reference square $[0,1]\times[0,1]$ to the
  * reference simplex, by collapsing the left side of the square and squeezing
  * quadrature points towards the origin, and then shearing the resulting

diff --git a/include/deal.II/lac/slepc_solver.h b/include/deal.II/lac/slepc_solver.h
index afcb056b762fc0be5be513c7bc33ec3c20f99e86..249c8d31a39beb56dd72fe9d2637905c9ac9edc8 100644 (file)
--- a/include/deal.II/lac/slepc_solver.h
+++ b/include/deal.II/lac/slepc_solver.h
@@ -319,7 +319,7 @@ namespace SLEPcWrappers
 
     /**
      * Access the real parts of solutions for a solved eigenvector problem,
-     * pair index solutions, $\text{index}\,\in\,0\hdots
+     * pair index solutions, $\text{index}\,\in\,0\dots
      * \text{n\_converged}-1$.
      */
     void
@@ -329,7 +329,7 @@ namespace SLEPcWrappers
 
     /**
      * Access the real and imaginary parts of solutions for a solved
-     * eigenvector problem, pair index solutions, $\text{index}\,\in\,0\hdots
+     * eigenvector problem, pair index solutions, $\text{index}\,\in\,0\dots
      * \text{n\_converged}-1$.
      */
     void

diff --git a/include/deal.II/sundials/arkode.h b/include/deal.II/sundials/arkode.h
index 9ac077932d7e169206e0206f15217b7f7792cb15..5884c83ae0995c9ea53cfc69a4f63063af983911 100644 (file)
--- a/include/deal.II/sundials/arkode.h
+++ b/include/deal.II/sundials/arkode.h
@@ -141,7 +141,7 @@ namespace SUNDIALS
    * \f[
    *  G(z_i) \dealcoloneq M z_i − h_n A^I_{i,i} f_I (t^I_{n,i}, z_i) − a_i = 0
    * \f]
-   * must be solved for each stage $z_i , i = 1, \ldot, s$, where
+   * must be solved for each stage $z_i , i = 1, \ldots, s$, where
    * we have the data
    * \f[
    *  a_i \dealcoloneq

diff --git a/include/deal.II/sundials/ida.h b/include/deal.II/sundials/ida.h
index 66542b64b7a9485d6ceecc6dba0f099a55ee3c09..f3110d75fb9cbf0ad154aa8b5dd34f68bd65e5bd 100644 (file)
--- a/include/deal.II/sundials/ida.h
+++ b/include/deal.II/sundials/ida.h
@@ -98,11 +98,11 @@ namespace SUNDIALS
    *   \end{cases}
    * \f]
    *
-   * where $y,\dot y$ are vectors in $\R^n$, $t$ is often the time (but can
-   * also be a parametric quantity), and
-   * $F:\R\times\R^n\times\R^n\rightarrow\R^n$. Such problem is solved
-   * using Newton iteration augmented with a line search global
-   * strategy. The integration method used in IDA is the variable-order,
+   * where $y,\dot y$ are vectors in $\mathbb{R}^n$, $t$ is often the time (but
+   * can also be a parametric quantity), and
+   * $F:\mathbb{R}\times\mathbb{R}^n\times \mathbb{R}^n\rightarrow\mathbb{R}^n$.
+   * Such problem is solved using Newton iteration augmented with a line search
+   * global strategy. The integration method used in IDA is the variable-order,
    * variable-coefficient BDF (Backward Differentiation Formula), in
    * fixed-leading-coefficient. The method order ranges from 1 to 5, with
    * the BDF of order $q$ given by the multistep formula