<h1>Structure of a Finite Element Program</h1>
<h2>About this tutorial</h2>
+<p>
This part of the <acronym>deal.II</acronym> documentation will discuss
how to build a finite element program. We will take a look at the general
structure of programs of this kind and at the various possibilities
the <a href="#toc">table of contents</a> below reflects the order in which
you need to do perform the tasks. Some things may be left out according to
your needs.
+</p>
<h2><a name="toc">Table of contents</a></h2>
<ol>
<li>
- <b><a href="grid_creation.html">Creation of a grid</a></b>
+ <p>
+ <b><a href="grid_creation.html">Creation of a grid</a></b>
+ </p>
<p>dealing with grid creation, grid input from a file and grid
refinement.
The various kinds of grid are also discussed.
</li>
<li>
- <b><a href="dofs.html">Degrees of Freedom</a></b>
+ <p>
+ <b><a href="dofs.html">Degrees of Freedom</a></b>
+ </p>
<p>where degrees of freedom are distriuted and numbered.</p>
</li>
<li>
- <b><a href="hanging_nodes.html">Hanging Nodes</a></b>
+ <p>
+ <b><a href="hanging_nodes.html">Hanging Nodes</a></b>
+ </p>
<p>where hanging nodes are discussed.</p>
</li>
<li>
- <b><a href="matrix_structure.html">Matrix Structure</a></b>
+ <p>
+ <b><a href="matrix_structure.html">Matrix Structure</a></b>
+ </p>
<p>where efficient structures for sparse matrices are discussed.</p>
</li>
<li>
- <b><a href="matrix_generation.html">Matrix and Vector Generation</a></b>
+ <p>
+ <b><a href="matrix_generation.html">Matrix and Vector Generation</a></b>
+ </p>
<p>where the different kinds of matrices and vectors are discussed.</p>
</li>
<li>
- <b><a href="rhs.html">The Problem Matrix and the Right Hand Side</a></b>
+ <p>
+ <b><a href="rhs.html">The Problem Matrix and the Right Hand Side</a></b>
+ </p>
<p>which shows how to implement a particular problem.</p>
</li>
<li>
- <b><a href="boundary.html">Boundary Conditions</a></b>
+ <p>
+ <b><a href="boundary.html">Boundary Conditions</a></b>
+ </p>
<p>which shows how to set boundary conditions in deal.II.</p>
</li>
<li>
- <b><a href="condense.html">Condensing the Hanging Nodes</a></b>
+ <p>
+ <b><a href="condense.html">Condensing the Hanging Nodes</a></b>
+ </p>
<p>which shows how, when and why to condense hanging nodes.</p>
</li>
<li>
- <b><a href="solve.html">Solving the Problem</a></b>
+ <p>
+ <b><a href="solve.html">Solving the Problem</a></b>
+ </p>
<p>explaining the different solvers available and how to use them.</p>
</li>
<li>
- <b><a href="postprocess.html">Postprocessing</a></b>
+ <p>
+ <b><a href="postprocess.html">Postprocessing</a></b>
+ </p>
<p>where the data is postprocessed and stored and the error
is calculated.
</p>
</li>
<li>
- <b><a href="adaptivity.html">Error Estimate and Adaptivity</a></b>
+ <p>
+ <b><a href="adaptivity.html">Error Estimate and Adaptivity</a></b>
+ </p>
<p>explaining how to use adaptive refinement with error estimates.</p>
</li>
<li>
- <b><a href="parameters.html">Parameter Input</a></b>
+ <p>
+ <b><a href="parameters.html">Parameter Input</a></b>
+ </p>
<p>explaining how to use a parameter file for configuration
of your program.
</p>
<hr>
-<p>
-<a href="../index.html">Back to the tutorial index</a>
-</p>
+<table>
+<tr>
+ <td>
+ <a href="index.html">Back to this chapter's index</a>
+ </td>
+ <td>
+ <a href="../index.html">Back to the tutorial index</a>
+ </td>
+</tr>
+</table>
<hr>
<address>
<a href="mailto:schrage@gaia.iwr.uni-heidelberg.de">Jan Schrage</a></address>