Improved breakdown criterion?

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

diff --git a/deal.II/lac/include/lac/solver_qmrs.h b/deal.II/lac/include/lac/solver_qmrs.h
index 8cf343f4b15ebc41e93813725b3e74c5b0b74025..356a30fe13923702e08e85ab974d729dda5a2716 100644 (file)
--- a/deal.II/lac/include/lac/solver_qmrs.h
+++ b/deal.II/lac/include/lac/solver_qmrs.h
@@ -326,10 +326,10 @@ while (state == SolverControl::iterate)
       A.vmult(t,q);
                                       // Step 2
       sigma = q*t;
-
+      
 //TODO: Find a really good breakdown criterion
 // The absolute one detects breakdown instead of convergence
-      if (fabs(sigma) < additional_data.breakdown)
+      if (fabs(sigma/rho) < additional_data.breakdown)
        return breakdown;
                                       // Step 3
       alpha = rho/sigma;