[[Imported from SVN: r9797]]

[[Imported from SVN: r9796]]

[[Imported from SVN: r9795]]

That way, we can now control what vertices are Dirichlet and Neumann without having
to recompile the code.

[[Imported from SVN: r9794]]

This will eventually allow to not hard-wired the Dirichlet vertices
into the C++ code, and change them without recompiling.  This also
means we can remove some preprocessor switches.

Currently, though, the Python code is still hard-wired, so we are
only half-way there.

Note that this patch may break several test problems.  I did not test
all of them.

[[Imported from SVN: r9793]]

[[Imported from SVN: r9792]]

[[Imported from SVN: r9791]]

[[Imported from SVN: r9790]]

[[Imported from SVN: r9789]]

[[Imported from SVN: r9788]]

[[Imported from SVN: r9787]]

[[Imported from SVN: r9786]]

[[Imported from SVN: r9785]]

[[Imported from SVN: r9784]]

[[Imported from SVN: r9781]]

[[Imported from SVN: r9780]]

Instead, only let ADOL-C evaluate the Hessian in the directions
of the vectors of the orthonormal frames.  The result is the same,
but we get away with fewer calls to ADOL-C, which, in my Cosserat
shell example, shaves off about 10% of the assembly time.

[[Imported from SVN: r9779]]

[[Imported from SVN: r9777]]

Otherwise, all processes will write into the same file --> not a good idea.

[[Imported from SVN: r9776]]

[[Imported from SVN: r9775]]

[[Imported from SVN: r9774]]

Make its DirichletValues function a proper Dune VirtualFunction.

Prescribe Dirichlet values for the transverse director, as Neff
does it in his papers.

[[Imported from SVN: r9773]]

[[Imported from SVN: r9771]]

Previously, the matrix was always assembled using a P1-basis, even if we used
it to measure errors of vectors pertaining to P2 or other spaces.  Nobody noticed
this, because the h1SemiNorm routine would not fail if the vector was larger
than the matrix.   Sigh...

[[Imported from SVN: r9770]]

That makes for slightly simpler code.

[[Imported from SVN: r9768]]

[[Imported from SVN: r9767]]

For a general grid, such loops are only possible for codimensions 0
and the grid dimension.

[[Imported from SVN: r9766]]

[[Imported from SVN: r9765]]

[[Imported from SVN: r9764]]

[[Imported from SVN: r9763]]

[[Imported from SVN: r9762]]

GlobalP2Mapper is intended to be for P2 finite element spaces, what
GlobalIndex is for P1 spaces: a numbering for all degrees of freedom
that is globally unique across all processors.

[[Imported from SVN: r9761]]

[[Imported from SVN: r9760]]

Iterators over entities are only mandatory for vertices and elements.
But here the user may also request indices for other entities.
Hence one cannot use a straight iterator.

[[Imported from SVN: r9759]]

No idea why valgrind didn't complain about this.

[[Imported from SVN: r9758]]

Even if there is only one processor.  Because even then the local
and global vectors differ in their ordering.

[[Imported from SVN: r9757]]

Currently only for quadrilaterals.  I'll implement triangles as soon
as I need them.

Unfortunately, VTK appears to only support 8-node quadrilaterals
(without an element dof).  So the element dofs get ignored currently.

[[Imported from SVN: r9756]]

With this patch we start to differentiate according the the function
space bases of the input data.  We write P1 data as is, and downsample
P2 and P3 data onto a P1 space.

[[Imported from SVN: r9755]]

[[Imported from SVN: r9754]]

This makes visualizing wrinkles much easier.

[[Imported from SVN: r9753]]