Conceptually cleaner, and makes for simpler code.  Most importantly, we will want
to pass the Basis::LocalView to the local assemblers.  For that we need the actual
basis, not just the grid view and local finite element.

[[Imported from SVN: r10082]]

[[Imported from SVN: r10081]]

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]]

This is the first step towards moving to the dune-functions bases completely.

[[Imported from SVN: r10079]]

I am puzzled that this worked at all previously.

[[Imported from SVN: r10078]]

This is needed with the cmake build system.  I do not want to
debug this today.

[[Imported from SVN: r10075]]

While we are there, set all the flags in a loop, so we don't have
to keep copying boilerplate code as the number of programs to build
increases.

[[Imported from SVN: r10074]]

Some of these Python functions are so long that you cannot reasonably keep
them in a single string in a ParameterTree entry.  To be more flexible here
the initial iterate function is now expected in a separate file.

[[Imported from SVN: r10066]]

[[Imported from SVN: r10064]]

[[Imported from SVN: r10063]]

[[Imported from SVN: r10062]]

[[Imported from SVN: r10061]]

[[Imported from SVN: r10050]]

Nobody uses Amira, so the AmiraMesh format is obsolete.

[[Imported from SVN: r10049]]

[[Imported from SVN: r10048]]

[[Imported from SVN: r10037]]

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]]

Kudos to Carsten Gräser for those new Python functions.

[[Imported from SVN: r10028]]

[[Imported from SVN: r10027]]

[[Imported from SVN: r10026]]

[[Imported from SVN: r10025]]

This is only a prototype, because the GFE solution function is replaced by
on where the interpolation is done in the embedding space.  That defeats the
purpose of measuring the GFE discretization error :-) but it is easier to
implement.  The real thing will follow shortly.

[[Imported from SVN: r10023]]

[[Imported from SVN: r10022]]

We can do it without the preprocessor.

[[Imported from SVN: r10021]]

I don't think I will need that again in the foreseeable future.
If ever it should be needed again the code can be taken from the
subversion archive.

[[Imported from SVN: r10020]]

The plan is to minimize the harmonic energy starting from the inverse
stereographic projection.  That projection already is the minimizer
of the energy, so it should be possible to measure convergence orders
against a known solution.

[[Imported from SVN: r10019]]

Do not fall back to 'harmonicmaps.parset' by default.

[[Imported from SVN: r10018]]

[[Imported from SVN: r10017]]

[[Imported from SVN: r10016]]

[[Imported from SVN: r10015]]

[[Imported from SVN: r10014]]

[[Imported from SVN: r10013]]

[[Imported from SVN: r10012]]

[[Imported from SVN: r10011]]

... so much difficult code obsolete now... AD rocks...

[[Imported from SVN: r10010]]

[[Imported from SVN: r10009]]

[[Imported from SVN: r10008]]

This is much more flexible and *much* easier to use.

Along the way, this patch scraps several old hard-coded Dirichlet boundary
values.  I don't even remember what they were good for.  If they are needed
again they should also be reimplemented in Python.

[[Imported from SVN: r10007]]

According to Christof Melcher, this produces a field of topological
charge q=1  (or -1, not sure).

[[Imported from SVN: r10006]]

[[Imported from SVN: r10005]]