
(FPCore (a b) :precision binary64 (log (+ (exp a) (exp b))))
double code(double a, double b) {
return log((exp(a) + exp(b)));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
code = log((exp(a) + exp(b)))
end function
public static double code(double a, double b) {
return Math.log((Math.exp(a) + Math.exp(b)));
}
def code(a, b): return math.log((math.exp(a) + math.exp(b)))
function code(a, b) return log(Float64(exp(a) + exp(b))) end
function tmp = code(a, b) tmp = log((exp(a) + exp(b))); end
code[a_, b_] := N[Log[N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(e^{a} + e^{b}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (log (+ (exp a) (exp b))))
double code(double a, double b) {
return log((exp(a) + exp(b)));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
code = log((exp(a) + exp(b)))
end function
public static double code(double a, double b) {
return Math.log((Math.exp(a) + Math.exp(b)));
}
def code(a, b): return math.log((math.exp(a) + math.exp(b)))
function code(a, b) return log(Float64(exp(a) + exp(b))) end
function tmp = code(a, b) tmp = log((exp(a) + exp(b))); end
code[a_, b_] := N[Log[N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(e^{a} + e^{b}\right)
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -33.0) b (+ (log (+ (exp (- b)) (exp (- a)))) (+ b a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -33.0) {
tmp = b;
} else {
tmp = log((exp(-b) + exp(-a))) + (b + a);
}
return tmp;
}
NOTE: a and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (a <= (-33.0d0)) then
tmp = b
else
tmp = log((exp(-b) + exp(-a))) + (b + a)
end if
code = tmp
end function
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -33.0) {
tmp = b;
} else {
tmp = Math.log((Math.exp(-b) + Math.exp(-a))) + (b + a);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -33.0: tmp = b else: tmp = math.log((math.exp(-b) + math.exp(-a))) + (b + a) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -33.0) tmp = b; else tmp = Float64(log(Float64(exp(Float64(-b)) + exp(Float64(-a)))) + Float64(b + a)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -33.0)
tmp = b;
else
tmp = log((exp(-b) + exp(-a))) + (b + a);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -33.0], b, N[(N[Log[N[(N[Exp[(-b)], $MachinePrecision] + N[Exp[(-a)], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(b + a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -33:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\log \left(e^{-b} + e^{-a}\right) + \left(b + a\right)\\
\end{array}
\end{array}
if a < -33Initial program 12.7%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites98.6%
if -33 < a Initial program 69.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites64.8%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f6466.4
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity66.4
lift-*.f64N/A
*-rgt-identity66.4
lift-+.f64N/A
Applied rewrites66.4%
Final simplification74.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (+ (/ b (- (exp a) -1.0)) (log1p (exp a))))
assert(a < b);
double code(double a, double b) {
return (b / (exp(a) - -1.0)) + log1p(exp(a));
}
assert a < b;
public static double code(double a, double b) {
return (b / (Math.exp(a) - -1.0)) + Math.log1p(Math.exp(a));
}
[a, b] = sort([a, b]) def code(a, b): return (b / (math.exp(a) - -1.0)) + math.log1p(math.exp(a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(b / Float64(exp(a) - -1.0)) + log1p(exp(a))) end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(b / N[(N[Exp[a], $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision] + N[Log[1 + N[Exp[a], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{b}{e^{a} - -1} + \mathsf{log1p}\left(e^{a}\right)
\end{array}
Initial program 54.7%
Taylor expanded in b around 0
Applied rewrites72.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -20.0) b (log (+ (exp a) (fma (fma (fma 0.16666666666666666 b 0.5) b 1.0) b 1.0)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = log((exp(a) + fma(fma(fma(0.16666666666666666, b, 0.5), b, 1.0), b, 1.0)));
}
return tmp;
}
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -20.0) tmp = b; else tmp = log(Float64(exp(a) + fma(fma(fma(0.16666666666666666, b, 0.5), b, 1.0), b, 1.0))); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -20.0], b, N[Log[N[(N[Exp[a], $MachinePrecision] + N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -20:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\log \left(e^{a} + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)\right)\\
\end{array}
\end{array}
if a < -20Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -20 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites63.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -20.0) b (log (+ (exp a) (fma (fma 0.5 b 1.0) b 1.0)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = log((exp(a) + fma(fma(0.5, b, 1.0), b, 1.0)));
}
return tmp;
}
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -20.0) tmp = b; else tmp = log(Float64(exp(a) + fma(fma(0.5, b, 1.0), b, 1.0))); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -20.0], b, N[Log[N[(N[Exp[a], $MachinePrecision] + N[(N[(0.5 * b + 1.0), $MachinePrecision] * b + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -20:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\log \left(e^{a} + \mathsf{fma}\left(\mathsf{fma}\left(0.5, b, 1\right), b, 1\right)\right)\\
\end{array}
\end{array}
if a < -20Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -20 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -20.0) b (log (+ (exp a) (- b -1.0)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = log((exp(a) + (b - -1.0)));
}
return tmp;
}
NOTE: a and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (a <= (-20.0d0)) then
tmp = b
else
tmp = log((exp(a) + (b - (-1.0d0))))
end if
code = tmp
end function
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = Math.log((Math.exp(a) + (b - -1.0)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -20.0: tmp = b else: tmp = math.log((math.exp(a) + (b - -1.0))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -20.0) tmp = b; else tmp = log(Float64(exp(a) + Float64(b - -1.0))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -20.0)
tmp = b;
else
tmp = log((exp(a) + (b - -1.0)));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -20.0], b, N[Log[N[(N[Exp[a], $MachinePrecision] + N[(b - -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -20:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\log \left(e^{a} + \left(b - -1\right)\right)\\
\end{array}
\end{array}
if a < -20Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -20 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites63.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -20.0) b (log1p (exp a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = log1p(exp(a));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -20.0) {
tmp = b;
} else {
tmp = Math.log1p(Math.exp(a));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -20.0: tmp = b else: tmp = math.log1p(math.exp(a)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -20.0) tmp = b; else tmp = log1p(exp(a)); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -20.0], b, N[Log[1 + N[Exp[a], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -20:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{log1p}\left(e^{a}\right)\\
\end{array}
\end{array}
if a < -20Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -20 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2.6) b (fma (fma (fma (* a a) -0.005208333333333333 0.125) a 0.5) a (log 2.0))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2.6) {
tmp = b;
} else {
tmp = fma(fma(fma((a * a), -0.005208333333333333, 0.125), a, 0.5), a, log(2.0));
}
return tmp;
}
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2.6) tmp = b; else tmp = fma(fma(fma(Float64(a * a), -0.005208333333333333, 0.125), a, 0.5), a, log(2.0)); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -2.6], b, N[(N[(N[(N[(a * a), $MachinePrecision] * -0.005208333333333333 + 0.125), $MachinePrecision] * a + 0.5), $MachinePrecision] * a + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.6:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(a \cdot a, -0.005208333333333333, 0.125\right), a, 0.5\right), a, \log 2\right)\\
\end{array}
\end{array}
if a < -2.60000000000000009Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -2.60000000000000009 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
Taylor expanded in a around 0
Applied rewrites64.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -11.2) b (fma (fma 0.125 a 0.5) a (log 2.0))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -11.2) {
tmp = b;
} else {
tmp = fma(fma(0.125, a, 0.5), a, log(2.0));
}
return tmp;
}
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -11.2) tmp = b; else tmp = fma(fma(0.125, a, 0.5), a, log(2.0)); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -11.2], b, N[(N[(0.125 * a + 0.5), $MachinePrecision] * a + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -11.2:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.125, a, 0.5\right), a, \log 2\right)\\
\end{array}
\end{array}
if a < -11.199999999999999Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -11.199999999999999 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
Taylor expanded in a around 0
Applied rewrites64.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.4) b (fma 0.5 a (log 2.0))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.4) {
tmp = b;
} else {
tmp = fma(0.5, a, log(2.0));
}
return tmp;
}
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.4) tmp = b; else tmp = fma(0.5, a, log(2.0)); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -1.4], b, N[(0.5 * a + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.4:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(0.5, a, \log 2\right)\\
\end{array}
\end{array}
if a < -1.3999999999999999Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -1.3999999999999999 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
Taylor expanded in a around 0
Applied rewrites64.4%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.0) b (log1p (+ 1.0 a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.0) {
tmp = b;
} else {
tmp = log1p((1.0 + a));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.0) {
tmp = b;
} else {
tmp = Math.log1p((1.0 + a));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.0: tmp = b else: tmp = math.log1p((1.0 + a)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.0) tmp = b; else tmp = log1p(Float64(1.0 + a)); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -1.0], b, N[Log[1 + N[(1.0 + a), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{log1p}\left(1 + a\right)\\
\end{array}
\end{array}
if a < -1Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -1 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
Taylor expanded in a around 0
Applied rewrites64.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -11.2) b (log1p 1.0)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -11.2) {
tmp = b;
} else {
tmp = log1p(1.0);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -11.2) {
tmp = b;
} else {
tmp = Math.log1p(1.0);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -11.2: tmp = b else: tmp = math.log1p(1.0) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -11.2) tmp = b; else tmp = log1p(1.0); end return tmp end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -11.2], b, N[Log[1 + 1.0], $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -11.2:\\
\;\;\;\;b\\
\mathbf{else}:\\
\;\;\;\;\mathsf{log1p}\left(1\right)\\
\end{array}
\end{array}
if a < -11.199999999999999Initial program 14.0%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites0.0%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f641.8
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity1.8
lift-*.f64N/A
*-rgt-identity1.8
lift-+.f64N/A
Applied rewrites1.8%
Taylor expanded in b around inf
Applied rewrites97.2%
if -11.199999999999999 < a Initial program 68.8%
Taylor expanded in b around 0
Applied rewrites64.9%
Taylor expanded in a around 0
Applied rewrites63.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 b)
assert(a < b);
double code(double a, double b) {
return b;
}
NOTE: a and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
code = b
end function
assert a < b;
public static double code(double a, double b) {
return b;
}
[a, b] = sort([a, b]) def code(a, b): return b
a, b = sort([a, b]) function code(a, b) return b end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = b;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := b
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
b
\end{array}
Initial program 54.7%
lift-+.f64N/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip-+N/A
sinh-coshN/A
sinh-coshN/A
sinh---cosh-revN/A
lift-exp.f64N/A
sinh-+-cosh-revN/A
flip3-+N/A
flip3-+N/A
flip-+N/A
sinh---cosh-revN/A
frac-addN/A
Applied rewrites48.3%
lift-log.f64N/A
lift-/.f64N/A
log-divN/A
lift-exp.f64N/A
rem-log-expN/A
lower--.f64N/A
lower-log.f6450.0
lift-fma.f64N/A
lower-+.f64N/A
*-lft-identity50.0
lift-*.f64N/A
*-rgt-identity50.0
lift-+.f64N/A
Applied rewrites50.0%
Taylor expanded in b around inf
Applied rewrites27.6%
herbie shell --seed 2025018
(FPCore (a b)
:name "symmetry log of sum of exp"
:precision binary64
(log (+ (exp a) (exp b))))