From: schrage Date: Tue, 23 Mar 1999 15:05:08 +0000 (+0000) Subject: FE program structure: Explanation and TOC X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=f104ab69295390ab4ed02e6e18fcdf49d1f77919;p=dealii-svn.git FE program structure: Explanation and TOC git-svn-id: https://svn.dealii.org/trunk@1037 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/tutorial/chapter-1.elements/index.html b/deal.II/doc/tutorial/chapter-1.elements/index.html new file mode 100644 index 0000000000..7689217575 --- /dev/null +++ b/deal.II/doc/tutorial/chapter-1.elements/index.html @@ -0,0 +1,111 @@ + + + +Structure of a Finite Element Program + + + + + + +

Structure of a Finite Element Program

+ +

About this tutorial

+This part of the deal.II 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 +in that respect offered by deal.II. The order of +the table of contents below reflects the order in which +you need to do perform the tasks. Some things may be left out according to +your needs. + +

Table of contents

+ +
    +
  1. + Creation of a grid +

    dealing with grid creation, grid input from a file and grid + refinement. + The various kinds of grid are also discussed. +

    +
  2. + +
  3. + Degrees of Freedom +

    where degrees of freedom are distriuted and numbered.

    +
  4. + +
  5. + Hanging Nodes +

    where hanging nodes are discussed.

    +
  6. + +
  7. + Matrix Structure +

    where efficient structures for sparse matrices are discussed.

    +
  8. + +
  9. + Matrix and Vector Generation +

    where the different kinds of matrices and vectors are discussed.

    +
  10. + +
  11. + The Problem Matrix and the Right Hand Side +

    which shows how to implement a particular problem.

    +
  12. + +
  13. + Boundary Conditions +

    which shows how to set boundary conditions in deal.II.

    +
  14. + +
  15. + Condensing the Hanging Nodes +

    which shows how, when and why to condense hanging nodes.

    +
  16. + +
  17. + Solving the Problem +

    explaining the different solvers available and how to use them.

    +
  18. + +
  19. + Postprocessing +

    where the data is postprocessed and stored and the error + is calculated. +

    +
  20. + +
  21. + Error Estimate and Adaptivity +

    explaining how to use adaptive refinement with error estimates.

    +
  22. + +
  23. + Parameter Input +

    explaining how to use a parameter file for configuration + of your program. +

    +
  24. +
+ +
+ +

+Back to the tutorial index +

+
+
+Jan Schrage
+

+Last modified: Tue 9 Mar 1999 +

+ + + + + + +