The hasObstacle_ and obstacles_ fields are now single arrays.
The corresponding fields for the entire grid hierarchy is assembled
within dune-solvers now.

[[Imported from SVN: r9816]]

[[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: r9765]]

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

[[Imported from SVN: r9757]]

The Dirichlet nodes are handled directly via the ignoreNodes_ field.
I don't know how the matrix modification code ever got in here.

Removing the code doesn't seem to make any difference.  I find that
a bit surprising: I would expect multigrid and IPOpt to work better
if the matrix is truly symmetric.

[[Imported from SVN: r9742]]

Much easier to use than the previous API.

[[Imported from SVN: r9735]]

[[Imported from SVN: r9734]]

[[Imported from SVN: r9732]]

[[Imported from SVN: r9731]]

[[Imported from SVN: r9729]]

After much back and forth: this is the correct way.  This size cannot
be taken from the transfer operators, because these operators exist
only if there is more than one level.

[[Imported from SVN: r9728]]

[[Imported from SVN: r9727]]

[[Imported from SVN: r9726]]

That works for fe spaces of all orders.

[[Imported from SVN: r9725]]

[[Imported from SVN: r9724]]

[[Imported from SVN: r9723]]

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

[[Imported from SVN: r9720]]

[[Imported from SVN: r9710]]

[[Imported from SVN: r9614]]

We have the correct value in the variable 'oldEnergy' anyway.

[[Imported from SVN: r9575]]

Because the gradient is needed anyway when computing the Hesse matrix.
Not computing it separately a second time shaves off about 8% wall time
of each iteration.

[[Imported from SVN: r9555]]

[[Imported from SVN: r9451]]

And set the inner loop solver verbosity to QUIET

[[Imported from SVN: r9435]]

This number is nowadays infered from the number of transfer operators.

[[Imported from SVN: r9432]]

Since ADOL-C is not multi-threaded we will not be using OpenMP
in the foreseeable future.  And on a single-threaded code the
OpenMP timer and the Dune timer return the same values anyway.

[[Imported from SVN: r9431]]

[[Imported from SVN: r9393]]

These were only there to hack our way around a bug in the
interface of the Rotation class.  This bug has been fixed
quite a while ago.

[[Imported from SVN: r9293]]

[[Imported from SVN: r9292]]

    
The Dune timers do not return wall time when using thread parallelism.

[[Imported from SVN: r9283]]

[[Imported from SVN: r8983]]

[[Imported from SVN: r8982]]

[[Imported from SVN: r8981]]

Another easy patch which makes the code a lot faster.

Also, this patch removes the quasi-Newton code.  So far that code
hasn't helped at all.  Quasi-Newton methods will need more work
in the future.

[[Imported from SVN: r8588]]

[[Imported from SVN: r8330]]

[[Imported from SVN: r8277]]

[[Imported from SVN: r8261]]

[[Imported from SVN: r8234]]

[[Imported from SVN: r7960]]