From: wolf Date: Thu, 16 Mar 2006 16:31:18 +0000 (+0000) Subject: Use our ability to cross-link example programs. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=0870273cd4de68e5b3e8ac06e9abc23cc1230550;p=dealii-svn.git Use our ability to cross-link example programs. git-svn-id: https://svn.dealii.org/trunk@12627 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-12/step-12.cc b/deal.II/examples/step-12/step-12.cc index adaf8bed6c..0cdca96a4d 100644 --- a/deal.II/examples/step-12/step-12.cc +++ b/deal.II/examples/step-12/step-12.cc @@ -549,7 +549,7 @@ void DGTransportEquation::assemble_face_term2( // proceed with the main part of this // program. The main class, here // called ``DGMethod'' is basically - // the main class of step 6. One of + // the main class of step-6. One of // the differences is that there's no // ConstraintMatrix object. This is, // because there are no hanging node @@ -1473,13 +1473,13 @@ void DGMethod::solve (Vector &solution) // that computes the approximate // gradients in a way similar to the // ``GradientEstimation'' described - // in Step 9 of this tutorial. In + // in step-9 of this tutorial. In // fact, the // ``DerivativeApproximation'' class // was developed following the // ``GradientEstimation'' class of - // Step 9. Relating to the - // discussion in Step 9, here we + // step-9. Relating to the + // discussion in step-9, here we // consider $h^{1+d/2}|\nabla_h // u_h|$. Futhermore we note that we // do not consider approximate second