xlohi (overflows)

Percentage Accurate: 3.1% → 26.7%
Time: 17.4s
Alternatives: 7
Speedup: 18.0×

Specification

?
\[lo < -1 \cdot 10^{+308} \land hi > 10^{+308}\]
\[\begin{array}{l} \\ \frac{x - lo}{hi - lo} \end{array} \]
(FPCore (lo hi x) :precision binary64 (/ (- x lo) (- hi lo)))
double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}
real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = (x - lo) / (hi - lo)
end function
public static double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}
def code(lo, hi, x):
	return (x - lo) / (hi - lo)
function code(lo, hi, x)
	return Float64(Float64(x - lo) / Float64(hi - lo))
end
function tmp = code(lo, hi, x)
	tmp = (x - lo) / (hi - lo);
end
code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / N[(hi - lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{x - lo}{hi - lo}
\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 7 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: 3.1% accurate, 1.0× speedup?

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

\\
\frac{x - lo}{hi - lo}
\end{array}

Alternative 1: 26.7% accurate, 0.1× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)\\ \left(1 - t\_0 \cdot t\_0\right) \cdot \frac{1}{1 + \frac{x - hi}{lo}} \end{array} \end{array} \]
(FPCore (lo hi x)
 :precision binary64
 (let* ((t_0 (fma x (/ hi (* lo lo)) (/ (- x (fma hi (/ hi lo) hi)) lo))))
   (* (- 1.0 (* t_0 t_0)) (/ 1.0 (+ 1.0 (/ (- x hi) lo))))))
double code(double lo, double hi, double x) {
	double t_0 = fma(x, (hi / (lo * lo)), ((x - fma(hi, (hi / lo), hi)) / lo));
	return (1.0 - (t_0 * t_0)) * (1.0 / (1.0 + ((x - hi) / lo)));
}
function code(lo, hi, x)
	t_0 = fma(x, Float64(hi / Float64(lo * lo)), Float64(Float64(x - fma(hi, Float64(hi / lo), hi)) / lo))
	return Float64(Float64(1.0 - Float64(t_0 * t_0)) * Float64(1.0 / Float64(1.0 + Float64(Float64(x - hi) / lo))))
