
(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}
Sampling outcomes in binary64 precision:
Herbie found 13 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 (* (* 4.0 A) C)) (t_1 (- (pow B_m 2.0) t_0)))
(if (<= B_m 6.5e-77)
(/
(sqrt (* (* 2.0 (* t_1 F)) (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))
(- t_1))
(if (<= B_m 2.6e+69)
(/
(*
(sqrt (* 2.0 (* (- (* B_m B_m) t_0) F)))
(- (sqrt (+ (+ A C) (hypot (- A C) B_m)))))
t_1)
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))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 = (4.0 * A) * C;
double t_1 = pow(B_m, 2.0) - t_0;
double tmp;
if (B_m <= 6.5e-77) {
tmp = sqrt(((2.0 * (t_1 * F)) * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / -t_1;
} else if (B_m <= 2.6e+69) {
tmp = (sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * -sqrt(((A + C) + hypot((A - C), B_m)))) / t_1;
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
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 = Float64(Float64(4.0 * A) * C) t_1 = Float64((B_m ^ 2.0) - t_0) tmp = 0.0 if (B_m <= 6.5e-77) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)))) / Float64(-t_1)); elseif (B_m <= 2.6e+69) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) * Float64(-sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))))) / t_1); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); 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[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 6.5e-77], N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[B$95$m, 2.6e+69], N[(N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $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 := \left(4 \cdot A\right) \cdot C\\
t_1 := {B\_m}^{2} - t\_0\\
\mathbf{if}\;B\_m \leq 6.5 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 2.6 \cdot 10^{+69}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)} \cdot \left(-\sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}\right)}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 6.4999999999999999e-77Initial program 20.4%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.9
Applied rewrites18.9%
if 6.4999999999999999e-77 < B < 2.6000000000000002e69Initial program 42.8%
Applied rewrites45.8%
if 2.6000000000000002e69 < B Initial program 9.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6459.5
Applied rewrites59.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6459.1
Applied rewrites59.1%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6470.4
Applied rewrites70.4%
Final simplification34.0%
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 (- (pow B_m 2.0) (* (* 4.0 A) C))))
(if (<= (pow B_m 2.0) 5e-132)
(/
(sqrt (* (* 2.0 (* t_0 F)) (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))
(- t_0))
(if (<= (pow B_m 2.0) 2e+138)
(-
(sqrt
(*
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double tmp;
if (pow(B_m, 2.0) <= 5e-132) {
tmp = sqrt(((2.0 * (t_0 * F)) * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / -t_0;
} else if (pow(B_m, 2.0) <= 2e+138) {
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-132) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 2e+138) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); 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[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-132], 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] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+138], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-132}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+138}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-132Initial program 22.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.3
Applied rewrites32.3%
if 4.9999999999999999e-132 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e138Initial program 38.6%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites49.3%
if 2.0000000000000001e138 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.5%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6431.9
Applied rewrites31.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6431.7
Applied rewrites31.7%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6437.1
Applied rewrites37.1%
Final simplification37.9%
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 (* (* C C) F))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2 (- t_1))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
t_2)))
(if (<= t_3 -1e-198)
(-
(sqrt
(*
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_3 0.0)
(/
(sqrt
(*
(- A)
(fma
-1.0
(/
(fma
-2.0
(/ (* (* B_m B_m) (fma -2.0 t_0 (* 0.5 (* (* B_m B_m) F)))) A)
(* 8.0 (* (* B_m B_m) (* C F))))
A)
(* 16.0 t_0))))
t_2)
(if (<= t_3 INFINITY)
(sqrt (/ (- F) A))
(*
(/ (sqrt 2.0) (- B_m))
(* (sqrt F) (sqrt (+ A (hypot A 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 = (C * C) * F;
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = -t_1;
double t_3 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_2;
double tmp;
if (t_3 <= -1e-198) {
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_3 <= 0.0) {
tmp = sqrt((-A * fma(-1.0, (fma(-2.0, (((B_m * B_m) * fma(-2.0, t_0, (0.5 * ((B_m * B_m) * F)))) / A), (8.0 * ((B_m * B_m) * (C * F)))) / A), (16.0 * t_0)))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((A + hypot(A, 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 = Float64(Float64(C * C) * F) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(-t_1) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= -1e-198) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(Float64(-A) * fma(-1.0, Float64(fma(-2.0, Float64(Float64(Float64(B_m * B_m) * fma(-2.0, t_0, Float64(0.5 * Float64(Float64(B_m * B_m) * F)))) / A), Float64(8.0 * Float64(Float64(B_m * B_m) * Float64(C * F)))) / A), Float64(16.0 * t_0)))) / t_2); elseif (t_3 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(F) * sqrt(Float64(A + hypot(A, 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[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, -1e-198], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[((-A) * N[(-1.0 * N[(N[(-2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(-2.0 * t$95$0 + N[(0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(8.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(16.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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 := \left(C \cdot C\right) \cdot F\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := -t\_1\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{-198}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\left(-A\right) \cdot \mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-2, \frac{\left(B\_m \cdot B\_m\right) \cdot \mathsf{fma}\left(-2, t\_0, 0.5 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot F\right)\right)}{A}, 8 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot \left(C \cdot F\right)\right)\right)}{A}, 16 \cdot t\_0\right)}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + \mathsf{hypot}\left(A, B\_m\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.9999999999999991e-199Initial program 40.7%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites63.5%
if -9.9999999999999991e-199 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 7.9%
Taylor expanded in A around -inf
Applied rewrites17.8%
Taylor expanded in B around 0
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6421.7
Applied rewrites21.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 54.3%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites80.7%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6468.1
Applied rewrites68.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
flip--N/A
lower-/.f64N/A
lower--.f64N/A
metadata-evalN/A
metadata-evalN/A
sqr-powN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6418.9
Applied rewrites18.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6431.4
Applied rewrites31.4%
Final simplification45.6%
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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0))))
(if (<= t_1 -4e-216)
(-
(sqrt
(*
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_1 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt 2.0) (- B_m)) (* (sqrt F) (sqrt (+ A (hypot A 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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((A + hypot(A, B_m))));
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -Math.sqrt((((F * (A + (C + Math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((-F / A));
} else {
tmp = (Math.sqrt(2.0) / -B_m) * (Math.sqrt(F) * Math.sqrt((A + Math.hypot(A, 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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 tmp = 0 if t_1 <= -4e-216: tmp = -math.sqrt((((F * (A + (C + math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_1 <= math.inf: tmp = math.sqrt((-F / A)) else: tmp = (math.sqrt(2.0) / -B_m) * (math.sqrt(F) * math.sqrt((A + math.hypot(A, 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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) tmp = 0.0 if (t_1 <= -4e-216) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_1 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * Float64(sqrt(F) * sqrt(Float64(A + hypot(A, 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
tmp = 0.0;
if (t_1 <= -4e-216)
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_1 <= Inf)
tmp = sqrt((-F / A));
else
tmp = (sqrt(2.0) / -B_m) * (sqrt(F) * sqrt((A + hypot(A, 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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-216], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$1, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \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\_m}^{2}}\right)}}{-t\_0}\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{-216}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + \mathsf{hypot}\left(A, B\_m\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000002e-216Initial program 41.1%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites62.4%
if -4.0000000000000002e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites36.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6437.8
Applied rewrites37.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
flip--N/A
lower-/.f64N/A
lower--.f64N/A
metadata-evalN/A
metadata-evalN/A
sqr-powN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6418.9
Applied rewrites18.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6431.4
Applied rewrites31.4%
Final simplification45.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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0))))
(if (<= t_1 -4e-216)
(-
(sqrt
(*
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_1 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -Math.sqrt((((F * (A + (C + Math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((-F / A));
} else {
tmp = (Math.sqrt(F) / Math.sqrt(B_m)) * -Math.sqrt(2.0);
}
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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 tmp = 0 if t_1 <= -4e-216: tmp = -math.sqrt((((F * (A + (C + math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_1 <= math.inf: tmp = math.sqrt((-F / A)) else: tmp = (math.sqrt(F) / math.sqrt(B_m)) * -math.sqrt(2.0) 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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) tmp = 0.0 if (t_1 <= -4e-216) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_1 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
tmp = 0.0;
if (t_1 <= -4e-216)
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_1 <= Inf)
tmp = sqrt((-F / A));
else
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-216], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$1, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \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\_m}^{2}}\right)}}{-t\_0}\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{-216}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000002e-216Initial program 41.1%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites62.4%
if -4.0000000000000002e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites36.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6437.8
Applied rewrites37.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6423.8
Applied rewrites23.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6423.7
Applied rewrites23.7%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6428.4
Applied rewrites28.4%
Final simplification43.9%
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 (<= F -1e-310)
(sqrt (/ (- F) A))
(if (<= F 8.2e+68)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (+ C (hypot B_m C)))))
(- (sqrt (* (/ F B_m) 2.0))))))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 (F <= -1e-310) {
tmp = sqrt((-F / A));
} else if (F <= 8.2e+68) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = -sqrt(((F / B_m) * 2.0));
}
return tmp;
}
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 (F <= -1e-310) {
tmp = Math.sqrt((-F / A));
} else if (F <= 8.2e+68) {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * (C + Math.hypot(B_m, C))));
} else {
tmp = -Math.sqrt(((F / B_m) * 2.0));
}
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 F <= -1e-310: tmp = math.sqrt((-F / A)) elif F <= 8.2e+68: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * (C + math.hypot(B_m, C)))) else: tmp = -math.sqrt(((F / B_m) * 2.0)) 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 (F <= -1e-310) tmp = sqrt(Float64(Float64(-F) / A)); elseif (F <= 8.2e+68) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(C + hypot(B_m, C))))); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); 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 (F <= -1e-310)
tmp = sqrt((-F / A));
elseif (F <= 8.2e+68)
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (C + hypot(B_m, C))));
else
tmp = -sqrt(((F / B_m) * 2.0));
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[F, -1e-310], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[F, 8.2e+68], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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}\;F \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;F \leq 8.2 \cdot 10^{+68}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < -9.999999999999969e-311Initial program 34.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites55.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6460.9
Applied rewrites60.9%
if -9.999999999999969e-311 < F < 8.1999999999999998e68Initial program 25.4%
Taylor expanded in A 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
unpow2N/A
unpow2N/A
lower-hypot.f6426.8
Applied rewrites26.8%
if 8.1999999999999998e68 < F Initial program 11.8%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6424.0
Applied rewrites24.0%
Final simplification28.8%
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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0))))
(if (<= t_1 -4e-216)
(-
(sqrt
(*
(/
(* F (+ A (+ C (hypot B_m (- A C)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_1 INFINITY) (sqrt (/ (- F) A)) (- (sqrt (* (/ F B_m) 2.0)))))))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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = -sqrt(((F / B_m) * 2.0));
}
return tmp;
}
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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -4e-216) {
tmp = -Math.sqrt((((F * (A + (C + Math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((-F / A));
} else {
tmp = -Math.sqrt(((F / B_m) * 2.0));
}
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): t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C) t_1 = math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_0 tmp = 0 if t_1 <= -4e-216: tmp = -math.sqrt((((F * (A + (C + math.hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_1 <= math.inf: tmp = math.sqrt((-F / A)) else: tmp = -math.sqrt(((F / B_m) * 2.0)) 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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) tmp = 0.0 if (t_1 <= -4e-216) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_1 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); 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)
t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_0;
tmp = 0.0;
if (t_1 <= -4e-216)
tmp = -sqrt((((F * (A + (C + hypot(B_m, (A - C))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_1 <= Inf)
tmp = sqrt((-F / A));
else
tmp = -sqrt(((F / B_m) * 2.0));
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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-216], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$1, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \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\_m}^{2}}\right)}}{-t\_0}\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{-216}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.0000000000000002e-216Initial program 41.1%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites62.4%
if -4.0000000000000002e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 23.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites36.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6437.8
Applied rewrites37.8%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6423.8
Applied rewrites23.8%
Final simplification41.9%
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 (<= F -1e-310)
(sqrt (/ (- F) A))
(if (<= F 8.2e-57)
(*
F
(fma
-1.0
(sqrt (* (pow (* B_m F) -1.0) 2.0))
(* -0.5 (* (/ 1.0 (sqrt (* (pow B_m 3.0) F))) (* (sqrt 2.0) (+ A C))))))
(- (sqrt (* (/ F B_m) 2.0))))))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 (F <= -1e-310) {
tmp = sqrt((-F / A));
} else if (F <= 8.2e-57) {
tmp = F * fma(-1.0, sqrt((pow((B_m * F), -1.0) * 2.0)), (-0.5 * ((1.0 / sqrt((pow(B_m, 3.0) * F))) * (sqrt(2.0) * (A + C)))));
} else {
tmp = -sqrt(((F / B_m) * 2.0));
}
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 (F <= -1e-310) tmp = sqrt(Float64(Float64(-F) / A)); elseif (F <= 8.2e-57) tmp = Float64(F * fma(-1.0, sqrt(Float64((Float64(B_m * F) ^ -1.0) * 2.0)), Float64(-0.5 * Float64(Float64(1.0 / sqrt(Float64((B_m ^ 3.0) * F))) * Float64(sqrt(2.0) * Float64(A + C)))))); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); 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[F, -1e-310], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[F, 8.2e-57], N[(F * N[(-1.0 * N[Sqrt[N[(N[Power[N[(B$95$m * F), $MachinePrecision], -1.0], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[(1.0 / N[Sqrt[N[(N[Power[B$95$m, 3.0], $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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}\;F \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;F \leq 8.2 \cdot 10^{-57}:\\
\;\;\;\;F \cdot \mathsf{fma}\left(-1, \sqrt{{\left(B\_m \cdot F\right)}^{-1} \cdot 2}, -0.5 \cdot \left(\frac{1}{\sqrt{{B\_m}^{3} \cdot F}} \cdot \left(\sqrt{2} \cdot \left(A + C\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < -9.999999999999969e-311Initial program 34.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites55.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6460.9
Applied rewrites60.9%
if -9.999999999999969e-311 < F < 8.2000000000000003e-57Initial program 28.1%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6411.3
Applied rewrites11.3%
Taylor expanded in F around inf
lower-*.f64N/A
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites18.5%
if 8.2000000000000003e-57 < F Initial program 14.5%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6425.7
Applied rewrites25.7%
Final simplification26.8%
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 (/ F (pow B_m 3.0))))
(if (<= F -1e-310)
(sqrt (/ (- F) A))
(if (<= F 8e+68)
(*
F
(fma
-1.0
(sqrt (* (pow (* B_m F) -1.0) 2.0))
(*
-0.5
(* (/ 1.0 (sqrt (* (pow B_m 3.0) F))) (* (sqrt 2.0) (+ A C))))))
(*
(- A)
(fma
-1.0
(/
(fma
-1.0
(sqrt (* (/ F B_m) 2.0))
(* -0.5 (* (sqrt t_0) (* C (sqrt 2.0)))))
A)
(* 0.5 (sqrt (* t_0 2.0)))))))))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 = F / pow(B_m, 3.0);
double tmp;
if (F <= -1e-310) {
tmp = sqrt((-F / A));
} else if (F <= 8e+68) {
tmp = F * fma(-1.0, sqrt((pow((B_m * F), -1.0) * 2.0)), (-0.5 * ((1.0 / sqrt((pow(B_m, 3.0) * F))) * (sqrt(2.0) * (A + C)))));
} else {
tmp = -A * fma(-1.0, (fma(-1.0, sqrt(((F / B_m) * 2.0)), (-0.5 * (sqrt(t_0) * (C * sqrt(2.0))))) / A), (0.5 * sqrt((t_0 * 2.0))));
}
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 = Float64(F / (B_m ^ 3.0)) tmp = 0.0 if (F <= -1e-310) tmp = sqrt(Float64(Float64(-F) / A)); elseif (F <= 8e+68) tmp = Float64(F * fma(-1.0, sqrt(Float64((Float64(B_m * F) ^ -1.0) * 2.0)), Float64(-0.5 * Float64(Float64(1.0 / sqrt(Float64((B_m ^ 3.0) * F))) * Float64(sqrt(2.0) * Float64(A + C)))))); else tmp = Float64(Float64(-A) * fma(-1.0, Float64(fma(-1.0, sqrt(Float64(Float64(F / B_m) * 2.0)), Float64(-0.5 * Float64(sqrt(t_0) * Float64(C * sqrt(2.0))))) / A), Float64(0.5 * sqrt(Float64(t_0 * 2.0))))); 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[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[F, -1e-310], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[F, 8e+68], N[(F * N[(-1.0 * N[Sqrt[N[(N[Power[N[(B$95$m * F), $MachinePrecision], -1.0], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[(1.0 / N[Sqrt[N[(N[Power[B$95$m, 3.0], $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-A) * N[(-1.0 * N[(N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(0.5 * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $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 := \frac{F}{{B\_m}^{3}}\\
\mathbf{if}\;F \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;F \leq 8 \cdot 10^{+68}:\\
\;\;\;\;F \cdot \mathsf{fma}\left(-1, \sqrt{{\left(B\_m \cdot F\right)}^{-1} \cdot 2}, -0.5 \cdot \left(\frac{1}{\sqrt{{B\_m}^{3} \cdot F}} \cdot \left(\sqrt{2} \cdot \left(A + C\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-A\right) \cdot \mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \sqrt{\frac{F}{B\_m} \cdot 2}, -0.5 \cdot \left(\sqrt{t\_0} \cdot \left(C \cdot \sqrt{2}\right)\right)\right)}{A}, 0.5 \cdot \sqrt{t\_0 \cdot 2}\right)\\
\end{array}
\end{array}
if F < -9.999999999999969e-311Initial program 34.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites55.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6460.9
Applied rewrites60.9%
if -9.999999999999969e-311 < F < 7.99999999999999962e68Initial program 25.4%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6417.1
Applied rewrites17.1%
Taylor expanded in F around inf
lower-*.f64N/A
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites21.4%
if 7.99999999999999962e68 < F Initial program 11.8%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6423.0
Applied rewrites23.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites20.9%
Final simplification24.9%
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 (/ F (pow B_m 3.0))))
(if (<= F 8e+68)
(*
F
(fma
-1.0
(sqrt (* (pow (* B_m F) -1.0) 2.0))
(*
-0.5
(* (sqrt (pow (* (pow B_m 3.0) F) -1.0)) (* (sqrt 2.0) (+ A C))))))
(*
(- A)
(fma
-1.0
(/
(fma
-1.0
(sqrt (* (/ F B_m) 2.0))
(* -0.5 (* (sqrt t_0) (* C (sqrt 2.0)))))
A)
(* 0.5 (sqrt (* t_0 2.0))))))))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 = F / pow(B_m, 3.0);
double tmp;
if (F <= 8e+68) {
tmp = F * fma(-1.0, sqrt((pow((B_m * F), -1.0) * 2.0)), (-0.5 * (sqrt(pow((pow(B_m, 3.0) * F), -1.0)) * (sqrt(2.0) * (A + C)))));
} else {
tmp = -A * fma(-1.0, (fma(-1.0, sqrt(((F / B_m) * 2.0)), (-0.5 * (sqrt(t_0) * (C * sqrt(2.0))))) / A), (0.5 * sqrt((t_0 * 2.0))));
}
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 = Float64(F / (B_m ^ 3.0)) tmp = 0.0 if (F <= 8e+68) tmp = Float64(F * fma(-1.0, sqrt(Float64((Float64(B_m * F) ^ -1.0) * 2.0)), Float64(-0.5 * Float64(sqrt((Float64((B_m ^ 3.0) * F) ^ -1.0)) * Float64(sqrt(2.0) * Float64(A + C)))))); else tmp = Float64(Float64(-A) * fma(-1.0, Float64(fma(-1.0, sqrt(Float64(Float64(F / B_m) * 2.0)), Float64(-0.5 * Float64(sqrt(t_0) * Float64(C * sqrt(2.0))))) / A), Float64(0.5 * sqrt(Float64(t_0 * 2.0))))); 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[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[F, 8e+68], N[(F * N[(-1.0 * N[Sqrt[N[(N[Power[N[(B$95$m * F), $MachinePrecision], -1.0], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[Sqrt[N[Power[N[(N[Power[B$95$m, 3.0], $MachinePrecision] * F), $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-A) * N[(-1.0 * N[(N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(0.5 * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $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 := \frac{F}{{B\_m}^{3}}\\
\mathbf{if}\;F \leq 8 \cdot 10^{+68}:\\
\;\;\;\;F \cdot \mathsf{fma}\left(-1, \sqrt{{\left(B\_m \cdot F\right)}^{-1} \cdot 2}, -0.5 \cdot \left(\sqrt{{\left({B\_m}^{3} \cdot F\right)}^{-1}} \cdot \left(\sqrt{2} \cdot \left(A + C\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-A\right) \cdot \mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \sqrt{\frac{F}{B\_m} \cdot 2}, -0.5 \cdot \left(\sqrt{t\_0} \cdot \left(C \cdot \sqrt{2}\right)\right)\right)}{A}, 0.5 \cdot \sqrt{t\_0 \cdot 2}\right)\\
\end{array}
\end{array}
if F < 7.99999999999999962e68Initial program 26.8%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6414.4
Applied rewrites14.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites13.6%
Taylor expanded in F around inf
flip3-+N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites18.4%
if 7.99999999999999962e68 < F Initial program 11.8%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6423.0
Applied rewrites23.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites20.9%
Final simplification19.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
(let* ((t_0 (/ F (pow B_m 3.0))))
(if (<= F 8e+68)
(*
F
(fma
-1.0
(sqrt (* (pow (* B_m F) -1.0) 2.0))
(* -0.5 (* (/ 1.0 (sqrt (* (pow B_m 3.0) F))) (* (sqrt 2.0) (+ A C))))))
(*
(- A)
(fma
-1.0
(/
(fma
-1.0
(sqrt (* (/ F B_m) 2.0))
(* -0.5 (* (sqrt t_0) (* C (sqrt 2.0)))))
A)
(* 0.5 (sqrt (* t_0 2.0))))))))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 = F / pow(B_m, 3.0);
double tmp;
if (F <= 8e+68) {
tmp = F * fma(-1.0, sqrt((pow((B_m * F), -1.0) * 2.0)), (-0.5 * ((1.0 / sqrt((pow(B_m, 3.0) * F))) * (sqrt(2.0) * (A + C)))));
} else {
tmp = -A * fma(-1.0, (fma(-1.0, sqrt(((F / B_m) * 2.0)), (-0.5 * (sqrt(t_0) * (C * sqrt(2.0))))) / A), (0.5 * sqrt((t_0 * 2.0))));
}
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 = Float64(F / (B_m ^ 3.0)) tmp = 0.0 if (F <= 8e+68) tmp = Float64(F * fma(-1.0, sqrt(Float64((Float64(B_m * F) ^ -1.0) * 2.0)), Float64(-0.5 * Float64(Float64(1.0 / sqrt(Float64((B_m ^ 3.0) * F))) * Float64(sqrt(2.0) * Float64(A + C)))))); else tmp = Float64(Float64(-A) * fma(-1.0, Float64(fma(-1.0, sqrt(Float64(Float64(F / B_m) * 2.0)), Float64(-0.5 * Float64(sqrt(t_0) * Float64(C * sqrt(2.0))))) / A), Float64(0.5 * sqrt(Float64(t_0 * 2.0))))); 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[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[F, 8e+68], N[(F * N[(-1.0 * N[Sqrt[N[(N[Power[N[(B$95$m * F), $MachinePrecision], -1.0], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[(1.0 / N[Sqrt[N[(N[Power[B$95$m, 3.0], $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(A + C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-A) * N[(-1.0 * N[(N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(0.5 * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $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 := \frac{F}{{B\_m}^{3}}\\
\mathbf{if}\;F \leq 8 \cdot 10^{+68}:\\
\;\;\;\;F \cdot \mathsf{fma}\left(-1, \sqrt{{\left(B\_m \cdot F\right)}^{-1} \cdot 2}, -0.5 \cdot \left(\frac{1}{\sqrt{{B\_m}^{3} \cdot F}} \cdot \left(\sqrt{2} \cdot \left(A + C\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-A\right) \cdot \mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \sqrt{\frac{F}{B\_m} \cdot 2}, -0.5 \cdot \left(\sqrt{t\_0} \cdot \left(C \cdot \sqrt{2}\right)\right)\right)}{A}, 0.5 \cdot \sqrt{t\_0 \cdot 2}\right)\\
\end{array}
\end{array}
if F < 7.99999999999999962e68Initial program 26.8%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6414.4
Applied rewrites14.4%
Taylor expanded in F around inf
lower-*.f64N/A
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites18.3%
if 7.99999999999999962e68 < F Initial program 11.8%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6423.0
Applied rewrites23.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites20.9%
Final simplification19.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
(let* ((t_0 (/ F (pow B_m 3.0))))
(*
(- A)
(fma
-1.0
(/
(fma
-1.0
(sqrt (* (/ F B_m) 2.0))
(* -0.5 (* (sqrt t_0) (* C (sqrt 2.0)))))
A)
(* 0.5 (sqrt (* t_0 2.0)))))))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 = F / pow(B_m, 3.0);
return -A * fma(-1.0, (fma(-1.0, sqrt(((F / B_m) * 2.0)), (-0.5 * (sqrt(t_0) * (C * sqrt(2.0))))) / A), (0.5 * sqrt((t_0 * 2.0))));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(F / (B_m ^ 3.0)) return Float64(Float64(-A) * fma(-1.0, Float64(fma(-1.0, sqrt(Float64(Float64(F / B_m) * 2.0)), Float64(-0.5 * Float64(sqrt(t_0) * Float64(C * sqrt(2.0))))) / A), Float64(0.5 * sqrt(Float64(t_0 * 2.0))))) 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[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]}, N[((-A) * N[(-1.0 * N[(N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] + N[(-0.5 * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision] + N[(0.5 * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $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 := \frac{F}{{B\_m}^{3}}\\
\left(-A\right) \cdot \mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \sqrt{\frac{F}{B\_m} \cdot 2}, -0.5 \cdot \left(\sqrt{t\_0} \cdot \left(C \cdot \sqrt{2}\right)\right)\right)}{A}, 0.5 \cdot \sqrt{t\_0 \cdot 2}\right)
\end{array}
\end{array}
Initial program 20.5%
Taylor expanded in B around inf
lower-fma.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-+.f6418.0
Applied rewrites18.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
Applied rewrites16.6%
Final simplification16.6%
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 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
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 (sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C))));
}
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 (Math.sqrt(2.0) / B_m) * Math.sqrt((F * (C + Math.hypot(B_m, C))));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return (math.sqrt(2.0) / B_m) * math.sqrt((F * (C + math.hypot(B_m, C))))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C))))) 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 = (sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C))));
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[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}
\end{array}
Initial program 20.5%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites7.6%
Taylor expanded in A around 0
lower-*.f64N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
pow2N/A
pow2N/A
lower-hypot.f6415.8
Applied rewrites15.8%
herbie shell --seed 2025057
(FPCore (A B C F)
:name "ABCF->ab-angle a"
: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))))