ENA, Section 1.4, Mentioned, B

Average Error: 7.8 → 0.3

Time: 7.2s

Precision: binary64

Cost: 6720

\[0.999 \leq x \land x \leq 1.001\]

Math

\[\frac{10}{1 - x \cdot x} \]

↓

\[\frac{-10}{\mathsf{fma}\left(x, x, -1\right)} \]

FPCore

(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 (* x x))))

↓

(FPCore (x) :precision binary64 (/ -10.0 (fma x x -1.0)))

C

double code(double x) {
	return 10.0 / (1.0 - (x * x));
}

↓

double code(double x) {
	return -10.0 / fma(x, x, -1.0);
}

Julia

function code(x)
	return Float64(10.0 / Float64(1.0 - Float64(x * x)))
end

↓

function code(x)
	return Float64(-10.0 / fma(x, x, -1.0))
end

Wolfram

code[x_] := N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_] := N[(-10.0 / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.8

   \[\frac{10}{1 - x \cdot x} \]

2. Simplified 0.3

   \[\leadsto \color{blue}{\frac{-10}{\mathsf{fma}\left(x, x, -1\right)}} \]
   Proof
   (/.f64 -10 (fma.f64 x x -1)): 0 points increase in error, 0 points decrease in error
   (/.f64 (Rewrite<= metadata-eval (/.f64 10 -1)) (fma.f64 x x -1)): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 10 -1) (fma.f64 x x (Rewrite<= metadata-eval (neg.f64 1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 10 -1) (Rewrite<= fma-neg_binary64 (-.f64 (*.f64 x x) 1))): 256 points increase in error, 0 points decrease in error
   (Rewrite<= associate-/r*_binary64 (/.f64 10 (*.f64 -1 (-.f64 (*.f64 x x) 1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (Rewrite<= neg-mul-1_binary64 (neg.f64 (-.f64 (*.f64 x x) 1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (Rewrite<= sub0-neg_binary64 (-.f64 0 (-.f64 (*.f64 x x) 1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (Rewrite<= associate-+l-_binary64 (+.f64 (-.f64 0 (*.f64 x x)) 1))): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (+.f64 (Rewrite<= neg-sub0_binary64 (neg.f64 (*.f64 x x))) 1)): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (+.f64 (Rewrite<= distribute-lft-neg-out_binary64 (*.f64 (neg.f64 x) x)) 1)): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (Rewrite<= +-commutative_binary64 (+.f64 1 (*.f64 (neg.f64 x) x)))): 0 points increase in error, 0 points decrease in error
   (/.f64 10 (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 1 (*.f64 x x)))): 0 points increase in error, 0 points decrease in error

3. Final simplification 0.3

   \[\leadsto \frac{-10}{\mathsf{fma}\left(x, x, -1\right)} \]

Alternatives

Alternative 1
Error	7.8
Cost	704

\[\frac{10}{\frac{1}{\frac{1}{1 - x \cdot x}}} \]

Alternative 2
Error	55.4
Cost	580

\[\begin{array}{l} \mathbf{if}\;x \cdot x \leq 1:\\ \;\;\;\;10\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-10}{x}}{x}\\ \end{array} \]

Alternative 3
Error	7.8
Cost	576

\[\frac{1}{\frac{1 - x \cdot x}{10}} \]

Alternative 4
Error	7.8
Cost	576

\[10 \cdot \frac{1}{1 - x \cdot x} \]

Alternative 5
Error	7.8
Cost	448

\[\frac{10}{1 - x \cdot x} \]

Alternative 6
Error	57.9
Cost	64

\[10 \]

Reproduce

herbie shell --seed 2022308 
(FPCore (x)
  :name "ENA, Section 1.4, Mentioned, B"
  :precision binary64
  :pre (and (<= 0.999 x) (<= x 1.001))
  (/ 10.0 (- 1.0 (* x x))))