
(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:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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}
(FPCore (lo hi x)
:precision binary64
(let* ((t_0 (/ (- x lo) hi)))
(/
(- (pow t_0 2.0) (pow (/ lo (/ (* hi hi) x)) 2.0))
(* t_0 (- 1.0 (/ lo hi))))))
double code(double lo, double hi, double x) {
double t_0 = (x - lo) / hi;
return (pow(t_0, 2.0) - pow((lo / ((hi * hi) / x)), 2.0)) / (t_0 * (1.0 - (lo / hi)));
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
real(8) :: t_0
t_0 = (x - lo) / hi
code = ((t_0 ** 2.0d0) - ((lo / ((hi * hi) / x)) ** 2.0d0)) / (t_0 * (1.0d0 - (lo / hi)))
end function
public static double code(double lo, double hi, double x) {
double t_0 = (x - lo) / hi;
return (Math.pow(t_0, 2.0) - Math.pow((lo / ((hi * hi) / x)), 2.0)) / (t_0 * (1.0 - (lo / hi)));
}
def code(lo, hi, x): t_0 = (x - lo) / hi return (math.pow(t_0, 2.0) - math.pow((lo / ((hi * hi) / x)), 2.0)) / (t_0 * (1.0 - (lo / hi)))
function code(lo, hi, x) t_0 = Float64(Float64(x - lo) / hi) return Float64(Float64((t_0 ^ 2.0) - (Float64(lo / Float64(Float64(hi * hi) / x)) ^ 2.0)) / Float64(t_0 * Float64(1.0 - Float64(lo / hi)))) end
function tmp = code(lo, hi, x) t_0 = (x - lo) / hi; tmp = ((t_0 ^ 2.0) - ((lo / ((hi * hi) / x)) ^ 2.0)) / (t_0 * (1.0 - (lo / hi))); end
code[lo_, hi_, x_] := Block[{t$95$0 = N[(N[(x - lo), $MachinePrecision] / hi), $MachinePrecision]}, N[(N[(N[Power[t$95$0, 2.0], $MachinePrecision] - N[Power[N[(lo / N[(N[(hi * hi), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(1.0 - N[(lo / hi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{x - lo}{hi}\\
\frac{{t_0}^{2} - {\left(\frac{lo}{\frac{hi \cdot hi}{x}}\right)}^{2}}{t_0 \cdot \left(1 - \frac{lo}{hi}\right)}
\end{array}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf 0.0%
+-commutative0.0%
associate--l+0.0%
*-commutative0.0%
unpow20.0%
times-frac10.1%
div-sub10.1%
Simplified10.1%
div-inv10.1%
Applied egg-rr10.1%
div-inv10.1%
add-cube-cbrt10.1%
unpow210.1%
+-commutative10.1%
flip-+10.1%
Applied egg-rr10.1%
times-frac0.0%
*-lft-identity0.0%
times-frac99.4%
/-rgt-identity99.4%
*-lft-identity99.4%
distribute-rgt-out--99.2%
Simplified99.2%
Taylor expanded in lo around 0 51.6%
unpow251.6%
associate-/l*99.2%
Simplified99.2%
Final simplification99.2%
(FPCore (lo hi x) :precision binary64 (fabs (* (/ (- x lo) hi) (/ lo hi))))
double code(double lo, double hi, double x) {
return fabs((((x - lo) / hi) * (lo / hi)));
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = abs((((x - lo) / hi) * (lo / hi)))
end function
public static double code(double lo, double hi, double x) {
return Math.abs((((x - lo) / hi) * (lo / hi)));
}
def code(lo, hi, x): return math.fabs((((x - lo) / hi) * (lo / hi)))
function code(lo, hi, x) return abs(Float64(Float64(Float64(x - lo) / hi) * Float64(lo / hi))) end
function tmp = code(lo, hi, x) tmp = abs((((x - lo) / hi) * (lo / hi))); end
code[lo_, hi_, x_] := N[Abs[N[(N[(N[(x - lo), $MachinePrecision] / hi), $MachinePrecision] * N[(lo / hi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\left|\frac{x - lo}{hi} \cdot \frac{lo}{hi}\right|
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf 0.0%
+-commutative0.0%
associate--l+0.0%
*-commutative0.0%
unpow20.0%
times-frac10.1%
div-sub10.1%
Simplified10.1%
add-sqr-sqrt9.4%
sqrt-unprod17.9%
pow217.9%
fma-def17.9%
Applied egg-rr17.9%
unpow217.9%
rem-sqrt-square17.9%
fma-udef17.9%
*-rgt-identity17.9%
distribute-lft-out17.9%
Simplified17.9%
Taylor expanded in lo around inf 19.3%
Final simplification19.3%
(FPCore (lo hi x) :precision binary64 (- (/ (- x lo) hi) (* x (/ (/ lo hi) hi))))
double code(double lo, double hi, double x) {
return ((x - lo) / hi) - (x * ((lo / hi) / hi));
}
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) - (x * ((lo / hi) / hi))
end function
public static double code(double lo, double hi, double x) {
return ((x - lo) / hi) - (x * ((lo / hi) / hi));
}
def code(lo, hi, x): return ((x - lo) / hi) - (x * ((lo / hi) / hi))
function code(lo, hi, x) return Float64(Float64(Float64(x - lo) / hi) - Float64(x * Float64(Float64(lo / hi) / hi))) end
function tmp = code(lo, hi, x) tmp = ((x - lo) / hi) - (x * ((lo / hi) / hi)); end
code[lo_, hi_, x_] := N[(N[(N[(x - lo), $MachinePrecision] / hi), $MachinePrecision] - N[(x * N[(N[(lo / hi), $MachinePrecision] / hi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x - lo}{hi} - x \cdot \frac{\frac{lo}{hi}}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in lo around 0 18.8%
add-sqr-sqrt9.3%
sqrt-unprod14.6%
sqr-neg14.6%
sqrt-unprod9.5%
unpow29.5%
add-sqr-sqrt18.8%
neg-mul-118.8%
times-frac18.8%
Applied egg-rr18.8%
Taylor expanded in lo around 0 18.8%
Simplified18.8%
Final simplification18.8%
(FPCore (lo hi x) :precision binary64 (/ (- x lo) hi))
double code(double lo, double hi, double x) {
return (x - lo) / hi;
}
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
end function
public static double code(double lo, double hi, double x) {
return (x - lo) / hi;
}
def code(lo, hi, x): return (x - lo) / hi
function code(lo, hi, x) return Float64(Float64(x - lo) / hi) end
function tmp = code(lo, hi, x) tmp = (x - lo) / hi; end
code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / hi), $MachinePrecision]
\begin{array}{l}
\\
\frac{x - lo}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf 18.8%
Final simplification18.8%
(FPCore (lo hi x) :precision binary64 (/ (- lo) hi))
double code(double lo, double hi, double x) {
return -lo / hi;
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = -lo / hi
end function
public static double code(double lo, double hi, double x) {
return -lo / hi;
}
def code(lo, hi, x): return -lo / hi
function code(lo, hi, x) return Float64(Float64(-lo) / hi) end
function tmp = code(lo, hi, x) tmp = -lo / hi; end
code[lo_, hi_, x_] := N[((-lo) / hi), $MachinePrecision]
\begin{array}{l}
\\
\frac{-lo}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf 18.8%
Taylor expanded in x around 0 18.8%
associate-*r/18.8%
neg-mul-118.8%
Simplified18.8%
Final simplification18.8%
(FPCore (lo hi x) :precision binary64 1.0)
double code(double lo, double hi, double x) {
return 1.0;
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double lo, double hi, double x) {
return 1.0;
}
def code(lo, hi, x): return 1.0
function code(lo, hi, x) return 1.0 end
function tmp = code(lo, hi, x) tmp = 1.0; end
code[lo_, hi_, x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf 18.6%
Final simplification18.6%
herbie shell --seed 2023293
(FPCore (lo hi x)
:name "xlohi (overflows)"
:precision binary64
:pre (and (< lo -1e+308) (> hi 1e+308))
(/ (- x lo) (- hi lo)))