From 97cd98f4d7f295625fa7f110e2514b310639264a Mon Sep 17 00:00:00 2001 From: richter Date: Wed, 8 Mar 2000 14:34:02 +0000 Subject: [PATCH] add some more documentation git-svn-id: https://svn.dealii.org/trunk@2569 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/lac/include/lac/solver_minres.h | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/deal.II/lac/include/lac/solver_minres.h b/deal.II/lac/include/lac/solver_minres.h index 2e50c305a2..be9bb51010 100644 --- 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 Vector = Vector > @@ -186,10 +191,6 @@ SolverMinRes::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::solve (const Matrix &A, precondition (v,u[1]); delta[1] = v * u[1]; + // Preconditioner positive Assert (delta[1]>=0, ExcPreconditionerNotDefinite()); r0 = sqrt(delta[1]); -- 2.39.5