From: Wolfgang Bangerth Date: Wed, 30 Apr 2003 23:07:00 +0000 (+0000) Subject: Use std:: where necessary. X-Git-Tag: v8.0.0~16614 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=7f0e4df4375670057f9a94a6a6b3f01f0f7a0928;p=dealii.git 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 b318698b32..9f0de94336 100644 --- a/deal.II/lac/include/lac/solver_qmrs.h +++ b/deal.II/lac/include/lac/solver_qmrs.h @@ -20,6 +20,9 @@ #include #include +#include + + /** * QMRS method. * @@ -205,7 +208,7 @@ template double SolverQMRS::criterion() { - return sqrt(res2); + return std::sqrt(res2); } @@ -335,7 +338,7 @@ SolverQMRS::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::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;