end
code[lo_, hi_, x_] := Block[{t$95$0 = N[(x * N[(hi / N[(lo * lo), $MachinePrecision]), $MachinePrecision] + N[(N[(x - N[(hi * N[(hi / lo), $MachinePrecision] + hi), $MachinePrecision]), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(1.0 + N[(N[(x - hi), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)\\
\left(1 - t\_0 \cdot t\_0\right) \cdot \frac{1}{1 + \frac{x - hi}{lo}}
\end{array}
\end{array}
Derivation
  1. Initial program 3.1%

    \[\frac{x - lo}{hi - lo} \]
  2. Add Preprocessing
  3. Taylor expanded in lo around -inf

    \[\leadsto \color{blue}{1 + -1 \cdot \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
  4. Step-by-step derivation
    1. mul-1-negN/A

      \[\leadsto 1 + \color{blue}{\left(\mathsf{neg}\left(\frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}\right)\right)} \]
    2. unsub-negN/A

      \[\leadsto \color{blue}{1 - \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
    3. lower--.f64N/A

      \[\leadsto \color{blue}{1 - \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
    4. lower-/.f64N/A

      \[\leadsto 1 - \color{blue}{\frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
    5. +-commutativeN/A

      \[\leadsto 1 - \frac{\color{blue}{\left(\frac{hi \cdot \left(x - hi\right)}{lo} + x\right)} - hi}{lo} \]
    6. associate--l+N/A

      \[\leadsto 1 - \frac{\color{blue}{\frac{hi \cdot \left(x - hi\right)}{lo} + \left(x - hi\right)}}{lo} \]
    7. associate-/l*N/A

      \[\leadsto 1 - \frac{\color{blue}{hi \cdot \frac{x - hi}{lo}} + \left(x - hi\right)}{lo} \]
    8. lower-fma.f64N/A

      \[\leadsto 1 - \frac{\color{blue}{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, x - hi\right)}}{lo} \]
    9. lower-/.f64N/A

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

      \[\leadsto 1 - \frac{\mathsf{fma}\left(hi, \frac{\color{blue}{x - hi}}{lo}, x - hi\right)}{lo} \]
    11. lower--.f6418.9

      \[\leadsto 1 - \frac{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, \color{blue}{x - hi}\right)}{lo} \]
  5. Applied rewrites18.9%

    \[\leadsto \color{blue}{1 - \frac{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, x - hi\right)}{lo}} \]
  6. Taylor expanded in x around 0

    \[\leadsto 1 - \left(\left(-1 \cdot \frac{{hi}^{2}}{{lo}^{2}} + x \cdot \left(\frac{1}{lo} + \frac{hi}{{lo}^{2}}\right)\right) - \color{blue}{\frac{hi}{lo}}\right) \]
  7. Step-by-step derivation
    1. Applied rewrites18.9%

      \[\leadsto 1 - \left(\mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x}{lo}\right) + \color{blue}{\frac{-\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}}\right) \]
    2. Step-by-step derivation
      1. Applied rewrites18.9%

        \[\leadsto \left(1 - \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \cdot \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)\right) \cdot \color{blue}{\frac{1}{1 + \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)}} \]
      2. Taylor expanded in lo around inf

        \[\leadsto \left(1 - \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \cdot \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)\right) \cdot \frac{1}{1 + \frac{x - hi}{lo}} \]
      3. Step-by-step derivation
        1. Applied rewrites27.2%

          \[\leadsto \left(1 - \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \cdot \mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x - \mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)\right) \cdot \frac{1}{1 + \frac{x - hi}{lo}} \]
        2. Add Preprocessing

        Alternative 2: 18.9% accurate, 0.4× speedup?

        \[\begin{array}{l} \\ 1 - \left(\frac{x}{lo} - \frac{\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \end{array} \]
        (FPCore (lo hi x)
         :precision binary64
         (- 1.0 (- (/ x lo) (/ (fma hi (/ hi lo) hi) lo))))
        double code(double lo, double hi, double x) {
        	return 1.0 - ((x / lo) - (fma(hi, (hi / lo), hi) / lo));
        }
        
        function code(lo, hi, x)
        	return Float64(1.0 - Float64(Float64(x / lo) - Float64(fma(hi, Float64(hi / lo), hi) / lo)))
        end
        
        code[lo_, hi_, x_] := N[(1.0 - N[(N[(x / lo), $MachinePrecision] - N[(N[(hi * N[(hi / lo), $MachinePrecision] + hi), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
        
        \begin{array}{l}
        
        \\
        1 - \left(\frac{x}{lo} - \frac{\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right)
        \end{array}
        
        Derivation
        1. Initial program 3.1%

          \[\frac{x - lo}{hi - lo} \]
        2. Add Preprocessing
        3. Taylor expanded in lo around -inf

          \[\leadsto \color{blue}{1 + -1 \cdot \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
        4. Step-by-step derivation
          1. mul-1-negN/A

            \[\leadsto 1 + \color{blue}{\left(\mathsf{neg}\left(\frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}\right)\right)} \]
          2. unsub-negN/A

            \[\leadsto \color{blue}{1 - \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
          3. lower--.f64N/A

            \[\leadsto \color{blue}{1 - \frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
          4. lower-/.f64N/A

            \[\leadsto 1 - \color{blue}{\frac{\left(x + \frac{hi \cdot \left(x - hi\right)}{lo}\right) - hi}{lo}} \]
          5. +-commutativeN/A

            \[\leadsto 1 - \frac{\color{blue}{\left(\frac{hi \cdot \left(x - hi\right)}{lo} + x\right)} - hi}{lo} \]
          6. associate--l+N/A

            \[\leadsto 1 - \frac{\color{blue}{\frac{hi \cdot \left(x - hi\right)}{lo} + \left(x - hi\right)}}{lo} \]
          7. associate-/l*N/A

            \[\leadsto 1 - \frac{\color{blue}{hi \cdot \frac{x - hi}{lo}} + \left(x - hi\right)}{lo} \]
          8. lower-fma.f64N/A

            \[\leadsto 1 - \frac{\color{blue}{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, x - hi\right)}}{lo} \]
          9. lower-/.f64N/A

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

            \[\leadsto 1 - \frac{\mathsf{fma}\left(hi, \frac{\color{blue}{x - hi}}{lo}, x - hi\right)}{lo} \]
          11. lower--.f6418.9

            \[\leadsto 1 - \frac{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, \color{blue}{x - hi}\right)}{lo} \]
        5. Applied rewrites18.9%

          \[\leadsto \color{blue}{1 - \frac{\mathsf{fma}\left(hi, \frac{x - hi}{lo}, x - hi\right)}{lo}} \]
        6. Taylor expanded in x around 0

          \[\leadsto 1 - \left(\left(-1 \cdot \frac{{hi}^{2}}{{lo}^{2}} + x \cdot \left(\frac{1}{lo} + \frac{hi}{{lo}^{2}}\right)\right) - \color{blue}{\frac{hi}{lo}}\right) \]
        7. Step-by-step derivation
          1. Applied rewrites18.9%

            \[\leadsto 1 - \left(\mathsf{fma}\left(x, \frac{hi}{lo \cdot lo}, \frac{x}{lo}\right) + \color{blue}{\frac{-\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}}\right) \]
          2. Taylor expanded in hi around 0

            \[\leadsto 1 - \left(\frac{x}{lo} + \frac{\mathsf{neg}\left(\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)\right)}{lo}\right) \]
          3. Step-by-step derivation
            1. Applied rewrites18.9%

              \[\leadsto 1 - \left(\frac{x}{lo} + \frac{-\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \]
            2. Final simplification18.9%

              \[\leadsto 1 - \left(\frac{x}{lo} - \frac{\mathsf{fma}\left(hi, \frac{hi}{lo}, hi\right)}{lo}\right) \]
            3. Add Preprocessing

            Reproduce

            ?
            herbie shell --seed 2024228 
            (FPCore (lo hi x)
              :name "xlohi (overflows)"
              :precision binary64
              :pre (and (< lo -1e+308) (> hi 1e+308))
              (/ (- x lo) (- hi lo)))