From: schrage Date: Mon, 12 Apr 1999 14:44:50 +0000 (+0000) Subject: Guido's suggestions + added next chapter to navbar X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=25f96a47cce89026d8b36b49ebba0dcec92110df;p=dealii-svn.git Guido's suggestions + added next chapter to navbar git-svn-id: https://svn.dealii.org/trunk@1124 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/tutorial/chapter-1.elements/dofs.html b/deal.II/doc/tutorial/chapter-1.elements/dofs.html index 74daf63d6a..97872f0c7c 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/dofs.html +++ b/deal.II/doc/tutorial/chapter-1.elements/dofs.html @@ -74,7 +74,7 @@ The finite elements used are bilinear. Triangulation<dim> tr; DoFHandler<dim> dof; -FELinear<dim> +FELinear<dim> fe; tr.create_hypercube(-1,1); dof.distribute_dofs(fe); @@ -107,11 +107,16 @@ dof.renumber_dofs(Cuthill_McKey); +

Access to triangulation cells, faces and vertices

+
+ 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 66546074ed..63734c3b8f 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html +++ b/deal.II/doc/tutorial/chapter-1.elements/matrix_generation.html @@ -47,6 +47,9 @@ sm.reinit(smstruct);
+ diff --git a/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html b/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html index 490f2725d7..547f713f24 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html +++ b/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html @@ -20,7 +20,7 @@

Why thinking about matrix structures is important

Many of the matrices encountered when trying to solve systems of differential -equations consist mostly of zeroes. At the same time those matrices are +equations consist mostly of zero entries. At the same time those matrices are very large, and therefore storage is expensive in terms of memory. deal.II attempts to resolve this problem by providing means of generating memory efficient structures for sparse @@ -41,12 +41,13 @@ tell the matrix for which elements to allocate memory.

The deal.II function initializing a standard sparse matrix structure is void SparseMatrixStruct::reinit(const unsigned int m, const unsigned int n, const unsigned int max_per_row). It takes as its arguments -the size of the matrix in question and the maximum number of non-zero elements. +the size of the matrix in question and the maximum number of non-zero elements +in one row. This number can be calculated with int DoFHandler::max_couplings_between_dofs(). This matrix structure can then be used to generate a matrix using void SparseMatrix::reinit(const SparseMatrixStruct &sparsity). -In most cases you will also need to take care of the constraints to your +In cases of locally refined grids you will also need to take care of the constraints to your matrix given by the hanging nodes.

@@ -112,6 +113,9 @@ smstruct.compress();
+ @@ -128,3 +132,4 @@ Last modified: $Date$

+ diff --git a/deal.II/doc/tutorial/chapter-1.elements/toc.html b/deal.II/doc/tutorial/chapter-1.elements/toc.html index a59fe82f90..2740db870c 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/toc.html +++ b/deal.II/doc/tutorial/chapter-1.elements/toc.html @@ -46,7 +46,7 @@ your needs.

Hanging Nodes

-

where hanging nodes are discussed.

+

where locally refined grids are discussed.