[[Imported from SVN: r9721]]

Christian Engwer told me a trick how to get the mpiHelper instance without
known argc and argv.

[[Imported from SVN: r9720]]

That way we can handle multigrid transfer matrices as well.

[[Imported from SVN: r9719]]

The globalindex.hh and uniqueentitypartition.hh is from Benedikt Oswald.
The rest is from Benjamin Bykowski, with a few fixes from me.

The globalindex stuff should go into dune-grid eventually, but it needs
some polishing first.

[[Imported from SVN: r9718]]

[[Imported from SVN: r9710]]

[[Imported from SVN: r9709]]

[[Imported from SVN: r9708]]

This does what we want both on one and on many processors.

[[Imported from SVN: r9707]]

This has two advantages:
- The two matrices use different number types (adouble vs. double),
  but the generic multiplication in dune/istl/matrix.hh doesn't support
  that.  Hence before this change I had to patch dune-istl.
- It avoids one extra copying operation

[[Imported from SVN: r9703]]

[[Imported from SVN: r9702]]

[[Imported from SVN: r9701]]

[[Imported from SVN: r9693]]

[[Imported from SVN: r9692]]

With the better initial iterate introduced in the previous patch,
this lower number seems to be sufficient.

[[Imported from SVN: r9684]]

The new initial iterate is constructed by interpolating the values in Euclidean
space, and projecting back onto TargetSpace.  This has two advantages:
1) It's a better initial iterate, so we should converge faster than starting
   from coefficients_[0]
2) It makes it easier for ADOL-C to pick up correct second derivatives.
   Hence we are able to reduce the minimum number of iterations of the
   target space tr solver.

[[Imported from SVN: r9683]]

[[Imported from SVN: r9682]]

[[Imported from SVN: r9681]]

[[Imported from SVN: r9680]]

[[Imported from SVN: r9670]]

[[Imported from SVN: r9669]]

[[Imported from SVN: r9668]]

[[Imported from SVN: r9667]]

[[Imported from SVN: r9666]]

That way, they can at least be looked at.  You won't see the intra-element
details, but frequently they are not even all this important.  Proper
subsampling of higher-order functions is more difficult and has to wait
for another day.

[[Imported from SVN: r9665]]

[[Imported from SVN: r9664]]

[[Imported from SVN: r9663]]

This will be generalized to take any Lagrange basis, to allow some form
of visualization for higher-order functions.

[[Imported from SVN: r9662]]

[[Imported from SVN: r9661]]

[[Imported from SVN: r9660]]

[[Imported from SVN: r9659]]

[[Imported from SVN: r9658]]

[[Imported from SVN: r9657]]

This prepares for a later switch to a second-order basis

[[Imported from SVN: r9656]]

[[Imported from SVN: r9655]]

[[Imported from SVN: r9654]]

[[Imported from SVN: r9653]]

Use its size rather than the number of grid vertices

[[Imported from SVN: r9652]]

Adjust values of the shearing/wrinkling problem to the values given in the Taylor/Bertoldi/Steigmann paper

[[Imported from SVN: r9651]]

This move more than halfs the size of this file, and makes it *much* easier
to understand.  If we ever need the gradient code we can still recover it
from the 2.3-2 branch.

[[Imported from SVN: r9650]]

[[Imported from SVN: r9649]]