From 6b1622d917a880327b7467a13a491e8e0c906c51 Mon Sep 17 00:00:00 2001 From: wolf Date: Thu, 10 Mar 2005 19:36:52 +0000 Subject: [PATCH] Make things a little clearer. git-svn-id: https://svn.dealii.org/trunk@10082 0785d39b-7218-0410-832d-ea1e28bc413d --- .../step-2.data/intro.html | 22 +++++++++++++------ 1 file changed, 15 insertions(+), 7 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 3795cc5f49..5963bdbba2 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 @@ -3,11 +3,19 @@

After we have created a grid in the previous example, we now show how -we can associate a degree of freedom with each vertex of the -triangulation. This is a rather simple task, since the library does -all the work. 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 so. The results are written to a file and visualized using -GNUPLOT. +we can define degree 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 show higher order elements where degrees of freedom are +not necessarily associated with nodes any more, but can be associated +with edges, faces, or cells. +

+ +

+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 +so. The results are written to a file and visualized using GNUPLOT.

-- 2.39.5