[[Imported from SVN: r1069]]

[[Imported from SVN: r1068]]

Both do not do any error checking.
Introduced at method that does the same but checks for errors.

[[Imported from SVN: r1067]]

[[Imported from SVN: r1066]]

[[Imported from SVN: r1065]]

information. This needed whenever one wants to add new indices to
the underlying index sets and does not want to recompute the remote
index information.

[[Imported from SVN: r1064]]

Please merge to release.

[[Imported from SVN: r1063]]

parameter is the global id. Additionally omit the second parameter as
it is not needed.

[[Imported from SVN: r1062]]

[[Imported from SVN: r1061]]

[[Imported from SVN: r1060]]

[[Imported from SVN: r1059]]

[[Imported from SVN: r1058]]

[[Imported from SVN: r1057]]

[[Imported from SVN: r1056]]

calculate max distance correctly. 
neigbours method no visits the neighbour and counts them instead of
just returning (0,0). (Fixes the rounding step for the aggregates.)

[[Imported from SVN: r1055]]

- Compiles with g++-4,4 now. Error was error: declaration of
  ‘Dune::SuperLUMatrix<Dune::BCRSMatrix<Dune::FieldMatrix<K, n, p>,
  TA> >& m’shadows template parm ‘int m’ 
  Fixes flyspray #581

- Removed wrong assertion. One should not check whether the whole
  matrix is copied if one just copies a part of it. (Blame copy & paste)

[[Imported from SVN: r1053]]

[[Imported from SVN: r1052]]

[[Imported from SVN: r1049]]

[[Imported from SVN: r1047]]

[[Imported from SVN: r1046]]

The matrix type is also used for the ILU member variable, which is
initialised with a copy of the matrix and then inclompletely LU
decomposed.  This member variable must not be const.

[[Imported from SVN: r1045]]

When initializing coarse aggregate number for visualization make sure that each number is used only once and number are consecutive from 0 but still randomly distributed.

[[Imported from SVN: r1044]]

Randomize coarsest aggregate numbers to get better contrast between
aggregates.

[[Imported from SVN: r1043]]

[[Imported from SVN: r1042]]

[[Imported from SVN: r1041]]

[[Imported from SVN: r1040]]

[[Imported from SVN: r1039]]

local problem on the fly at each step.

ATTENTION: Semantics changed. The default is now the on the fly
computation (which saves quite some memory).

[[Imported from SVN: r1038]]

[[Imported from SVN: r1037]]

Project coarsest aggregates to finest level for visualization.

[[Imported from SVN: r1035]]

        MINRES was added)

[[Imported from SVN: r1034]]

as expected!

[[Imported from SVN: r1033]]

[[Imported from SVN: r1032]]

[[Imported from SVN: r1031]]

[[Imported from SVN: r1030]]

[[Imported from SVN: r1029]]

patch by Andreas Lauser

[[Imported from SVN: r1028]]

We need to set the overlap to zero on the coarse levels to avoid
degradation of convergence for coarse levels.

[[Imported from SVN: r1026]]

[[Imported from SVN: r1025]]

[[Imported from SVN: r1024]]