Better document step-22 solvers.

diff --git a/doc/doxygen/references.bib b/doc/doxygen/references.bib
index 5ed6044eb3b9d8b92bb27bbccb6b04b47d2ad51b..aad5f5dc3d651b4bf3a61fd64833d88f208cdb8a 100644 (file)
--- a/doc/doxygen/references.bib
+++ b/doc/doxygen/references.bib
@@ -276,6 +276,20 @@
 }
 
 
+% ------------------------------------
+% Step 22
+% ------------------------------------
+
+@Article{SW94,
+  author =      {D. Silvester and A. Wathen},
+  title =       {Fast iterative solution of stabilised {S}tokes systems. {P}art
+                  {II}: {U}sing general block preconditioners},
+  journal =     {SIAM J. Numer. Anal.},
+  year =        1994,
+  volume =      31,
+  pages =       {1352--1367}}
+
+
 % ------------------------------------
 % Step 47
 % ------------------------------------

diff --git a/examples/step-22/doc/intro.dox b/examples/step-22/doc/intro.dox
index 32da0ccba41e230198b9a3bcdb27c5ce3b4666b5..002bc0dd5cd96d25531de5b1f8dea21fdbbb81ae 100644 (file)
--- a/examples/step-22/doc/intro.dox
+++ b/examples/step-22/doc/intro.dox
@@ -588,6 +588,25 @@ classes, we will be able to use them interchangeably using the same syntax in
 all places.
 
 
+<h4> Is this how one should solve the Stokes equations? </h4>
+
+The discussions above showed *one* way in which the linear system that
+results from the Stokes equations can be solved, and because the
+tutorial programs are teaching tools that makes sense. But is this the
+way this system of equations *should* be solved?
+
+The answer to this is no. The primary bottleneck with the approach,
+already identified above, is that we have to repeatedly solve linear
+systems with $A$ inside the Schur complement, and because we don't
+have a good preconditioner for the Schur complement, these solves just
+have to happen too often. A better approach is to use a block
+decomposition, which is based on an observation of Silvester and
+Wathen @cite SW94 and explained in much greater detail in
+@cite elman2005 . An implementation of this alternative approach is
+discussed below, in the section on a <a href="#block-schur">block Schur
+complementation preconditioner</a> in the results section of this program.
+
+
 <h4> A note on the structure of the linear system </h4>
 
 Above, we have claimed that the linear system has the form

diff --git a/examples/step-22/doc/results.dox b/examples/step-22/doc/results.dox
index 7c3a6c75120d4d3a628c7b1dc272dab907db6861..c9fc2037b0797cb27b1355e302d34fcac8fdb3d3 100644 (file)
--- a/examples/step-22/doc/results.dox
+++ b/examples/step-22/doc/results.dox
@@ -346,6 +346,7 @@ mesh-independent number of iterations, say 10 to 30. We have seen such a
 candidate in step-16: multigrid.
 
 <h5>Block Schur complement preconditioner</h5>
+<a name="block-schur"></a>
 Even with a good preconditioner for $A$, we still
 need to solve of the same linear system repeatedly (with different
 right hand sides, though) in order to make the Schur complement solve