add some more documentation

git-svn-id: https://svn.dealii.org/trunk@2569 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/lac/include/lac/solver_minres.h b/deal.II/lac/include/lac/solver_minres.h
index 2e50c305a2120653b80ec71d5ebd045e690b08ac..be9bb510108582935a946c8ee5cd6f08cbaea0bd 100644 (file)
--- a/deal.II/lac/include/lac/solver_minres.h
+++ b/deal.II/lac/include/lac/solver_minres.h
@@ -40,6 +40,11 @@
  *
  * The preconditioner has to be positive definite and symmetric
  *
+ * The algorithm is taken from the Master thesis of Astrid Batterman
+ * with some changes.
+ * The full text can be found at
+ * #http://scholar.lib.vt.edu/theses/public/etd-12164379662151/etd-title.html#
+ *
  * @author Thomas Richter, 2000
  */
 template <class Matrix = SparseMatrix<double>, class Vector = Vector<double> >
@@ -186,10 +191,6 @@ SolverMinRes<Matrix,Vector>::solve (const Matrix &A,
 
                                   // Start of the solving process
   
-                                  // The algorithm is taken from
-                                  // Astrid Battermann, Master thesis
-                                  // with some changes
-
   A.vmult(m[0],x);
   u[1] = b;
   u[1].add(-1.,m[0]);
@@ -201,6 +202,7 @@ SolverMinRes<Matrix,Vector>::solve (const Matrix &A,
   precondition (v,u[1]);
   
   delta[1] = v * u[1];
+                                  // Preconditioner positive
   Assert (delta[1]>=0, ExcPreconditionerNotDefinite());
   
   r0 = sqrt(delta[1]);