update references to step-12

diff --git a/doc/doxygen/headers/io.h b/doc/doxygen/headers/io.h
index f816688c0ad4e589684957252ed3df44238657f0..1f7d712c1f46449e62613038d082d1c6136e3d94 100644 (file)
--- a/doc/doxygen/headers/io.h
+++ b/doc/doxygen/headers/io.h
@@ -109,7 +109,7 @@
  * documentation of that class lists the supported formats.
  *
  * Several of the tutorial programs, notably step-1, step-6, step-9, step-10,
- * step-12, and step-14 demonstrate the use of the GridOut class.
+ * step-12b, and step-14 demonstrate the use of the GridOut class.
  *
  *
  * <h3>Matrix output</h3>

diff --git a/examples/step-21/doc/intro.dox b/examples/step-21/doc/intro.dox
index aeda981e08c58e3583cf1d5b0d5cbe136a5ad6eb..a2e8125b3adf0eb5427cc8e12fd407a2e1609a16 100644 (file)
--- a/examples/step-21/doc/intro.dox
+++ b/examples/step-21/doc/intro.dox
@@ -281,7 +281,7 @@ The quantities $S_+,\mathbf{u}_+$ then correspond to the values of these
 variables on the present cell, whereas $S_-,\mathbf{u}_-$ (needed on the
 inflow part of the boundary of $K$) are quantities taken from the neighboring
 cell. Some more context on discontinuous element techniques and evaluation of
-fluxes can also be found in step-12.
+fluxes can also be found in step-12 and step-12b.
 
 
 <h3>Linear solvers</h3>

diff --git a/examples/step-39/doc/builds-on b/examples/step-39/doc/builds-on
index 7167d6a2aedbc71b910ed5b0e8bb10bb1d433ef6..063b0dd587f0f92878ef3326c585a4f008fdfa70 100644 (file)
--- a/examples/step-39/doc/builds-on
+++ b/examples/step-39/doc/builds-on
@@ -1 +1 @@
-step-6 step-12
+step-6 step-12b

diff --git a/examples/step-39/doc/intro.dox b/examples/step-39/doc/intro.dox
index 8b35bcebb3629e145d47317c068e00231eef43a6..dfca15e769a949bdb78f2f67afe94955800a9029 100644 (file)
--- a/examples/step-39/doc/intro.dox
+++ b/examples/step-39/doc/intro.dox
@@ -79,7 +79,7 @@ Thus, the functions for assembling matrices, right hand side and error
 estimates below exhibit that these loops are all generic and can be
 programmed in the same way.
 
-This program is related to step-12, in that it uses MeshWorker and
+This program is related to step-12b, in that it uses MeshWorker and
 discontinuous Galerkin methods. While there, we solved an advection
 problem, here it is a diffusion problem. Here, we also use multigrid
 preconditioning and a theoretically justified error estimator, see

diff --git a/examples/step-6/doc/results.dox b/examples/step-6/doc/results.dox
index 74716c1d517a5173ea65337cd10b428718c48e51..e6156f6cc74d5e07a9269778b0131822203c5d19 100644 (file)
--- a/examples/step-6/doc/results.dox
+++ b/examples/step-6/doc/results.dox
@@ -160,7 +160,7 @@ Using these various different preconditioners, we can compare the
 number of CG iterations needed (available through the
 <code>solver_control.last_step()</code> call, see
 step-4) as well as CPU time needed (using the Timer class,
-discussed, for example, in step-12) and get the
+discussed, for example, in step-28) and get the
 following results (left: iterations; right: CPU time):
 
 <table width="60%" align="center">