From d04a90852416cf0698175bbdbb92e9306131d494 Mon Sep 17 00:00:00 2001 From: wolf Date: Tue, 19 Sep 2000 07:49:44 +0000 Subject: [PATCH] Fix bad xlinks. git-svn-id: https://svn.dealii.org/trunk@3334 0785d39b-7218-0410-832d-ea1e28bc413d --- .../chapter-1.elements/adaptivity.html | 4 ++-- .../tutorial/chapter-1.elements/condense.html | 2 +- .../tutorial/chapter-1.elements/index.html | 2 +- .../chapter-1.elements/matrix_generation.html | 2 +- .../tutorial/chapter-1.elements/output.html | 22 ++++++++++++------- .../chapter-1.elements/parameters.html | 4 ++-- .../tutorial/chapter-1.elements/solve.html | 2 +- 7 files changed, 22 insertions(+), 16 deletions(-) diff --git a/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html b/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html index 98abc58e34..0fe591e5ea 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html +++ b/deal.II/doc/tutorial/chapter-1.elements/adaptivity.html @@ -83,7 +83,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, @@ -116,7 +116,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 7e5dd60d3f..65062f3526 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/condense.html +++ b/deal.II/doc/tutorial/chapter-1.elements/condense.html @@ -28,7 +28,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/index.html b/deal.II/doc/tutorial/chapter-1.elements/index.html index a181b648fb..81b7c6241d 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/index.html +++ b/deal.II/doc/tutorial/chapter-1.elements/index.html @@ -23,7 +23,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/chapter-1.elements/toc.html. +../../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 ca2fb0aa55..f18c2dd3ed 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html +++ b/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html @@ -118,7 +118,7 @@ sparse_matrix.reinit (sparsity_pattern);

      Vector operations are supplied by the class Vector. +href="../../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 37ae82a502..d5a7664f5b 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/output.html +++ b/deal.II/doc/tutorial/chapter-1.elements/output.html @@ -386,15 +386,21 @@ to be plotted.

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

      -This format is somewhat restricted to coninuous data and to finite elements of first order only. The reason for the first restriction is that it takes nodal values and can -therefore only work if a finite element has degrees of freedom in the vertices of each cell. This is not the case for discontinuous elements. The second restriction is only a -problem of quality of output: you actually can print quadratic or higher order elements using this style, but you will only see the contour of each cell with the bounding lines of -each cell being straight lines. You won't see the structure of the solution in the interior of a cell nor on the lines bounding it. +This format is somewhat restricted to coninuous data and to finite +elements of first order only. The reason for the first restriction is +that it takes nodal values and can therefore only work if a finite +element has degrees of freedom in the vertices of each cell. This is +not the case for discontinuous elements. The second restriction is +only a problem of quality of output: you actually can print quadratic +or higher order elements using this style, but you will only see the +contour of each cell with the bounding lines of each cell being +straight lines. You won't see the structure of the solution in the +interior of a cell nor on the lines bounding it.

      @@ -403,8 +409,8 @@ 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: + +DataOutBase 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 174b428554..8e28423d49 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/parameters.html +++ b/deal.II/doc/tutorial/chapter-1.elements/parameters.html @@ -130,7 +130,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.

      @@ -305,7 +305,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 e0c92a2d07..23bbd929f7 100644
--- a/deal.II/doc/tutorial/chapter-1.elements/solve.html
+++ b/deal.II/doc/tutorial/chapter-1.elements/solve.html
@@ -326,7 +326,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.
 
      
 
-- 
2.39.5