From: Peter Munch <peterrmuench@gmail.com>
Date: Thu, 7 Jul 2022 17:12:22 +0000 (+0200)
Subject: Fix formating
X-Git-Tag: v9.5.0-rc1~1108^2
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=3d2a8acf88f06006927060071f9c9eec5a2ebd98;p=dealii.git

Fix formating
---

diff --git a/include/deal.II/lac/full_matrix.h b/include/deal.II/lac/full_matrix.h
index 0a2e02498a..2d8357228c 100644
--- a/include/deal.II/lac/full_matrix.h
+++ b/include/deal.II/lac/full_matrix.h
@@ -779,18 +779,18 @@ public:
   symmetrize();
 
   /**
-   * A=Inverse(A). A must be a square matrix.  Inversion of this matrix by
-   * Gauss-Jordan algorithm with partial pivoting.  This process is well-
-   * behaved for positive definite matrices, but be aware of round-off errors
-   * in the indefinite case.
+   * A=Inverse(A). A must be a square matrix. Inversion of this matrix by
+   * Gauss-Jordan algorithm with partial pivoting. This process is
+   * well-behaved for positive definite matrices, but be aware of round-off
+   * errors in the indefinite case.
    *
    * In case deal.II was configured with LAPACK, the functions Xgetrf and
    * Xgetri build an LU factorization and invert the matrix upon that
    * factorization, providing best performance up to matrices with a few
    * hundreds rows and columns.
    *
-   * The numerical effort to invert an <tt>n x n</tt> matrix is of the order
-   * <tt>n**3</tt>.
+   * The numerical effort to invert an $n \times n$ matrix is of the order
+   * $n^3$.
    */
   void
   gauss_jordan();