+In this chapter, we present a collecting of small programs, each more
+or less built atop of the previous one, which demonstrate various
+aspects of the library. At present, the following programs exist:
+
What's new: Associate degrees of freedom to each vertex
+ and compute the resulting sparsity pattern of matrices. Show
+ that renumbering reduces the bandwidth of matrices
+ significantly, i.e. clusters nonzero entries around the
+ diagonal.
+
+
+
diff --git a/deal.II/doc/tutorial/index.html b/deal.II/doc/tutorial/index.html
index 0dc341a5b4..2bc308ef14 100644
--- a/deal.II/doc/tutorial/index.html
+++ b/deal.II/doc/tutorial/index.html
@@ -24,7 +24,8 @@
complete code for every example program and can be used as a reference, too,
if you are looking for code to solve a specific problem with
deal.II. The 0th chapter,
- Structure of a Finite Element Program, can also be used as a reference.
+ Structure of a Finite
+ Element Program, can also be used as a reference.
On deal.II
@@ -51,16 +52,32 @@
We will discuss the various elements needed for a working
finite element program and some of the possibilities
- deal.II offers in this respect.
+ deal.II offers in this respect. This chapter
+ does not include working programs, but rather snippets of
+ programs.
- ***********
+ NOTE: this example program is not finished and not a good
+ example after all.
+
We will solve the stationary Laplace problem on a square grid with
boundary conditions of the form cos(2*PI*x)cos(2*PI*y).
You can also obtain the source code.
--
2.39.5