From 1d07c8c0f2cfd0becbdba28fe9512ed09ab6f485 Mon Sep 17 00:00:00 2001 From: Timo Heister Date: Mon, 4 Nov 2019 14:35:53 -0500 Subject: [PATCH] update references to step-12 --- doc/doxygen/headers/io.h | 2 +- examples/step-21/doc/intro.dox | 2 +- examples/step-39/doc/builds-on | 2 +- examples/step-39/doc/intro.dox | 2 +- examples/step-6/doc/results.dox | 2 +- 5 files changed, 5 insertions(+), 5 deletions(-) diff --git a/doc/doxygen/headers/io.h b/doc/doxygen/headers/io.h index f816688c0a..1f7d712c1f 100644 --- 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. * * *

Matrix output

diff --git a/examples/step-21/doc/intro.dox b/examples/step-21/doc/intro.dox index aeda981e08..a2e8125b3a 100644 --- 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.

Linear solvers

diff --git a/examples/step-39/doc/builds-on b/examples/step-39/doc/builds-on index 7167d6a2ae..063b0dd587 100644 --- 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 8b35bcebb3..dfca15e769 100644 --- 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 74716c1d51..e6156f6cc7 100644 --- 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 solver_control.last_step() 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): -- 2.39.5