Average Error: 0.0 → 0.0
Time: 534.0ms
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[\left(x \cdot x\right) \cdot 2 - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
\left(x \cdot x\right) \cdot 2 - 1
double f(double x) {
        double r56511 = x;
        double r56512 = r56511 * r56511;
        double r56513 = 2.0;
        double r56514 = r56512 * r56513;
        double r56515 = 1.0;
        double r56516 = r56514 - r56515;
        return r56516;
}
↓
double f(double x) {
        double r56517 = x;
        double r56518 = r56517 * r56517;
        double r56519 = 2.0;
        double r56520 = r56518 * r56519;
        double r56521 = 1.0;
        double r56522 = r56520 - r56521;
        return r56522;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot x\right) \cdot 2 - 1\]

Reproduce

herbie shell --seed 2020002 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))