From b13b8636c075cf261c455394442fd807248e79d0 Mon Sep 17 00:00:00 2001 From: wolf Date: Thu, 9 Dec 1999 16:44:55 +0000 Subject: [PATCH] Adapt to new directory structure where necessary. git-svn-id: https://svn.dealii.org/trunk@2027 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/tutorial/Makefile | 4 ++-- .../chapter-1.elements/adaptivity.html | 4 ++-- .../tutorial/chapter-1.elements/condense.html | 2 +- .../chapter-1.elements/grid_creation.html | 8 ++++++-- .../doc/tutorial/chapter-1.elements/index.html | 2 +- .../chapter-1.elements/matrix_generation.html | 2 +- .../tutorial/chapter-1.elements/output.html | 4 ++-- .../chapter-1.elements/parameters.html | 4 ++-- .../doc/tutorial/chapter-1.elements/solve.html | 2 +- .../doc/tutorial/chapter-3.laplace/index.html | 2 +- deal.II/doc/tutorial/index.html | 18 +++++++++--------- 11 files changed, 28 insertions(+), 24 deletions(-) diff --git a/deal.II/doc/tutorial/Makefile b/deal.II/doc/tutorial/Makefile index 0861be4ec4..6405959fc5 100644 --- a/deal.II/doc/tutorial/Makefile +++ b/deal.II/doc/tutorial/Makefile @@ -1,11 +1,11 @@ # $Id$ step-by-step: - cd step-by-step ; $(MAKE) + cd chapter-2.step-by-step ; $(MAKE) clean: - cd step-by-step ; $(MAKE) clean + cd chapter-2.step-by-step ; $(MAKE) clean .PHONY: step-by-step clean diff --git a/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html b/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html index f46b6a4db2..5220207b18 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html +++ b/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html @@ -84,7 +84,7 @@ tries to approximate the error per cell by integration of the jump of the gradient of the solution along the faces of each cell. In theory this error estimator has quite a number of limitations. These limitations as well as its implementation are described in - + the documentation for the class KellyErrorEstimator. In daily use, however, this error estimator has shown itself to behave rather like Hamlet: It is laden with theoretical woes and sorrows, @@ -117,7 +117,7 @@ and objects respectively:
  • in case your problem includes spatially varying coefficients, you may give that as well (but we will not discuss this here, - refer to the + refer to the KellyErrorEstimator class documentation).
  • diff --git a/deal.II/doc/tutorial/chapter-1.elements/condense.html b/deal.II/doc/tutorial/chapter-1.elements/condense.html index afdc75f538..e11bd3a990 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/condense.html +++ b/deal.II/doc/tutorial/chapter-1.elements/condense.html @@ -29,7 +29,7 @@ account when dealing with them.

    The deal.II class that has the ability to handle constraint matrices is called -ConstraintMatrix. It provides all functions +ConstraintMatrix. It provides all functions necessary to condense hanging nodes into a matrix structure. You will have to:

      diff --git a/deal.II/doc/tutorial/chapter-1.elements/grid_creation.html b/deal.II/doc/tutorial/chapter-1.elements/grid_creation.html index 1d050504f8..386aa2a1f5 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/grid_creation.html +++ b/deal.II/doc/tutorial/chapter-1.elements/grid_creation.html @@ -82,7 +82,11 @@ GridGenerator::hyper_cube (triangulation, -1, 1);

      A hyperball can be created using the function
      void GridGenerator::hyper_ball(Triangulation<dim> &tria,const Point<dim> center=0.,const double radius=1.)
      -This will create a hyperball of given centre and radius where the location of the centre defaults to the origin and the radius to unity. +This will create a hyperball of given centre and radius where the +location of the centre defaults to the origin and the radius to +unity. Note that the left figure is scaled a bit large, since the +corner points of the outer square will later be the points on the +circles surface in diagonal directions.

      @@ -194,7 +198,7 @@ grid construction algorithm. Otherwise some of your matrix elements may have the wrong sign (plus instead of minus or vice versa). A more detailed description of the problems encountered in two dimensions can be found in the - DataIn class description. + DataIn class description.

      diff --git a/deal.II/doc/tutorial/chapter-1.elements/index.html b/deal.II/doc/tutorial/chapter-1.elements/index.html index 29acf66d1b..163af0f8ba 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/index.html +++ b/deal.II/doc/tutorial/chapter-1.elements/index.html @@ -27,7 +27,7 @@

      The deal.II Tutorial

      Your browser does not seem to understand frames. A version of this tutorial that does not use frames can be found at -http://hermes.iwr.uni-heidelberg.de/~deal/doc/tutorial/00.fe_structure/toc.html. +http://gaia.iwr.uni-heidelberg.de/~deal/doc/tutorial/chapter-1.elements/toc.html. diff --git a/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html b/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html index cecec04911..0eb6b652ad 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html +++ b/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html @@ -119,7 +119,7 @@ sparse_matrix.reinit (sparsity_pattern);

      Vector operations are supplied by the class Vector. +href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/lac/Vector.html">Vector. The first and most important operation on a vector is its initialization using void Vector::reinit(const usigned int N, const bool fast=false), which resets the vector's size to diff --git a/deal.II/doc/tutorial/chapter-1.elements/output.html b/deal.II/doc/tutorial/chapter-1.elements/output.html index 896abb5fe6..6b88d97ebc 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/output.html +++ b/deal.II/doc/tutorial/chapter-1.elements/output.html @@ -387,7 +387,7 @@ to be plotted.

      The limitations of the gnuplot data format have been well described in the - + DataOut class description:

      @@ -404,7 +404,7 @@ each cell being straight lines. You won't see the structure of the solution in t

      The limitations mentioned above can to some extent be remedied, and that is why there is also an option for high quality output. For how this is done, we quote (again) the - + DataOut class description:

      diff --git a/deal.II/doc/tutorial/chapter-1.elements/parameters.html b/deal.II/doc/tutorial/chapter-1.elements/parameters.html index 63cb872249..3872dc1893 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/parameters.html +++ b/deal.II/doc/tutorial/chapter-1.elements/parameters.html @@ -131,7 +131,7 @@ and retrieve their values. The values are stored in the strings zeldovich_solver and sunyaev_solver. Please note that in order to stick to the essentials this example violates the - + recommended style for parameter declaration.

      @@ -306,7 +306,7 @@ value encountered last of the parameter in question is used. Example: We read parameters successively from three different sources. This example was taken from -the ParameterHandler class documentation. +the ParameterHandler class documentation.

      diff --git a/deal.II/doc/tutorial/chapter-1.elements/solve.html b/deal.II/doc/tutorial/chapter-1.elements/solve.html
      index dfbda572eb..38283ebece 100644
      --- a/deal.II/doc/tutorial/chapter-1.elements/solve.html
      +++ b/deal.II/doc/tutorial/chapter-1.elements/solve.html
      @@ -327,7 +327,7 @@ A number too small can seriously affect its performance, but a number
       too large will also increase the required computing time. This number is
       contained in the AdditionalData structure with a default of 30. 
       This solver is rather special, and for a detailed explanation you should
      -take a look at the detailed description of the SolverGMRES
      +take a look at the detailed description of the SolverGMRES
       class.
       

      diff --git a/deal.II/doc/tutorial/chapter-3.laplace/index.html b/deal.II/doc/tutorial/chapter-3.laplace/index.html index 0f5b8ac43d..c71bc8136c 100644 --- a/deal.II/doc/tutorial/chapter-3.laplace/index.html +++ b/deal.II/doc/tutorial/chapter-3.laplace/index.html @@ -27,7 +27,7 @@

      The deal.II Tutorial

      Your browser does not seem to understand frames. A version of this tutorial that does not use frames can be found at -http://gaia.iwr.uni-heidelberg.de/~deal/doc/tutorial/01.laplace/toc.html. +http://gaia.iwr.uni-heidelberg.de/~deal/doc/tutorial/chapter-3.laplace/toc.html. diff --git a/deal.II/doc/tutorial/index.html b/deal.II/doc/tutorial/index.html index ded336dbae..6fa7364cfc 100644 --- a/deal.II/doc/tutorial/index.html +++ b/deal.II/doc/tutorial/index.html @@ -21,8 +21,8 @@ advance through the chapters in their proper order. This tutorial contains the 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 + deal.II. The first chapter, + Structure of a Finite Element Program, can also be used as a reference.

      @@ -44,9 +44,9 @@ The structure of this tutorial is as follows:

      -

      Chapter 0: Basic Elements of a +

      Chapter 1: Basic Elements of a Finite Element Program

      -

      (also available in a version without frames) +

      (also available in a version without frames)

      We will discuss the various elements needed for a working finite element program and some of the possibilities @@ -55,10 +55,10 @@ programs.

      -

      Chapter 1: Various small +

      Chapter 2: Various small programs demonstrating aspects of the library

      - (also available in a version + (also available in a version without frames)

      @@ -67,10 +67,10 @@ program.

      -

      Chapter 2: The very simple Laplace +

      Chapter 3: The very simple Laplace Problem

      - (also available in a version without frames) + (also available in a version without frames)

      NOTE: this example program is not finished and not a good @@ -78,7 +78,7 @@

      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. + You can also obtain the source code.

      Technical terms

      -- 2.39.5