
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_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(a, b, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_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(a, b, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e+67)
(/
(- (sqrt (* (* 2.0 (* t_0 F)) (fma -0.5 (/ (* B_m B_m) C) (* 2.0 A)))))
t_0)
(if (<= (pow B_m 2.0) 1e+237)
(/
(-
(*
(* B_m (sqrt 2.0))
(sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(* -1.0 (sqrt (* -2.0 (/ F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e+67) {
tmp = -sqrt(((2.0 * (t_0 * F)) * fma(-0.5, ((B_m * B_m) / C), (2.0 * A)))) / t_0;
} else if (pow(B_m, 2.0) <= 1e+237) {
tmp = -((B_m * sqrt(2.0)) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m))))))) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+67) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * fma(-0.5, Float64(Float64(B_m * B_m) / C), Float64(2.0 * A))))) / t_0); elseif ((B_m ^ 2.0) <= 1e+237) tmp = Float64(Float64(-Float64(Float64(B_m * sqrt(2.0)) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+67], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+237], N[((-N[(N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{+67}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, 2 \cdot A\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+237}:\\
\;\;\;\;\frac{-\left(B\_m \cdot \sqrt{2}\right) \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999983e66Initial program 24.8%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6443.1
Applied rewrites43.1%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.0
Applied rewrites43.0%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.0
Applied rewrites43.0%
Taylor expanded in A around 0
lower-fma.f64N/A
pow2N/A
lift-/.f64N/A
lift-*.f64N/A
lower-*.f6443.1
Applied rewrites43.1%
if 9.99999999999999983e66 < (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999994e236Initial program 31.4%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6442.4
Applied rewrites42.4%
if 9.9999999999999994e236 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.7%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.2
Applied rewrites49.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 1e+67)
(/
(- (sqrt (* (* 2.0 (* t_0 F)) (fma -0.5 (/ (* B_m B_m) C) (* 2.0 A)))))
t_0)
(if (<= (pow B_m 2.0) 1e+235)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(* -1.0 (sqrt (* -2.0 (/ F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 1e+67) {
tmp = -sqrt(((2.0 * (t_0 * F)) * fma(-0.5, ((B_m * B_m) / C), (2.0 * A)))) / t_0;
} else if (pow(B_m, 2.0) <= 1e+235) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+67) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * fma(-0.5, Float64(Float64(B_m * B_m) / C), Float64(2.0 * A))))) / t_0); elseif ((B_m ^ 2.0) <= 1e+235) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+67], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+235], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{+67}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, 2 \cdot A\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+235}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999983e66Initial program 24.8%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6443.1
Applied rewrites43.1%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.0
Applied rewrites43.0%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.0
Applied rewrites43.0%
Taylor expanded in A around 0
lower-fma.f64N/A
pow2N/A
lift-/.f64N/A
lift-*.f64N/A
lower-*.f6443.1
Applied rewrites43.1%
if 9.99999999999999983e66 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e235Initial program 31.4%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6442.5
Applied rewrites42.5%
if 1.0000000000000001e235 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.1
Applied rewrites49.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B_m B_m))))
(if (<= (pow B_m 2.0) 2e+16)
(/ (- (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 A)))) t_0)
(if (<= (pow B_m 2.0) 1e+235)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(* -1.0 (sqrt (* -2.0 (/ F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 2e+16) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * A))) / t_0;
} else if (pow(B_m, 2.0) <= 1e+235) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+16) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * A)))) / t_0); elseif ((B_m ^ 2.0) <= 1e+235) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+16], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+235], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+16}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+235}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e16Initial program 23.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6443.9
Applied rewrites43.9%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.9
Applied rewrites43.9%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6443.9
Applied rewrites43.9%
Taylor expanded in A around -inf
lower-*.f6444.5
Applied rewrites44.5%
if 2e16 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e235Initial program 33.1%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6441.2
Applied rewrites41.2%
if 1.0000000000000001e235 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.1
Applied rewrites49.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-10)
(/
(- (sqrt (* -8.0 (* A (* C (* F (- A (* -1.0 A))))))))
(fma -4.0 (* A C) (* B_m B_m)))
(if (<= (pow B_m 2.0) 1e+235)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(* -1.0 (sqrt (* -2.0 (/ F B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-10) {
tmp = -sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (pow(B_m, 2.0) <= 1e+235) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-10) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A - Float64(-1.0 * A)))))))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif ((B_m ^ 2.0) <= 1e+235) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-10], N[((-N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A - N[(-1.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+235], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-10}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A - -1 \cdot A\right)\right)\right)\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+235}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000004e-10Initial program 22.8%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6444.4
Applied rewrites44.4%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6444.4
Applied rewrites44.4%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6444.4
Applied rewrites44.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
lift-*.f6440.4
Applied rewrites40.4%
if 1.00000000000000004e-10 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e235Initial program 34.2%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6440.7
Applied rewrites40.7%
if 1.0000000000000001e235 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.1
Applied rewrites49.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-303)
(/ (- (sqrt (* -16.0 (* (* A A) (* C F))))) (fma -4.0 (* A C) (* B_m B_m)))
(if (<= (pow B_m 2.0) 1e-107)
(* -1.0 (sqrt (* (/ F C) -1.0)))
(if (<= (pow B_m 2.0) 1e+235)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(* -1.0 (sqrt (* -2.0 (/ F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-303) {
tmp = -sqrt((-16.0 * ((A * A) * (C * F)))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (pow(B_m, 2.0) <= 1e-107) {
tmp = -1.0 * sqrt(((F / C) * -1.0));
} else if (pow(B_m, 2.0) <= 1e+235) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-303) tmp = Float64(Float64(-sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F))))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif ((B_m ^ 2.0) <= 1e-107) tmp = Float64(-1.0 * sqrt(Float64(Float64(F / C) * -1.0))); elseif ((B_m ^ 2.0) <= 1e+235) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-303], N[((-N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-107], N[(-1.0 * N[Sqrt[N[(N[(F / C), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+235], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-303}:\\
\;\;\;\;\frac{-\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{-107}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{C} \cdot -1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+235}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999931e-304Initial program 17.1%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6445.5
Applied rewrites45.5%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6445.5
Applied rewrites45.5%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6445.5
Applied rewrites45.5%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6430.0
Applied rewrites30.0%
if 9.99999999999999931e-304 < (pow.f64 B #s(literal 2 binary64)) < 1e-107Initial program 24.9%
Taylor expanded in A around -inf
lower-*.f64N/A
sqrt-unprodN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f640.0
Applied rewrites0.0%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lift-/.f6435.8
Applied rewrites35.8%
if 1e-107 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e235Initial program 35.1%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6437.5
Applied rewrites37.5%
if 1.0000000000000001e235 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.1
Applied rewrites49.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 1e-107)
(* -1.0 (sqrt (* (/ F C) -1.0)))
(if (<= (pow B_m 2.0) 1e+235)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (fma A A (* B_m B_m))))))))
(* -1.0 (sqrt (* -2.0 (/ F B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e-107) {
tmp = -1.0 * sqrt(((F / C) * -1.0));
} else if (pow(B_m, 2.0) <= 1e+235) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(fma(A, A, (B_m * B_m)))))));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e-107) tmp = Float64(-1.0 * sqrt(Float64(Float64(F / C) * -1.0))); elseif ((B_m ^ 2.0) <= 1e+235) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(fma(A, A, Float64(B_m * B_m)))))))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-107], N[(-1.0 * N[Sqrt[N[(N[(F / C), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+235], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(A * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{-107}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{C} \cdot -1}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+235}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B\_m \cdot B\_m\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-107Initial program 20.0%
Taylor expanded in A around -inf
lower-*.f64N/A
sqrt-unprodN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f640.0
Applied rewrites0.0%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lift-/.f6438.2
Applied rewrites38.2%
if 1e-107 < (pow.f64 B #s(literal 2 binary64)) < 1.0000000000000001e235Initial program 35.1%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6437.5
Applied rewrites37.5%
if 1.0000000000000001e235 < (pow.f64 B #s(literal 2 binary64)) Initial program 3.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6449.1
Applied rewrites49.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= (pow B_m 2.0) 5e+85) (* -1.0 (sqrt (* (/ F C) -1.0))) (* -1.0 (sqrt (* -2.0 (/ F B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 5e+85) {
tmp = -1.0 * sqrt(((F / C) * -1.0));
} else {
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = private
NOTE: A, B_m, C, and F 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_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 5d+85) then
tmp = (-1.0d0) * sqrt(((f / c) * (-1.0d0)))
else
tmp = (-1.0d0) * sqrt(((-2.0d0) * (f / b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 5e+85) {
tmp = -1.0 * Math.sqrt(((F / C) * -1.0));
} else {
tmp = -1.0 * Math.sqrt((-2.0 * (F / B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 5e+85: tmp = -1.0 * math.sqrt(((F / C) * -1.0)) else: tmp = -1.0 * math.sqrt((-2.0 * (F / B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+85) tmp = Float64(-1.0 * sqrt(Float64(Float64(F / C) * -1.0))); else tmp = Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+85)
tmp = -1.0 * sqrt(((F / C) * -1.0));
else
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+85], N[(-1.0 * N[Sqrt[N[(N[(F / C), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+85}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{C} \cdot -1}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e85Initial program 25.1%
Taylor expanded in A around -inf
lower-*.f64N/A
sqrt-unprodN/A
metadata-evalN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f640.0
Applied rewrites0.0%
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lift-/.f6437.0
Applied rewrites37.0%
if 5.0000000000000001e85 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.2%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6446.4
Applied rewrites46.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* -1.0 (sqrt (* -2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -1.0 * sqrt((-2.0 * (F / B_m)));
}
B_m = private
NOTE: A, B_m, C, and F 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_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (-1.0d0) * sqrt(((-2.0d0) * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -1.0 * Math.sqrt((-2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -1.0 * math.sqrt((-2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-1.0 * sqrt(Float64(-2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -1.0 * sqrt((-2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(-1.0 * N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-1 \cdot \sqrt{-2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 19.1%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites18.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-/.f6427.1
Applied rewrites27.1%
herbie shell --seed 2025128
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))