From b311d64e123ac45fbbed640ecda79489574055d6 Mon Sep 17 00:00:00 2001 From: guido Date: Thu, 10 Mar 2005 19:42:26 +0000 Subject: [PATCH] minor corrections git-svn-id: https://svn.dealii.org/trunk@10084 0785d39b-7218-0410-832d-ea1e28bc413d --- .../tutorial/chapter-2.step-by-step/step-2.data/intro.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-2.data/intro.html b/deal.II/doc/tutorial/chapter-2.step-by-step/step-2.data/intro.html index 658f4bf9f9..299842def5 100644 --- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-2.data/intro.html +++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-2.data/intro.html @@ -7,7 +7,7 @@ to define degrees of freedom on this mesh. For this example, we will use the lowest order (Q1) finite elements, for which the degrees of freedom are associated with the vertices of the mesh. Later examples will demonstrate higher order elements where degrees of freedom are -not necessarily associated with nodes any more, but can be associated +not necessarily associated with vertices any more, but can be associated with edges, faces, or cells.

@@ -16,6 +16,6 @@ Defining degrees of freedom ("DoF"s in short) on a mesh is a rather simple task, since the library does all the work for you. However, for some algorithms, especially for some linear solvers, it is advantageous to have the degrees of freedom numbered in a certain -sense, and we will use the algorithm of Cuthill and McKee to do +order, and we will use the algorithm of Cuthill and McKee to do so. The results are written to a file and visualized using GNUPLOT.

-- 2.39.5