
(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 (+ (log1p (* lo (+ (/ x (* hi hi)) (/ -1.0 hi)))) (/ x hi)))
double code(double lo, double hi, double x) {
return log1p((lo * ((x / (hi * hi)) + (-1.0 / hi)))) + (x / hi);
}
public static double code(double lo, double hi, double x) {
return Math.log1p((lo * ((x / (hi * hi)) + (-1.0 / hi)))) + (x / hi);
}
def code(lo, hi, x): return math.log1p((lo * ((x / (hi * hi)) + (-1.0 / hi)))) + (x / hi)
function code(lo, hi, x) return Float64(log1p(Float64(lo * Float64(Float64(x / Float64(hi * hi)) + Float64(-1.0 / hi)))) + Float64(x / hi)) end
code[lo_, hi_, x_] := N[(N[Log[1 + N[(lo * N[(N[(x / N[(hi * hi), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / hi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(x / hi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(lo \cdot \left(\frac{x}{hi \cdot hi} + \frac{-1}{hi}\right)\right) + \frac{x}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in lo around 0 18.8%
mul-1-neg18.8%
unsub-neg18.8%
mul-1-neg18.8%
unsub-neg18.8%
unpow218.8%
Simplified18.8%
add-log-exp18.8%
associate-/r*18.8%
sub-div18.8%
Applied egg-rr18.8%
Taylor expanded in lo around 0 20.6%
associate-*r*20.6%
distribute-lft1-in20.6%
*-commutative20.6%
sub-neg20.6%
unpow220.6%
distribute-neg-frac20.6%
metadata-eval20.6%
Simplified20.6%
log-prod20.6%
+-commutative20.6%
log1p-udef20.6%
add-log-exp20.6%
Applied egg-rr20.6%
Final simplification20.6%
(FPCore (lo hi x) :precision binary64 (log (+ (/ x hi) (- 1.0 (/ lo hi)))))
double code(double lo, double hi, double x) {
return log(((x / hi) + (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
code = log(((x / hi) + (1.0d0 - (lo / hi))))
end function
public static double code(double lo, double hi, double x) {
return Math.log(((x / hi) + (1.0 - (lo / hi))));
}
def code(lo, hi, x): return math.log(((x / hi) + (1.0 - (lo / hi))))
function code(lo, hi, x) return log(Float64(Float64(x / hi) + Float64(1.0 - Float64(lo / hi)))) end
function tmp = code(lo, hi, x) tmp = log(((x / hi) + (1.0 - (lo / hi)))); end
code[lo_, hi_, x_] := N[Log[N[(N[(x / hi), $MachinePrecision] + N[(1.0 - N[(lo / hi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(\frac{x}{hi} + \left(1 - \frac{lo}{hi}\right)\right)
\end{array}
Initial program 3.1%
Taylor expanded in lo around 0 18.8%
mul-1-neg18.8%
unsub-neg18.8%
mul-1-neg18.8%
unsub-neg18.8%
unpow218.8%
Simplified18.8%
add-log-exp18.8%
associate-/r*18.8%
sub-div18.8%
Applied egg-rr18.8%
Taylor expanded in hi around inf 20.6%
associate--l+20.6%
Simplified20.6%
Final simplification20.6%
(FPCore (lo hi x) :precision binary64 (log1p (/ (- lo) hi)))
double code(double lo, double hi, double x) {
return log1p((-lo / hi));
}
public static double code(double lo, double hi, double x) {
return Math.log1p((-lo / hi));
}
def code(lo, hi, x): return math.log1p((-lo / hi))
function code(lo, hi, x) return log1p(Float64(Float64(-lo) / hi)) end
code[lo_, hi_, x_] := N[Log[1 + N[((-lo) / hi), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(\frac{-lo}{hi}\right)
\end{array}
Initial program 3.1%
Taylor expanded in lo around 0 18.8%
mul-1-neg18.8%
unsub-neg18.8%
mul-1-neg18.8%
unsub-neg18.8%
unpow218.8%
Simplified18.8%
add-log-exp18.8%
associate-/r*18.8%
sub-div18.8%
Applied egg-rr18.8%
Taylor expanded in lo around 0 20.6%
associate-*r*20.6%
distribute-lft1-in20.6%
*-commutative20.6%
sub-neg20.6%
unpow220.6%
distribute-neg-frac20.6%
metadata-eval20.6%
Simplified20.6%
Taylor expanded in x around 0 20.6%
log1p-def20.6%
mul-1-neg20.6%
distribute-frac-neg20.6%
Simplified20.6%
Final simplification20.6%
(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 lo around 0 18.8%
mul-1-neg18.8%
unsub-neg18.8%
mul-1-neg18.8%
unsub-neg18.8%
unpow218.8%
Simplified18.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.7%
Final simplification18.7%
herbie shell --seed 2023200
(FPCore (lo hi x)
:name "xlohi (overflows)"
:precision binary64
:pre (and (< lo -1e+308) (> hi 1e+308))
(/ (- x lo) (- hi lo)))