From 620b92acf3e6a49d33701266ad8b208bfbadd144 Mon Sep 17 00:00:00 2001
From: kronbichler <kronbichler@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Thu, 12 Sep 2013 07:11:06 +0000
Subject: [PATCH] Some small fixes

git-svn-id: https://svn.dealii.org/trunk@30676 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/examples/step-51/doc/intro.dox   | 6 +++---
 deal.II/examples/step-51/doc/results.dox | 6 +++---
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/deal.II/examples/step-51/doc/intro.dox b/deal.II/examples/step-51/doc/intro.dox
index df55ef9b25..ab2f4850d9 100644
--- a/deal.II/examples/step-51/doc/intro.dox
+++ b/deal.II/examples/step-51/doc/intro.dox
@@ -179,11 +179,11 @@ Find $(\mathbf{q}_h, u_h, \lambda_h) \in
     (w, f)_{\mathcal{T}},
     \quad \forall w \in \mathcal{W}_h^p,
 \\
-  < \mu, \mathbf{c} \lambda_h\cdot \mathbf{n} 
+  \left< \mu, \mathbf{c} \lambda_h\cdot \mathbf{n} 
   		+ \mathbf{q}_h\cdot \mathbf{n}
-  	    + \tau (u_h - \lambda_h)>_{\partial \mathcal{T}}
+  	    + \tau (u_h - \lambda_h)\right>_{\partial \mathcal{T}}
     &=&
-    <\mu, g_N>_{\partial\Omega_N},
+    \left<\mu, g_N\right>_{\partial\Omega_N},
     \quad \forall \mu \in \mathcal{M}_h^p.
 @f}
 
diff --git a/deal.II/examples/step-51/doc/results.dox b/deal.II/examples/step-51/doc/results.dox
index 96eabb1724..d9b3bae675 100644
--- a/deal.II/examples/step-51/doc/results.dox
+++ b/deal.II/examples/step-51/doc/results.dox
@@ -168,10 +168,10 @@ runtime of the program. This also gives a clear indication of where an
 improvement makes most sense.
 
 <ol>
-  <li> Better linear solvers: We use a GMRES iterative solver without
+  <li> Better linear solvers: We use a BiCGStab iterative solver without
   preconditioner, where the number of iteration increases with increasing
   problem size (the number of iterations for Q1 elements and global
-  refinements start at 8 for the small sizes but increase up to 2592 for the
+  refinements start at 35 for the small sizes but increase up to 701 for the
   largest size). To do better, one could for example use an algebraic
   multigrid preconditioner from Trilinos. For diffusion-dominated problems as
   the problem at hand with finer meshes, such a solver can be designed that
@@ -180,5 +180,5 @@ improvement makes most sense.
 
   <li> Speed up assembly by pre-assembling parts that do not change from one
   cell to another (those that do neither contain variable coefficients nor
-  mapping-dependent terms.
+  mapping-dependent terms).
 </ol>
-- 
2.39.5