Lines Matching refs:fabs
146 sum = sum + fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i]));
147 sum_all = sum_all + fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i]));
148 maximum = std::max(maximum, fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i])));
149 minimum = std::min(minimum, fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i])));
156 } else if (fabs(a[i] - b[i]) > (atol + rtol * fabs(b[i]))) {
157 tol = tol + fabs(a[i] - b[i]) / (fabs(b[i]) + 1);
158 tol1 = tol1 + fabs(a[i] - b[i]);
159 tol2 = tol2 + fabs(a[i] - b[i]) / fabs(b[i]);
170 printf("\n fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
172 printf("\n fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
173 printf("\n fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);
236 sum = sum + fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i]));
237 sum_all = sum_all + fabs(a[i] - b[i]) / (atol + rtol * fabs(b[i]));
239 static_cast<double>(fabs(a[i] - b[i])) / (atol + rtol * fabs(b[i])));
241 static_cast<double>(fabs(a[i] - b[i])) / (atol + rtol * fabs(b[i])));
248 } else if (fabs(a[i] - b[i]) > 0) {
249 tol = tol + fabs(a[i] - b[i]) / (fabs(b[i]) + 1);
250 tol1 = tol1 + fabs(a[i] - b[i]);
251 tol2 = tol2 + fabs(a[i] - b[i]) / fabs(b[i]);
253 printf("%2d", static_cast<int>(fabs(a[i] - b[i])));
260 printf("\n fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
262 printf("\n fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
263 printf("\n fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);