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
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/numerics/KellyErrorEstimator.html">
+<a href="../../auto/kdoc/numerics/KellyErrorEstimator.html">
the documentation for the class <code>KellyErrorEstimator</code></a>.
In daily use, however, this error estimator has shown itself to behave
rather like Hamlet: It is laden with theoretical woes and sorrows,
<li>in case your problem includes spatially varying coefficients,
you may give that as well (but we will not discuss this here,
- refer to the <a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/numerics/KellyErrorEstimator.html">
+ refer to the <a href="../../auto/kdoc/numerics/KellyErrorEstimator.html">
<code>KellyErrorEstimator</code> class documentation</a>).
</li>
</ul>
<p>
The <acronym>deal.II</acronym> class
that has the ability to handle constraint matrices is called
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/dof/ConstraintMatrix.html"><code>ConstraintMatrix</code></a>. It provides all functions
+<a href="../../auto/kdoc/dof/ConstraintMatrix.html"><code>ConstraintMatrix</code></a>. It provides all functions
necessary to condense hanging nodes into a matrix structure.
You will have to:
<ol>
<h1>The deal.II Tutorial</h1>
Your browser does not seem to understand frames. A version of this
tutorial that does not use frames can be found at
-<a href="toc.html">http://gaia.iwr.uni-heidelberg.de/~deal/doc/tutorial/chapter-1.elements/toc.html</a>.
+<a href="toc.html">../../tutorial/chapter-1.elements/toc.html</a>.
</noframes>
</html>
<p>
Vector operations are supplied by the class <code><a
-href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/lac/Vector.html">Vector</a></code>.
+href="../../auto/kdoc/lac/Vector.html">Vector</a></code>.
The first and most important operation on a vector is its
initialization using <code>void Vector::reinit(const usigned int N,
const bool fast=false)</code>, which resets the vector's size to
<p>The limitations of the gnuplot data format have been well described
in the
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/basic/DataOut.html">
-<code>DataOut</code> class description</a>:
+<a href="../../auto/kdoc/base/DataOutBase.html">
+<code>DataOutBase</code> class description</a>:
</p>
<blockquote>
<p>
-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.
</p>
</blockquote>
<p>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
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/basic/DataOut.html">
-<code>DataOut</code> class description</a>:
+<a href="../../auto/kdoc/base/DataOutBase.html">
+<code>DataOutBase</code> class description</a>:
</p>
<blockquote>
<code>zeldovich_solver</code> and <code>sunyaev_solver</code>.
Please note that in order to stick to the essentials this example
violates the
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/base/ParameterHandler.html">
+<a href="../../auto/kdoc/base/ParameterHandler.html">
recommended style for parameter declaration</a>.
</p>
<span class="example">Example:</span>
We read parameters successively
from three different sources. This example was taken from
-the <a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/base/ParameterHandler.html"><code>ParameterHandler</code> class documentation</a>.
+the <a href="../../auto/kdoc/base/ParameterHandler.html"><code>ParameterHandler</code> class documentation</a>.
</p>
<pre class="example">
too large will also increase the required computing time. This number is
contained in the <code>AdditionalData</code> structure with a default of 30.
This solver is rather special, and for a detailed explanation you should
-<a href="http://gaia.iwr.uni-heidelberg.de/~deal/doc/auto/kdoc/lac/SolverGMRES.html">take a look at the detailed description of the <code>SolverGMRES</code>
+<a href="../../auto/kdoc/lac/SolverGMRES.html">take a look at the detailed description of the <code>SolverGMRES</code>
class</a>.
</p>