Use std:: where necessary.

git-svn-id: https://svn.dealii.org/trunk@7524 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 b318698b3283493821573b1aef218ec6207dce6e..9f0de9433647ce5f41e8e77d056bf0f81515079c 100644 (file)
--- a/deal.II/lac/include/lac/solver_qmrs.h
+++ b/deal.II/lac/include/lac/solver_qmrs.h
@@ -20,6 +20,9 @@
 #include <cmath>
 #include <base/subscriptor.h>
 
+#include <cmath>
+
+
 /**
  * QMRS method.
  *
@@ -205,7 +208,7 @@ template<class VECTOR>
 double
 SolverQMRS<VECTOR>::criterion()
 {
-  return sqrt(res2);
+  return std::sqrt(res2);
 }
 
 
@@ -335,7 +338,7 @@ SolverQMRS<VECTOR>::iterate(const MATRIX         &A,
       sigma = q*t;
       
 //TODO:[?] Find a really good breakdown criterion. The absolute one detects breakdown instead of convergence
-      if (fabs(sigma/rho) < additional_data.breakdown)
+      if (std::fabs(sigma/rho) < additional_data.breakdown)
        return true;
                                       // Step 3
       alpha = rho/sigma;
@@ -359,13 +362,13 @@ SolverQMRS<VECTOR>::iterate(const MATRIX         &A,
          res = q.l2_norm();
        }
       else
-       res = sqrt((it+1)*tau);
+       res = std::sqrt((it+1)*tau);
       state = this->control().check(step,res);
       if ((state == SolverControl::success)
       || (state == SolverControl::failure))
        return false;
                                       // Step 6
-      if (fabs(rho) < additional_data.breakdown)
+      if (std::fabs(rho) < additional_data.breakdown)
        return true;
                                       // Step 7
       rho_old = rho;