?

Average Accuracy: 99.8% → 99.7%
Time: 6.4s
Precision: binary64
Cost: 704

?

\[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
\[1 + \left(x \cdot -0.253 - 0.12 \cdot \left(x \cdot x\right)\right) \]
(FPCore (x) :precision binary64 (- 1.0 (* x (+ 0.253 (* x 0.12)))))
(FPCore (x) :precision binary64 (+ 1.0 (- (* x -0.253) (* 0.12 (* x x)))))
double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}
double code(double x) {
	return 1.0 + ((x * -0.253) - (0.12 * (x * x)));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 - (x * (0.253d0 + (x * 0.12d0)))
end function
real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 + ((x * (-0.253d0)) - (0.12d0 * (x * x)))
end function
public static double code(double x) {
	return 1.0 - (x * (0.253 + (x * 0.12)));
}
public static double code(double x) {
	return 1.0 + ((x * -0.253) - (0.12 * (x * x)));
}
def code(x):
	return 1.0 - (x * (0.253 + (x * 0.12)))
def code(x):
	return 1.0 + ((x * -0.253) - (0.12 * (x * x)))
function code(x)
	return Float64(1.0 - Float64(x * Float64(0.253 + Float64(x * 0.12))))
end
function code(x)
	return Float64(1.0 + Float64(Float64(x * -0.253) - Float64(0.12 * Float64(x * x))))
end
function tmp = code(x)
	tmp = 1.0 - (x * (0.253 + (x * 0.12)));
end
function tmp = code(x)
	tmp = 1.0 + ((x * -0.253) - (0.12 * (x * x)));
end
code[x_] := N[(1.0 - N[(x * N[(0.253 + N[(x * 0.12), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[x_] := N[(1.0 + N[(N[(x * -0.253), $MachinePrecision] - N[(0.12 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
1 + \left(x \cdot -0.253 - 0.12 \cdot \left(x \cdot x\right)\right)

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 99.8%

    \[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
  2. Applied egg-rr99.7%

    \[\leadsto 1 - \color{blue}{\left(x \cdot 0.253 + 0.12 \cdot \left(x \cdot x\right)\right)} \]
  3. Final simplification99.7%

    \[\leadsto 1 + \left(x \cdot -0.253 - 0.12 \cdot \left(x \cdot x\right)\right) \]

Alternatives

Alternative 1
Accuracy97.1%
Cost585
\[\begin{array}{l} \mathbf{if}\;x \leq -4.1 \lor \neg \left(x \leq 2\right):\\ \;\;\;\;\left(x \cdot x\right) \cdot -0.12\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
Alternative 2
Accuracy97.7%
Cost585
\[\begin{array}{l} \mathbf{if}\;x \leq -4.1 \lor \neg \left(x \leq 2\right):\\ \;\;\;\;\left(x \cdot x\right) \cdot -0.12\\ \mathbf{else}:\\ \;\;\;\;1 + x \cdot -0.253\\ \end{array} \]
Alternative 3
Accuracy99.8%
Cost576
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right) \]
Alternative 4
Accuracy97.1%
Cost448
\[1 - 0.12 \cdot \left(x \cdot x\right) \]
Alternative 5
Accuracy65.3%
Cost64
\[1 \]

Error

Reproduce?

herbie shell --seed 2023141 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1.0 (* x (+ 0.253 (* x 0.12)))))