Fix a couple of formulas.

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

diff --git a/deal.II/examples/step-22/doc/intro.dox b/deal.II/examples/step-22/doc/intro.dox
index 2c3ea9d30248e616c1a4c96f93ba11e721b7802d..062437a14ada7b6ad160ccaf4ca3b98fda30cc56 100644 (file)
--- a/deal.II/examples/step-22/doc/intro.dox
+++ b/deal.II/examples/step-22/doc/intro.dox
@@ -706,8 +706,8 @@ have been eliminated.
 
 Essentially, there are currently two algorithms in the program that do not
 scale linearly with the number of degrees of freedom: renumbering of degrees
-of freedom (which is ${\val O}(N \log N)$, and the linear solver (which is
-{\val O}(N^{4/3})$). As for the first, while reordering degrees of freedom
+of freedom (which is ${\cal O}(N \log N)$, and the linear solver (which is
+${\cal O}(N^{4/3})$). As for the first, while reordering degrees of freedom
 may not scale linearly, it is an indispensible part of the overall algorithm
 as it greatly improves the quality of the sparse ILU, easily making up for
 the time spent on computing the renumbering; graphs and timings to