ENA, Section 1.4, Mentioned, B

Percentage Accurate: 87.8% → 99.6%
Time: 12.7s
Alternatives: 4
Speedup: 1.1×

Specification

?
\[0.999 \leq x \land x \leq 1.001\]
\[\begin{array}{l} \\ \frac{10}{1 - x \cdot x} \end{array} \]
(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 (* x x))))
double code(double x) {
	return 10.0 / (1.0 - (x * x));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0 / (1.0d0 - (x * x))
end function
public static double code(double x) {
	return 10.0 / (1.0 - (x * x));
}
def code(x):
	return 10.0 / (1.0 - (x * x))
function code(x)
	return Float64(10.0 / Float64(1.0 - Float64(x * x)))
end
function tmp = code(x)
	tmp = 10.0 / (1.0 - (x * x));
end
code[x_] := N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{10}{1 - x \cdot x}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 4 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 87.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{10}{1 - x \cdot x} \end{array} \]
(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 (* x x))))
double code(double x) {
	return 10.0 / (1.0 - (x * x));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0 / (1.0d0 - (x * x))
end function
public static double code(double x) {
	return 10.0 / (1.0 - (x * x));
}
def code(x):
	return 10.0 / (1.0 - (x * x))
function code(x)
	return Float64(10.0 / Float64(1.0 - Float64(x * x)))
end
function tmp = code(x)
	tmp = 10.0 / (1.0 - (x * x));
end
code[x_] := N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{10}{1 - x \cdot x}
\end{array}

Alternative 1: 99.6% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{-10}{\mathsf{fma}\left(x, x, -1\right)} \end{array} \]
(FPCore (x) :precision binary64 (/ -10.0 (fma x x -1.0)))
double code(double x) {
	return -10.0 / fma(x, x, -1.0);
}
function code(x)
	return Float64(-10.0 / fma(x, x, -1.0))
