A lot of raw pointers have been replaced by std::shared_ptr.

A lot of data members are inaccessible now, and getters have
to be used.

A small patch is still needed for dune-solvers: The iterationStep_
member is still needed to be public, because the new getter only
grants access to the object, not the pointer to it.

It still tested for the dune-fufem wrapper of a first-order basis, while nowadays
the RiemannianTRSolver class is instantiated with dune-functions bases.

[[Imported from SVN: r10100]]

[[Imported from SVN: r10089]]

At least the harmonicmaps.cc example still works as before.
[caveat: only tested without HAVE_MPI]
Internally, at various places in the code, a dune-fufem basis is still constructed
from the dune-functions one.  These parts can be ported one by one, as dune-fufem
slowly replaces its own bases by the ones from dune-functions.

[[Imported from SVN: r10080]]

Patch by Jonathan Youett

[[Imported from SVN: r10056]]

This is a fall-out from the recent move to use all the parallel code
only when HAVE_MPI is set.  Very ugly, but I still don't know any other
way to have P3 spaces.

Patch by Jonathan Youett

[[Imported from SVN: r10054]]

I don't see an elegant way to make this work for a P3 space, even on a single
processor.  Since I need P3 measurements real soon now, I just disable the
entire code.  Not nice.

[[Imported from SVN: r10047]]

The multigrid hierarchy is built in two different ways, depending on whether
we use a P1NodalBasis for the discretization, or anything else.  Previously,
this switch was made using the preprocessor.  The patches changes the code
to use std::is_same instead.

[[Imported from SVN: r10046]]

This is much cleaner than handing over the Grid only, and then trying
to guess the basis using the preprocessor.  After all, the
RiemannianTrustRegionSolver calls the assembler, so it may know the
function space basis.

[[Imported from SVN: r10035]]

[[Imported from SVN: r10033]]

[[Imported from SVN: r9995]]

[[Imported from SVN: r9994]]

There is no need to have our own implementation for this, we had it purely for
historical reasons.

Also, this change fixes a subtle bug:  Our own implementation used AlienElementLocalBasis,
which returns zero if the LocalBasis is evaluated outside of the reference element.
However, this happened sometimes due to rounding error on grids with very small quadrilateral
elements.

[[Imported from SVN: r9991]]

[[Imported from SVN: r9990]]

[[Imported from SVN: r9965]]

Previously, the number of multigrid transfer operators was always equal to
the number of grid levels minus one.  That worked out correctly when doing
first-order FE spaces.  However, for higher-order spaces, the up-most transfer
operator transfers from the higher-order space to a first-order space
_on the same grid level_.  But since the total number of transfer operators
was grid levels minus one, this implied that the coarsest grid leve 
was never used, and the coarse grid solver would operate on the second-coarsest
grid.

This patch adds the extra transfer operator in this case.  That means we now
call the coarse grid solver on smaller problems, which makes a noticeable
run-time difference.

[[Imported from SVN: r9964]]

[[Imported from SVN: r9963]]

Normally, the two different level grid views.  Previously we used the same one
to compute the localToGlobal renumbering for boths rows and columns.  Of course
that screws up the numbering.

I am not quite sure when that got introduced.  I may have gotten in fairly recently,
after the upstreaming of the GlobalIndexSet classs.

[[Imported from SVN: r9962]]

[[Imported from SVN: r9954]]

Because it is not an index, it really is a mapper.

[[Imported from SVN: r9953]]

[[Imported from SVN: r9936]]

In particular this means having to carry mappers for the local indices around.
This makes the code more verbose, but it also makes it easier to see what is
happening.  While coding this stuff I keep having doubts about whether all
the renumbering works correctly...

[[Imported from SVN: r9925]]

The local copy was to get the thing developed and working.  Now that it is
working we upstream it into dune-grid.

[[Imported from SVN: r9922]]

The IndexSet interface class from dune-grid doesn't have it, and we want
to be like the interface method as much as possible.

[[Imported from SVN: r9921]]

[[Imported from SVN: r9918]]

[[Imported from SVN: r9917]]

[[Imported from SVN: r9909]]

[[Imported from SVN: r9890]]

dune-solvers actually does provide a way to set these matrices directly.
I simply didn't find it until recently.

[[Imported from SVN: r9885]]

[[Imported from SVN: r9881]]

[[Imported from SVN: r9878]]

[[Imported from SVN: r9868]]

[[Imported from SVN: r9854]]

Gauss-Seidel converges equally good/bad as IPOpt, but it is much faster.

[[Imported from SVN: r9839]]

[[Imported from SVN: r9838]]

Previously the energy norm was used, but as we are solving non-convex
problems the Hessians may be indefinite, and then the EnergyNorm is not
a norm.

[[Imported from SVN: r9835]]

[[Imported from SVN: r9817]]