
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (/ (+ alpha beta) i))
(t_3 (* i (+ (+ alpha beta) i)))
(t_4 (- (+ alpha beta) (* -2.0 i))))
(if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) (- t_1 1.0)) INFINITY)
(/
(* (/ t_3 t_4) (/ (fma beta alpha (* i (* i (+ 1.0 t_2)))) t_4))
(- (fma i (fma 4.0 beta (* 4.0 i)) (* beta beta)) 1.0))
(- (+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i))) (* 0.125 t_2)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = (alpha + beta) / i;
double t_3 = i * ((alpha + beta) + i);
double t_4 = (alpha + beta) - (-2.0 * i);
double tmp;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / (t_1 - 1.0)) <= ((double) INFINITY)) {
tmp = ((t_3 / t_4) * (fma(beta, alpha, (i * (i * (1.0 + t_2)))) / t_4)) / (fma(i, fma(4.0, beta, (4.0 * i)), (beta * beta)) - 1.0);
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * t_2);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(Float64(alpha + beta) / i) t_3 = Float64(i * Float64(Float64(alpha + beta) + i)) t_4 = Float64(Float64(alpha + beta) - Float64(-2.0 * i)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / Float64(t_1 - 1.0)) <= Inf) tmp = Float64(Float64(Float64(t_3 / t_4) * Float64(fma(beta, alpha, Float64(i * Float64(i * Float64(1.0 + t_2)))) / t_4)) / Float64(fma(i, fma(4.0, beta, Float64(4.0 * i)), Float64(beta * beta)) - 1.0)); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * t_2)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(alpha + beta), $MachinePrecision] - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 - 1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(t$95$3 / t$95$4), $MachinePrecision] * N[(N[(beta * alpha + N[(i * N[(i * N[(1.0 + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision] / N[(N[(i * N[(4.0 * beta + N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(beta * beta), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * t$95$2), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := \frac{\alpha + \beta}{i}\\
t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_4 := \left(\alpha + \beta\right) - -2 \cdot i\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_1 - 1} \leq \infty:\\
\;\;\;\;\frac{\frac{t\_3}{t\_4} \cdot \frac{\mathsf{fma}\left(\beta, \alpha, i \cdot \left(i \cdot \left(1 + t\_2\right)\right)\right)}{t\_4}}{\mathsf{fma}\left(i, \mathsf{fma}\left(4, \beta, 4 \cdot i\right), \beta \cdot \beta\right) - 1}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot t\_2\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
Applied rewrites99.7%
Taylor expanded in i around inf
lower-*.f64N/A
div-add-revN/A
lower-+.f64N/A
lift-/.f64N/A
lift-+.f6499.8
Applied rewrites99.8%
Taylor expanded in i around 0
lower-fma.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-pow.f64N/A
lift-+.f6499.8
Applied rewrites99.8%
Taylor expanded in alpha around 0
lower-fma.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6486.2
Applied rewrites86.2%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6478.8
Applied rewrites78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ (+ alpha beta) i)))
(t_3 (- t_1 1.0))
(t_4 (/ (+ alpha beta) i)))
(if (<= (/ (/ (* t_2 (+ (* beta alpha) t_2)) t_1) t_3) INFINITY)
(/
(*
(/ (* i (+ beta i)) (- beta (* -2.0 i)))
(/
(fma beta alpha (* i (* i (+ 1.0 t_4))))
(- (+ alpha beta) (* -2.0 i))))
t_3)
(- (+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i))) (* 0.125 t_4)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((alpha + beta) + i);
double t_3 = t_1 - 1.0;
double t_4 = (alpha + beta) / i;
double tmp;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / t_3) <= ((double) INFINITY)) {
tmp = (((i * (beta + i)) / (beta - (-2.0 * i))) * (fma(beta, alpha, (i * (i * (1.0 + t_4)))) / ((alpha + beta) - (-2.0 * i)))) / t_3;
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * t_4);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(Float64(alpha + beta) + i)) t_3 = Float64(t_1 - 1.0) t_4 = Float64(Float64(alpha + beta) / i) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(Float64(beta * alpha) + t_2)) / t_1) / t_3) <= Inf) tmp = Float64(Float64(Float64(Float64(i * Float64(beta + i)) / Float64(beta - Float64(-2.0 * i))) * Float64(fma(beta, alpha, Float64(i * Float64(i * Float64(1.0 + t_4)))) / Float64(Float64(alpha + beta) - Float64(-2.0 * i)))) / t_3); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * t_4)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(N[(beta * alpha), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / N[(beta - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(beta * alpha + N[(i * N[(i * N[(1.0 + t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * t$95$4), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_3 := t\_1 - 1\\
t_4 := \frac{\alpha + \beta}{i}\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(\beta \cdot \alpha + t\_2\right)}{t\_1}}{t\_3} \leq \infty:\\
\;\;\;\;\frac{\frac{i \cdot \left(\beta + i\right)}{\beta - -2 \cdot i} \cdot \frac{\mathsf{fma}\left(\beta, \alpha, i \cdot \left(i \cdot \left(1 + t\_4\right)\right)\right)}{\left(\alpha + \beta\right) - -2 \cdot i}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot t\_4\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
Applied rewrites99.7%
Taylor expanded in i around inf
lower-*.f64N/A
div-add-revN/A
lower-+.f64N/A
lift-/.f64N/A
lift-+.f6499.8
Applied rewrites99.8%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f64N/A
lift-*.f6488.9
Applied rewrites88.9%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6478.8
Applied rewrites78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (- t_1 1.0))
(t_3 (* i (+ (+ alpha beta) i)))
(t_4 (- (+ alpha beta) (* -2.0 i))))
(if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
(/ (* (/ t_3 t_4) (/ (fma beta (+ alpha i) (* i (+ alpha i))) t_4)) t_2)
(-
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = t_1 - 1.0;
double t_3 = i * ((alpha + beta) + i);
double t_4 = (alpha + beta) - (-2.0 * i);
double tmp;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((t_3 / t_4) * (fma(beta, (alpha + i), (i * (alpha + i))) / t_4)) / t_2;
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 - 1.0) t_3 = Float64(i * Float64(Float64(alpha + beta) + i)) t_4 = Float64(Float64(alpha + beta) - Float64(-2.0 * i)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(t_3 / t_4) * Float64(fma(beta, Float64(alpha + i), Float64(i * Float64(alpha + i))) / t_4)) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(alpha + beta), $MachinePrecision] - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(t$95$3 / t$95$4), $MachinePrecision] * N[(N[(beta * N[(alpha + i), $MachinePrecision] + N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 - 1\\
t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_4 := \left(\alpha + \beta\right) - -2 \cdot i\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\frac{t\_3}{t\_4} \cdot \frac{\mathsf{fma}\left(\beta, \alpha + i, i \cdot \left(\alpha + i\right)\right)}{t\_4}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
Applied rewrites99.7%
Taylor expanded in beta around 0
lower-fma.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f6499.8
Applied rewrites99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6478.8
Applied rewrites78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (- t_1 1.0))
(t_3 (* i (+ (+ alpha beta) i))))
(if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
(/
(*
(/ t_3 (- (+ alpha beta) (* -2.0 i)))
(/ (fma beta i (* i i)) (- beta (* -2.0 i))))
t_2)
(-
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = t_1 - 1.0;
double t_3 = i * ((alpha + beta) + i);
double tmp;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((t_3 / ((alpha + beta) - (-2.0 * i))) * (fma(beta, i, (i * i)) / (beta - (-2.0 * i)))) / t_2;
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 - 1.0) t_3 = Float64(i * Float64(Float64(alpha + beta) + i)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(t_3 / Float64(Float64(alpha + beta) - Float64(-2.0 * i))) * Float64(fma(beta, i, Float64(i * i)) / Float64(beta - Float64(-2.0 * i)))) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(t$95$3 / N[(N[(alpha + beta), $MachinePrecision] - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(beta * i + N[(i * i), $MachinePrecision]), $MachinePrecision] / N[(beta - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 - 1\\
t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\frac{t\_3}{\left(\alpha + \beta\right) - -2 \cdot i} \cdot \frac{\mathsf{fma}\left(\beta, i, i \cdot i\right)}{\beta - -2 \cdot i}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
Applied rewrites99.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f64N/A
lift-*.f6487.9
Applied rewrites87.9%
Taylor expanded in beta around 0
lower-fma.f64N/A
pow2N/A
lift-*.f6487.9
Applied rewrites87.9%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6478.8
Applied rewrites78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (- t_1 1.0))
(t_3 (* i (+ (+ alpha beta) i)))
(t_4 (/ (* i (+ beta i)) (- beta (* -2.0 i)))))
(if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
(/ (* t_4 t_4) t_2)
(-
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = t_1 - 1.0;
double t_3 = i * ((alpha + beta) + i);
double t_4 = (i * (beta + i)) / (beta - (-2.0 * i));
double tmp;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (t_4 * t_4) / t_2;
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = t_1 - 1.0;
double t_3 = i * ((alpha + beta) + i);
double t_4 = (i * (beta + i)) / (beta - (-2.0 * i));
double tmp;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (t_4 * t_4) / t_2;
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (2.0 * i) t_1 = t_0 * t_0 t_2 = t_1 - 1.0 t_3 = i * ((alpha + beta) + i) t_4 = (i * (beta + i)) / (beta - (-2.0 * i)) tmp = 0 if (((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= math.inf: tmp = (t_4 * t_4) / t_2 else: tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 - 1.0) t_3 = Float64(i * Float64(Float64(alpha + beta) + i)) t_4 = Float64(Float64(i * Float64(beta + i)) / Float64(beta - Float64(-2.0 * i))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf) tmp = Float64(Float64(t_4 * t_4) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (2.0 * i);
t_1 = t_0 * t_0;
t_2 = t_1 - 1.0;
t_3 = i * ((alpha + beta) + i);
t_4 = (i * (beta + i)) / (beta - (-2.0 * i));
tmp = 0.0;
if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
tmp = (t_4 * t_4) / t_2;
else
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / N[(beta - N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(t$95$4 * t$95$4), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 - 1\\
t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_4 := \frac{i \cdot \left(\beta + i\right)}{\beta - -2 \cdot i}\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{t\_4 \cdot t\_4}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
Applied rewrites99.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f64N/A
lift-*.f6487.9
Applied rewrites87.9%
Taylor expanded in alpha around 0
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f6487.6
Applied rewrites87.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6478.8
Applied rewrites78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ (+ alpha beta) i))))
(if (<= (/ (/ (* t_2 (+ (* beta alpha) t_2)) t_1) (- t_1 1.0)) 1e-46)
(/ (/ (* (* beta beta) (* i (+ alpha i))) t_1) (* beta beta))
(-
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((alpha + beta) + i);
double tmp;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46) {
tmp = (((beta * beta) * (i * (alpha + i))) / t_1) / (beta * beta);
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
NOTE: alpha, beta, and i 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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = (alpha + beta) + (2.0d0 * i)
t_1 = t_0 * t_0
t_2 = i * ((alpha + beta) + i)
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0d0)) <= 1d-46) then
tmp = (((beta * beta) * (i * (alpha + i))) / t_1) / (beta * beta)
else
tmp = (0.0625d0 + (0.0625d0 * ((2.0d0 * (alpha + beta)) / i))) - (0.125d0 * ((alpha + beta) / i))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((alpha + beta) + i);
double tmp;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46) {
tmp = (((beta * beta) * (i * (alpha + i))) / t_1) / (beta * beta);
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (2.0 * i) t_1 = t_0 * t_0 t_2 = i * ((alpha + beta) + i) tmp = 0 if (((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46: tmp = (((beta * beta) * (i * (alpha + i))) / t_1) / (beta * beta) else: tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(Float64(alpha + beta) + i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(Float64(beta * alpha) + t_2)) / t_1) / Float64(t_1 - 1.0)) <= 1e-46) tmp = Float64(Float64(Float64(Float64(beta * beta) * Float64(i * Float64(alpha + i))) / t_1) / Float64(beta * beta)); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (2.0 * i);
t_1 = t_0 * t_0;
t_2 = i * ((alpha + beta) + i);
tmp = 0.0;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46)
tmp = (((beta * beta) * (i * (alpha + i))) / t_1) / (beta * beta);
else
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(N[(beta * alpha), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 - 1.0), $MachinePrecision]), $MachinePrecision], 1e-46], N[(N[(N[(N[(beta * beta), $MachinePrecision] * N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(\beta \cdot \alpha + t\_2\right)}{t\_1}}{t\_1 - 1} \leq 10^{-46}:\\
\;\;\;\;\frac{\frac{\left(\beta \cdot \beta\right) \cdot \left(i \cdot \left(\alpha + i\right)\right)}{t\_1}}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 1.00000000000000002e-46Initial program 98.8%
Taylor expanded in beta around inf
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-+.f6436.3
Applied rewrites36.3%
Taylor expanded in beta around inf
pow2N/A
lift-*.f6434.7
Applied rewrites34.7%
if 1.00000000000000002e-46 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 10.9%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6482.9
Applied rewrites82.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ (+ alpha beta) i))))
(if (<= (/ (/ (* t_2 (+ (* beta alpha) t_2)) t_1) (- t_1 1.0)) 1e-46)
(/ (* i (+ alpha i)) (* beta beta))
(-
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ alpha beta)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((alpha + beta) + i);
double tmp;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46) {
tmp = (i * (alpha + i)) / (beta * beta);
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
NOTE: alpha, beta, and i 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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = (alpha + beta) + (2.0d0 * i)
t_1 = t_0 * t_0
t_2 = i * ((alpha + beta) + i)
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0d0)) <= 1d-46) then
tmp = (i * (alpha + i)) / (beta * beta)
else
tmp = (0.0625d0 + (0.0625d0 * ((2.0d0 * (alpha + beta)) / i))) - (0.125d0 * ((alpha + beta) / i))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((alpha + beta) + i);
double tmp;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46) {
tmp = (i * (alpha + i)) / (beta * beta);
} else {
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (2.0 * i) t_1 = t_0 * t_0 t_2 = i * ((alpha + beta) + i) tmp = 0 if (((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46: tmp = (i * (alpha + i)) / (beta * beta) else: tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(Float64(alpha + beta) + i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(Float64(beta * alpha) + t_2)) / t_1) / Float64(t_1 - 1.0)) <= 1e-46) tmp = Float64(Float64(i * Float64(alpha + i)) / Float64(beta * beta)); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(alpha + beta)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (2.0 * i);
t_1 = t_0 * t_0;
t_2 = i * ((alpha + beta) + i);
tmp = 0.0;
if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 1e-46)
tmp = (i * (alpha + i)) / (beta * beta);
else
tmp = (0.0625 + (0.0625 * ((2.0 * (alpha + beta)) / i))) - (0.125 * ((alpha + beta) / i));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(N[(beta * alpha), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 - 1.0), $MachinePrecision]), $MachinePrecision], 1e-46], N[(N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(\beta \cdot \alpha + t\_2\right)}{t\_1}}{t\_1 - 1} \leq 10^{-46}:\\
\;\;\;\;\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 1.00000000000000002e-46Initial program 98.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6435.1
Applied rewrites35.1%
if 1.00000000000000002e-46 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 10.9%
Taylor expanded in i around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f6482.9
Applied rewrites82.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= i 3.9e+45)
(/
(* i (+ alpha i))
(- (* (+ (+ alpha beta) (* 2.0 i)) (+ beta (* 2.0 i))) 1.0))
0.0625))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (i <= 3.9e+45) {
tmp = (i * (alpha + i)) / ((((alpha + beta) + (2.0 * i)) * (beta + (2.0 * i))) - 1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha, beta, and i 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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (i <= 3.9d+45) then
tmp = (i * (alpha + i)) / ((((alpha + beta) + (2.0d0 * i)) * (beta + (2.0d0 * i))) - 1.0d0)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (i <= 3.9e+45) {
tmp = (i * (alpha + i)) / ((((alpha + beta) + (2.0 * i)) * (beta + (2.0 * i))) - 1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if i <= 3.9e+45: tmp = (i * (alpha + i)) / ((((alpha + beta) + (2.0 * i)) * (beta + (2.0 * i))) - 1.0) else: tmp = 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (i <= 3.9e+45) tmp = Float64(Float64(i * Float64(alpha + i)) / Float64(Float64(Float64(Float64(alpha + beta) + Float64(2.0 * i)) * Float64(beta + Float64(2.0 * i))) - 1.0)); else tmp = 0.0625; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (i <= 3.9e+45)
tmp = (i * (alpha + i)) / ((((alpha + beta) + (2.0 * i)) * (beta + (2.0 * i))) - 1.0);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[i, 3.9e+45], N[(N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision] * N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], 0.0625]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;i \leq 3.9 \cdot 10^{+45}:\\
\;\;\;\;\frac{i \cdot \left(\alpha + i\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\beta + 2 \cdot i\right) - 1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 3.8999999999999999e45Initial program 59.1%
Taylor expanded in beta around inf
lower-*.f64N/A
lower-+.f6447.1
Applied rewrites47.1%
Taylor expanded in alpha around 0
Applied rewrites34.5%
if 3.8999999999999999e45 < i Initial program 8.7%
Taylor expanded in i around inf
Applied rewrites79.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= i 6.8e+44) (/ (* i (+ alpha i)) (* beta beta)) 0.0625))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (i <= 6.8e+44) {
tmp = (i * (alpha + i)) / (beta * beta);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha, beta, and i 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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (i <= 6.8d+44) then
tmp = (i * (alpha + i)) / (beta * beta)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (i <= 6.8e+44) {
tmp = (i * (alpha + i)) / (beta * beta);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if i <= 6.8e+44: tmp = (i * (alpha + i)) / (beta * beta) else: tmp = 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (i <= 6.8e+44) tmp = Float64(Float64(i * Float64(alpha + i)) / Float64(beta * beta)); else tmp = 0.0625; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (i <= 6.8e+44)
tmp = (i * (alpha + i)) / (beta * beta);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[i, 6.8e+44], N[(N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], 0.0625]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;i \leq 6.8 \cdot 10^{+44}:\\
\;\;\;\;\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 6.8e44Initial program 56.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6425.5
Applied rewrites25.5%
if 6.8e44 < i Initial program 9.5%
Taylor expanded in i around inf
Applied rewrites79.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i 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(alpha, beta, i)
use fmin_fmax_functions
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 15.0%
Taylor expanded in i around inf
Applied rewrites72.8%
herbie shell --seed 2025061
(FPCore (alpha beta i)
:name "Octave 3.8, jcobi/4"
:precision binary64
:pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
(/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))