From 577e3d4a9c392e1333bf614024f61ef279b29f63 Mon Sep 17 00:00:00 2001
From: wolf
Date: Tue, 21 Mar 2006 23:21:26 +0000
Subject: [PATCH] Link to now correct place.
git-svn-id: https://svn.dealii.org/trunk@12654 0785d39b-7218-0410-832d-ea1e28bc413d
---
.../chapter-2.step-by-step/navbar.html | 40 +++++++++----------
.../tutorial/chapter-2.step-by-step/toc.html | 40 +++++++++----------
2 files changed, 40 insertions(+), 40 deletions(-)
diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html b/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
index 63773dd510..c97ce51462 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/navbar.html
@@ -21,26 +21,26 @@
- Step 1
- Step 2
- Step 3
- Step 4
- Step 5
- Step 6
- Step 7
- Step 8
- Step 9
- Step 10
- Step 11
- Step 12
- Step 13
- Step 14
- Step 15
- Step 16
- Step 17
- Step 18
- Step 19
- Step 20
+ Step 1
+ Step 2
+ Step 3
+ Step 4
+ Step 5
+ Step 6
+ Step 7
+ Step 8
+ Step 9
+ Step 10
+ Step 11
+ Step 12
+ Step 13
+ Step 14
+ Step 15
+ Step 16
+ Step 17
+ Step 18
+ Step 19
+ Step 20
diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html b/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
index a4d6b934bc..d3dc69792c 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/toc.html
@@ -49,12 +49,12 @@ At present, the following programs exist:
- - Step 1
+ - Step 1
- What's new: Everything. We create a grid
and show a simple way to write it to a file.
- - Step 2
+ - Step 2
- 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
@@ -62,13 +62,13 @@ At present, the following programs exist:
diagonal.
- - Step 3
+ - Step 3
- What's new: Actually solve Laplace's
problem. Object-orientation. Assembling matrices and
vectors. Boundary values.
- - Step 4
+ - Step 4
- What's new: This example is programmed in a
way that it is independent of the dimension for which we want to
solve Laplace's equation; we will solve the equation in 2D and
@@ -76,7 +76,7 @@ At present, the following programs exist:
hand side function. Non-homogeneous boundary values.
- - Step 5
+ - Step 5
- What's new: Computations on successively
refined grids. Reading a grid from disk. Some optimizations.
Using assertions. Non-constant coefficient in
@@ -84,13 +84,13 @@ At present, the following programs exist:
linear system of equations.
- - Step 6
+ - Step 6
- What's new: Adaptive local
refinement. Handling of hanging nodes. Higher order elements.
Catching exceptions in the “main” function.
- - Step 7
+ - Step 7
- What's new: Helmholtz
equation. Non-homogeneous Neumann boundary conditions and
boundary integrals. Verification of correctness of computed
@@ -98,74 +98,74 @@ At present, the following programs exist:
solution and output of the data in tables. Using counted pointers.
- - Step 8
+ - Step 8
- What's new: The elastic equations will be
solved instead of Laplace's equation. The solution is
vector-valued and the equations form a system with as many
equations as the dimension of the space in which it is posed.
- - Step 9
+ - Step 9
- What's new: Transport equation, assembling
the system of equations in parallel using multi-threading,
implementing a refinement criterion based on a finite difference
approximation of the gradient.
-
- Step 10
+ - Step 10
- What's new: Higher order mappings. Do not
solve equations, but rather compute the value of pi to high
accuracy.
- - Step 11
+ - Step 11
- What's new: Solving a Laplace problem with
higher order mappings. Using strange constraints and
intermediate representations of sparsity patterns.
- - Step 12
+ - Step 12
- What's new: General framework for
discontinuous Galerkin methods. Use of Timer class.
- - Step 13
+ - Step 13
- What's new: Software design questions and
how to write a modular, extensible finite element program.
- - Step 14
+ - Step 14
- What's new: Duality based error estimators,
more strategies to write a modular, extensible finite element
program.
- - Step 15
+ - Step 15
- What's new: 1d problems, nonlinear solvers,
transfering a solution across mesh refinement.
- - Step 16
+ - Step 16
- What's new: Based on step 5, a multilevel
preconditioner is implemented.
- - Step 17
+ - Step 17
- What's new: Using PETSc for linear algebra; running
in parallel on clusters of computers linked together by MPI.
- - Step 18
+ - Step 18
- What's new: A time dependent problem; using a much
simplified version of implementing elasticity; moving meshes; handling
large scale output of parallel programs.
- - Step 19
+ - Step 19
- What's new: Input parameter file handling. Merging
output of a parallel program.
- - Step 20
+ - Step 20
- What's new: Mixed finite elements. Using block
matrices and block vectors to define more complicated solvers and
preconditioners working on the Schur complement.
--
2.39.5