end
code[x_] := N[(-10.0 / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{-10}{\mathsf{fma}\left(x, x, -1\right)}
\end{array}
Derivation
  1. Initial program 87.6%

    \[\frac{10}{1 - x \cdot x} \]
  2. Add Preprocessing
  3. Applied rewrites99.6%

    \[\leadsto \color{blue}{\frac{-10}{\mathsf{fma}\left(x, x, -1\right)}} \]
  4. Add Preprocessing

Alternative 2: 18.8% accurate, 1.3× speedup?

\[\begin{array}{l} \\ \frac{10}{1 - x} \end{array} \]
(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 x)))
double code(double x) {
	return 10.0 / (1.0 - x);
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0 / (1.0d0 - x)
end function
public static double code(double x) {
	return 10.0 / (1.0 - x);
}
def code(x):
	return 10.0 / (1.0 - x)
function code(x)
	return Float64(10.0 / Float64(1.0 - x))
end
function tmp = code(x)
	tmp = 10.0 / (1.0 - x);
end
code[x_] := N[(10.0 / N[(1.0 - x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{10}{1 - x}
\end{array}
Derivation
  1. Initial program 87.6%

    \[\frac{10}{1 - x \cdot x} \]
  2. Add Preprocessing
  3. Applied rewrites99.6%

    \[\leadsto \color{blue}{\frac{-10}{\mathsf{fma}\left(x, x, -1\right)}} \]
  4. Step-by-step derivation
    1. lift-fma.f64N/A

      \[\leadsto \frac{-10}{\color{blue}{\mathsf{fma}\left(x, x, -1\right)}} \]
    2. frac-2negN/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(-10\right)}{\mathsf{neg}\left(\mathsf{fma}\left(x, x, -1\right)\right)}} \]
    3. metadata-evalN/A

      \[\leadsto \frac{\color{blue}{10}}{\mathsf{neg}\left(\mathsf{fma}\left(x, x, -1\right)\right)} \]
    4. lift-fma.f64N/A

      \[\leadsto \frac{10}{\mathsf{neg}\left(\color{blue}{\left(x \cdot x + -1\right)}\right)} \]
    5. difference-of-sqr--1N/A

      \[\leadsto \frac{10}{\mathsf{neg}\left(\color{blue}{\left(x + 1\right) \cdot \left(x - 1\right)}\right)} \]
    6. distribute-rgt-neg-inN/A

      \[\leadsto \frac{10}{\color{blue}{\left(x + 1\right) \cdot \left(\mathsf{neg}\left(\left(x - 1\right)\right)\right)}} \]
    7. associate-/r*N/A

      \[\leadsto \color{blue}{\frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\left(x - 1\right)\right)}} \]
    8. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\left(x - 1\right)\right)}} \]
    9. lower-/.f64N/A

      \[\leadsto \frac{\color{blue}{\frac{10}{x + 1}}}{\mathsf{neg}\left(\left(x - 1\right)\right)} \]
    10. lower-+.f64N/A

      \[\leadsto \frac{\frac{10}{\color{blue}{x + 1}}}{\mathsf{neg}\left(\left(x - 1\right)\right)} \]
    11. flip--N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\color{blue}{\frac{x \cdot x - 1 \cdot 1}{x + 1}}\right)} \]
    12. metadata-evalN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\frac{x \cdot x - \color{blue}{1}}{x + 1}\right)} \]
    13. difference-of-sqr-1N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\frac{\color{blue}{\left(x + 1\right) \cdot \left(x - 1\right)}}{x + 1}\right)} \]
    14. difference-of-sqr--1N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\frac{\color{blue}{x \cdot x + -1}}{x + 1}\right)} \]
    15. lift-fma.f64N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\mathsf{neg}\left(\frac{\color{blue}{\mathsf{fma}\left(x, x, -1\right)}}{x + 1}\right)} \]
    16. distribute-neg-fracN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\color{blue}{\frac{\mathsf{neg}\left(\mathsf{fma}\left(x, x, -1\right)\right)}{x + 1}}} \]
    17. neg-sub0N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{\color{blue}{0 - \mathsf{fma}\left(x, x, -1\right)}}{x + 1}} \]
    18. lift-fma.f64N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{0 - \color{blue}{\left(x \cdot x + -1\right)}}{x + 1}} \]
    19. lift-*.f64N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{0 - \left(\color{blue}{x \cdot x} + -1\right)}{x + 1}} \]
    20. +-commutativeN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{0 - \color{blue}{\left(-1 + x \cdot x\right)}}{x + 1}} \]
    21. associate--r+N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{\color{blue}{\left(0 - -1\right) - x \cdot x}}{x + 1}} \]
    22. metadata-evalN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{\color{blue}{1} - x \cdot x}{x + 1}} \]
    23. metadata-evalN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{\color{blue}{1 \cdot 1} - x \cdot x}{x + 1}} \]
    24. lift-*.f64N/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{1 \cdot 1 - \color{blue}{x \cdot x}}{x + 1}} \]
    25. +-commutativeN/A

      \[\leadsto \frac{\frac{10}{x + 1}}{\frac{1 \cdot 1 - x \cdot x}{\color{blue}{1 + x}}} \]
  5. Applied rewrites99.4%

    \[\leadsto \color{blue}{\frac{\frac{10}{x + 1}}{1 - x}} \]
  6. Taylor expanded in x around 0

    \[\leadsto \frac{\color{blue}{10}}{1 - x} \]
  7. Step-by-step derivation
    1. Applied rewrites18.8%

      \[\leadsto \frac{\color{blue}{10}}{1 - x} \]
    2. Add Preprocessing

    Alternative 3: 9.6% accurate, 1.7× speedup?

    \[\begin{array}{l} \\ 10 \cdot \mathsf{fma}\left(x, x, 1\right) \end{array} \]
    (FPCore (x) :precision binary64 (* 10.0 (fma x x 1.0)))
    double code(double x) {
    	return 10.0 * fma(x, x, 1.0);
    }
    
    function code(x)
    	return Float64(10.0 * fma(x, x, 1.0))
    end
    
    code[x_] := N[(10.0 * N[(x * x + 1.0), $MachinePrecision]), $MachinePrecision]
    
    \begin{array}{l}
    
    \\
    10 \cdot \mathsf{fma}\left(x, x, 1\right)
    \end{array}
    
    Derivation
    1. Initial program 87.6%

      \[\frac{10}{1 - x \cdot x} \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10 + 10 \cdot {x}^{2}} \]
    4. Step-by-step derivation
      1. +-commutativeN/A

        \[\leadsto \color{blue}{10 \cdot {x}^{2} + 10} \]
      2. lower-fma.f64N/A

        \[\leadsto \color{blue}{\mathsf{fma}\left(10, {x}^{2}, 10\right)} \]
      3. unpow2N/A

        \[\leadsto \mathsf{fma}\left(10, \color{blue}{x \cdot x}, 10\right) \]
      4. lower-*.f649.7

        \[\leadsto \mathsf{fma}\left(10, \color{blue}{x \cdot x}, 10\right) \]
    5. Applied rewrites9.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(10, x \cdot x, 10\right)} \]
    6. Step-by-step derivation
      1. lift-*.f64N/A

        \[\leadsto 10 \cdot \color{blue}{\left(x \cdot x\right)} + 10 \]
      2. *-commutativeN/A

        \[\leadsto \color{blue}{\left(x \cdot x\right) \cdot 10} + 10 \]
      3. distribute-lft1-inN/A

        \[\leadsto \color{blue}{\left(x \cdot x + 1\right) \cdot 10} \]
      4. metadata-evalN/A

        \[\leadsto \left(x \cdot x + \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)}\right) \cdot 10 \]
      5. sub-negN/A

        \[\leadsto \color{blue}{\left(x \cdot x - -1\right)} \cdot 10 \]
      6. lower-*.f64N/A

        \[\leadsto \color{blue}{\left(x \cdot x - -1\right) \cdot 10} \]
      7. sub-negN/A

        \[\leadsto \color{blue}{\left(x \cdot x + \left(\mathsf{neg}\left(-1\right)\right)\right)} \cdot 10 \]
      8. lift-*.f64N/A

        \[\leadsto \left(\color{blue}{x \cdot x} + \left(\mathsf{neg}\left(-1\right)\right)\right) \cdot 10 \]
      9. metadata-evalN/A

        \[\leadsto \left(x \cdot x + \color{blue}{1}\right) \cdot 10 \]
      10. lower-fma.f649.7

        \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 1\right)} \cdot 10 \]
    7. Applied rewrites9.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 1\right) \cdot 10} \]
    8. Final simplification9.7%

      \[\leadsto 10 \cdot \mathsf{fma}\left(x, x, 1\right) \]
    9. Add Preprocessing

    Alternative 4: 9.4% accurate, 20.0× speedup?

    \[\begin{array}{l} \\ 10 \end{array} \]
    (FPCore (x) :precision binary64 10.0)
    double code(double x) {
    	return 10.0;
    }
    
    real(8) function code(x)
        real(8), intent (in) :: x
        code = 10.0d0
    end function
    
    public static double code(double x) {
    	return 10.0;
    }
    
    def code(x):
    	return 10.0
    
    function code(x)
    	return 10.0
    end
    
    function tmp = code(x)
    	tmp = 10.0;
    end
    
    code[x_] := 10.0
    
    \begin{array}{l}
    
    \\
    10
    \end{array}
    
    Derivation
    1. Initial program 87.6%

      \[\frac{10}{1 - x \cdot x} \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10} \]
    4. Step-by-step derivation
      1. Applied rewrites9.5%

        \[\leadsto \color{blue}{10} \]
      2. Add Preprocessing

      Reproduce

      ?
      herbie shell --seed 2024216 
      (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))))