No need for \f$...\f$, we have our own scripts that expand $...$ to exactly this.

git-svn-id: https://svn.dealii.org/trunk@32713 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/include/deal.II/lac/lapack_full_matrix.h b/deal.II/include/deal.II/lac/lapack_full_matrix.h
index ee4401d1a4ff8e8f8b615345f47142deb01a330b..ddff7b1a090a87c2ca22c26b236e2b8dbf50fa14 100644 (file)
--- a/deal.II/include/deal.II/lac/lapack_full_matrix.h
+++ b/deal.II/include/deal.II/lac/lapack_full_matrix.h
@@ -133,13 +133,13 @@ public:
 
   /**
    * Return the dimension of the range space. @note The matrix is of
-   * dimension \f$m \times n\f$.
+   * dimension $m \times n$.
    */
   unsigned int m () const;
 
   /**
    * Return the number of the range space. @note The matrix is of
-   * dimension \f$m \times n\f$.
+   * dimension $m \times n$.
    */
   unsigned int n () const;
 
@@ -469,7 +469,7 @@ public:
                                                  Vector<number>               &eigenvalues,
                                                  std::vector<Vector<number> > &eigenvectors,
                                                  const int                     itype = 1);
-  
+
   /**
    * Same as the other compute_generalized_eigenvalues_symmetric function
    * except that all eigenvalues are computed and the tolerance is set
@@ -661,16 +661,16 @@ private:
 /*---------------------- Inline functions -----------------------------------*/
 
 template <typename number>
-inline 
-unsigned int 
+inline
+unsigned int
 LAPACKFullMatrix<number>::m () const
 {
   return this->n_rows ();
 }
 
 template <typename number>
-inline 
-unsigned int 
+inline
+unsigned int
 LAPACKFullMatrix<number>::n () const
 {
   return this->n_cols ();