
(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 15 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 (* C A) -4.0 (* B_m B_m)))
(t_1 (/ (* B_m B_m) A))
(t_2 (fma t_1 -0.5 (* C 2.0)))
(t_3 (fma -4.0 (* C A) (* B_m B_m)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5 (- t_4))
(t_6
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
t_5)))
(if (<= t_6 (- INFINITY))
(/ (* (* (sqrt t_0) (sqrt t_2)) (sqrt (* F 2.0))) (- t_0))
(if (<= t_6 -4e-195)
(/
(* (sqrt (* (+ (+ (hypot B_m (- A C)) A) C) 2.0)) (sqrt (* F t_3)))
t_5)
(if (<= t_6 0.0)
(/
(* (sqrt (* (fma -0.5 t_1 (* C 2.0)) (* t_0 2.0))) (- (sqrt F)))
t_4)
(if (<= t_6 INFINITY)
(/ (* (- (sqrt (* t_3 F))) (sqrt (* 2.0 t_2))) t_0)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F))))))))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((C * A), -4.0, (B_m * B_m));
double t_1 = (B_m * B_m) / A;
double t_2 = fma(t_1, -0.5, (C * 2.0));
double t_3 = fma(-4.0, (C * A), (B_m * B_m));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = -t_4;
double t_6 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_5;
double tmp;
if (t_6 <= -((double) INFINITY)) {
tmp = ((sqrt(t_0) * sqrt(t_2)) * sqrt((F * 2.0))) / -t_0;
} else if (t_6 <= -4e-195) {
tmp = (sqrt((((hypot(B_m, (A - C)) + A) + C) * 2.0)) * sqrt((F * t_3))) / t_5;
} else if (t_6 <= 0.0) {
tmp = (sqrt((fma(-0.5, t_1, (C * 2.0)) * (t_0 * 2.0))) * -sqrt(F)) / t_4;
} else if (t_6 <= ((double) INFINITY)) {
tmp = (-sqrt((t_3 * F)) * sqrt((2.0 * t_2))) / t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = Float64(Float64(B_m * B_m) / A) t_2 = fma(t_1, -0.5, Float64(C * 2.0)) t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(-t_4) t_6 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_5) tmp = 0.0 if (t_6 <= Float64(-Inf)) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_2)) * sqrt(Float64(F * 2.0))) / Float64(-t_0)); elseif (t_6 <= -4e-195) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C) * 2.0)) * sqrt(Float64(F * t_3))) / t_5); elseif (t_6 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, t_1, Float64(C * 2.0)) * Float64(t_0 * 2.0))) * Float64(-sqrt(F))) / t_4); elseif (t_6 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_3 * F))) * sqrt(Float64(2.0 * t_2))) / t_0); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, Block[{t$95$6 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$5), $MachinePrecision]}, If[LessEqual[t$95$6, (-Infinity)], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$6, -4e-195], N[(N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * t$95$1 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[((-N[Sqrt[N[(t$95$3 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \frac{B\_m \cdot B\_m}{A}\\
t_2 := \mathsf{fma}\left(t\_1, -0.5, C \cdot 2\right)\\
t_3 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := -t\_4\\
t_6 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_5}\\
\mathbf{if}\;t\_6 \leq -\infty:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_2}\right) \cdot \sqrt{F \cdot 2}}{-t\_0}\\
\mathbf{elif}\;t\_6 \leq -4 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C\right) \cdot 2} \cdot \sqrt{F \cdot t\_3}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, t\_1, C \cdot 2\right) \cdot \left(t\_0 \cdot 2\right)} \cdot \left(-\sqrt{F}\right)}{t\_4}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_3 \cdot F}\right) \cdot \sqrt{2 \cdot t\_2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\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))) < -inf.0Initial program 3.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.8
Applied rewrites19.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites19.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites29.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites42.3%
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))) < -4.0000000000000004e-195Initial program 95.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites96.2%
if -4.0000000000000004e-195 < (/.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 3.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites40.6%
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 35.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6440.8
Applied rewrites40.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites40.8%
Applied rewrites41.3%
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 A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6419.0
Applied rewrites19.0%
Applied rewrites29.5%
Applied rewrites29.5%
Final simplification44.7%
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 (* C A) (* B_m B_m)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (+ (hypot C B_m) C))
(t_3 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (- t_1)))
(if (<= t_5 -5e+172)
(/ (* (* (sqrt t_1) (sqrt t_3)) (sqrt (* F 2.0))) t_6)
(if (<= t_5 -4e-129)
(* (- (sqrt 2.0)) (sqrt (/ (* (+ (+ (hypot (- A C) B_m) C) A) F) t_0)))
(if (<= t_5 -1.5e-188)
(/ (sqrt (* (* t_2 F) 2.0)) (- B_m))
(if (<= t_5 2e+159)
(/ (sqrt (* t_0 (* (* F 2.0) t_3))) t_6)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_0 F))) (sqrt (* 2.0 t_3))) t_1)
(* (/ (sqrt (* t_2 2.0)) (- B_m)) (sqrt F)))))))))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, (C * A), (B_m * B_m));
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = hypot(C, B_m) + C;
double t_3 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = -t_1;
double tmp;
if (t_5 <= -5e+172) {
tmp = ((sqrt(t_1) * sqrt(t_3)) * sqrt((F * 2.0))) / t_6;
} else if (t_5 <= -4e-129) {
tmp = -sqrt(2.0) * sqrt(((((hypot((A - C), B_m) + C) + A) * F) / t_0));
} else if (t_5 <= -1.5e-188) {
tmp = sqrt(((t_2 * F) * 2.0)) / -B_m;
} else if (t_5 <= 2e+159) {
tmp = sqrt((t_0 * ((F * 2.0) * t_3))) / t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_0 * F)) * sqrt((2.0 * t_3))) / t_1;
} else {
tmp = (sqrt((t_2 * 2.0)) / -B_m) * sqrt(F);
}
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(C * A), Float64(B_m * B_m)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = Float64(hypot(C, B_m) + C) t_3 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(-t_1) tmp = 0.0 if (t_5 <= -5e+172) tmp = Float64(Float64(Float64(sqrt(t_1) * sqrt(t_3)) * sqrt(Float64(F * 2.0))) / t_6); elseif (t_5 <= -4e-129) tmp = Float64(Float64(-sqrt(2.0)) * sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / t_0))); elseif (t_5 <= -1.5e-188) tmp = Float64(sqrt(Float64(Float64(t_2 * F) * 2.0)) / Float64(-B_m)); elseif (t_5 <= 2e+159) tmp = Float64(sqrt(Float64(t_0 * Float64(Float64(F * 2.0) * t_3))) / t_6); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * F))) * sqrt(Float64(2.0 * t_3))) / t_1); else tmp = Float64(Float64(sqrt(Float64(t_2 * 2.0)) / Float64(-B_m)) * sqrt(F)); 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[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = (-t$95$1)}, If[LessEqual[t$95$5, -5e+172], N[(N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -4e-129], N[((-N[Sqrt[2.0], $MachinePrecision]) * N[Sqrt[N[(N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -1.5e-188], N[(N[Sqrt[N[(N[(t$95$2 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$5, 2e+159], N[(N[Sqrt[N[(t$95$0 * N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(t$95$2 * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{hypot}\left(C, B\_m\right) + C\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := -t\_1\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{+172}:\\
\;\;\;\;\frac{\left(\sqrt{t\_1} \cdot \sqrt{t\_3}\right) \cdot \sqrt{F \cdot 2}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq -4 \cdot 10^{-129}:\\
\;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{t\_0}}\\
\mathbf{elif}\;t\_5 \leq -1.5 \cdot 10^{-188}:\\
\;\;\;\;\frac{\sqrt{\left(t\_2 \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_5 \leq 2 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot \left(\left(F \cdot 2\right) \cdot t\_3\right)}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot F}\right) \cdot \sqrt{2 \cdot t\_3}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\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))) < -5.0000000000000001e172Initial program 8.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites33.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites45.1%
if -5.0000000000000001e172 < (/.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))) < -3.9999999999999997e-129Initial program 95.9%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites96.8%
if -3.9999999999999997e-129 < (/.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))) < -1.50000000000000008e-188Initial program 99.8%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6416.0
Applied rewrites16.0%
Applied rewrites16.2%
if -1.50000000000000008e-188 < (/.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))) < 1.9999999999999999e159Initial program 15.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6452.9
Applied rewrites52.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites52.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
Applied rewrites50.8%
if 1.9999999999999999e159 < (/.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 20.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.5
Applied rewrites32.5%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites32.5%
Applied rewrites33.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%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6419.0
Applied rewrites19.0%
Applied rewrites29.5%
Applied rewrites29.5%
Final simplification43.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 (fma (* C A) -4.0 (* B_m B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (/ (* B_m B_m) A))
(t_3 (fma t_2 -0.5 (* C 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4))))
(if (<= t_5 (- INFINITY))
(/ (* (* (sqrt t_0) (sqrt t_3)) (sqrt (* F 2.0))) (- t_0))
(if (<= t_5 -4e-195)
(*
(sqrt (* (* 2.0 F) t_1))
(/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) (- t_1)))
(if (<= t_5 0.0)
(/
(* (sqrt (* (fma -0.5 t_2 (* C 2.0)) (* t_0 2.0))) (- (sqrt F)))
t_4)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_1 F))) (sqrt (* 2.0 t_3))) t_0)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F))))))))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((C * A), -4.0, (B_m * B_m));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = (B_m * B_m) / A;
double t_3 = fma(t_2, -0.5, (C * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = ((sqrt(t_0) * sqrt(t_3)) * sqrt((F * 2.0))) / -t_0;
} else if (t_5 <= -4e-195) {
tmp = sqrt(((2.0 * F) * t_1)) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / -t_1);
} else if (t_5 <= 0.0) {
tmp = (sqrt((fma(-0.5, t_2, (C * 2.0)) * (t_0 * 2.0))) * -sqrt(F)) / t_4;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_1 * F)) * sqrt((2.0 * t_3))) / t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = Float64(Float64(B_m * B_m) / A) t_3 = fma(t_2, -0.5, Float64(C * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_3)) * sqrt(Float64(F * 2.0))) / Float64(-t_0)); elseif (t_5 <= -4e-195) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * t_1)) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / Float64(-t_1))); elseif (t_5 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, t_2, Float64(C * 2.0)) * Float64(t_0 * 2.0))) * Float64(-sqrt(F))) / t_4); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_1 * F))) * sqrt(Float64(2.0 * t_3))) / t_0); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$5, -4e-195], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * t$95$2 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \frac{B\_m \cdot B\_m}{A}\\
t_3 := \mathsf{fma}\left(t\_2, -0.5, C \cdot 2\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_3}\right) \cdot \sqrt{F \cdot 2}}{-t\_0}\\
\mathbf{elif}\;t\_5 \leq -4 \cdot 10^{-195}:\\
\;\;\;\;\sqrt{\left(2 \cdot F\right) \cdot t\_1} \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{-t\_1}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, t\_2, C \cdot 2\right) \cdot \left(t\_0 \cdot 2\right)} \cdot \left(-\sqrt{F}\right)}{t\_4}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_1 \cdot F}\right) \cdot \sqrt{2 \cdot t\_3}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\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))) < -inf.0Initial program 3.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.8
Applied rewrites19.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites19.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites29.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites42.3%
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))) < -4.0000000000000004e-195Initial program 95.7%
Applied rewrites96.0%
if -4.0000000000000004e-195 < (/.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 3.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites40.6%
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 35.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6440.8
Applied rewrites40.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites40.8%
Applied rewrites41.3%
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 A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6419.0
Applied rewrites19.0%
Applied rewrites29.5%
Applied rewrites29.5%
Final simplification44.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 (fma (* C A) -4.0 (* B_m B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_3 (sqrt (* F 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (- t_0)))
(if (<= t_5 (- INFINITY))
(/ (* (* (sqrt t_0) (sqrt t_2)) t_3) t_6)
(if (<= t_5 -4e-195)
(*
(sqrt (* (* 2.0 F) t_1))
(/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) (- t_1)))
(if (<= t_5 0.0)
(/ (* (sqrt (* t_2 t_1)) t_3) t_6)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_1 F))) (sqrt (* 2.0 t_2))) t_0)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F))))))))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((C * A), -4.0, (B_m * B_m));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_3 = sqrt((F * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = -t_0;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = ((sqrt(t_0) * sqrt(t_2)) * t_3) / t_6;
} else if (t_5 <= -4e-195) {
tmp = sqrt(((2.0 * F) * t_1)) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / -t_1);
} else if (t_5 <= 0.0) {
tmp = (sqrt((t_2 * t_1)) * t_3) / t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_1 * F)) * sqrt((2.0 * t_2))) / t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_3 = sqrt(Float64(F * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(-t_0) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_2)) * t_3) / t_6); elseif (t_5 <= -4e-195) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * t_1)) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / Float64(-t_1))); elseif (t_5 <= 0.0) tmp = Float64(Float64(sqrt(Float64(t_2 * t_1)) * t_3) / t_6); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_1 * F))) * sqrt(Float64(2.0 * t_2))) / t_0); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = (-t$95$0)}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -4e-195], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[Sqrt[N[(t$95$2 * t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_3 := \sqrt{F \cdot 2}\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := -t\_0\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_2}\right) \cdot t\_3}{t\_6}\\
\mathbf{elif}\;t\_5 \leq -4 \cdot 10^{-195}:\\
\;\;\;\;\sqrt{\left(2 \cdot F\right) \cdot t\_1} \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{-t\_1}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot t\_1} \cdot t\_3}{t\_6}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_1 \cdot F}\right) \cdot \sqrt{2 \cdot t\_2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\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))) < -inf.0Initial program 3.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.8
Applied rewrites19.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites19.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites29.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites42.3%
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))) < -4.0000000000000004e-195Initial program 95.7%
Applied rewrites96.0%
if -4.0000000000000004e-195 < (/.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 3.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites50.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites40.6%
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 35.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6440.8
Applied rewrites40.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites40.8%
Applied rewrites41.3%
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 A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6419.0
Applied rewrites19.0%
Applied rewrites29.5%
Applied rewrites29.5%
Final simplification44.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 (fma (* C A) -4.0 (* B_m B_m)))
(t_1 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (sqrt (* F 2.0)))
(t_4 (- t_0))
(t_5 (* (* 4.0 A) C))
(t_6 (- (pow B_m 2.0) t_5))
(t_7
(/
(sqrt
(*
(* 2.0 (* t_6 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_6))))
(if (<= t_7 (- INFINITY))
(/ (* (* (sqrt t_0) (sqrt t_1)) t_3) t_4)
(if (<= t_7 -4e-195)
(/
(sqrt (* (+ (+ (hypot B_m (- A C)) A) C) (* (* 2.0 F) t_2)))
(fma (- B_m) B_m t_5))
(if (<= t_7 0.0)
(/ (* (sqrt (* t_1 t_2)) t_3) t_4)
(if (<= t_7 INFINITY)
(/ (* (- (sqrt (* t_2 F))) (sqrt (* 2.0 t_1))) t_0)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F))))))))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((C * A), -4.0, (B_m * B_m));
double t_1 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = sqrt((F * 2.0));
double t_4 = -t_0;
double t_5 = (4.0 * A) * C;
double t_6 = pow(B_m, 2.0) - t_5;
double t_7 = sqrt(((2.0 * (t_6 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_6;
double tmp;
if (t_7 <= -((double) INFINITY)) {
tmp = ((sqrt(t_0) * sqrt(t_1)) * t_3) / t_4;
} else if (t_7 <= -4e-195) {
tmp = sqrt((((hypot(B_m, (A - C)) + A) + C) * ((2.0 * F) * t_2))) / fma(-B_m, B_m, t_5);
} else if (t_7 <= 0.0) {
tmp = (sqrt((t_1 * t_2)) * t_3) / t_4;
} else if (t_7 <= ((double) INFINITY)) {
tmp = (-sqrt((t_2 * F)) * sqrt((2.0 * t_1))) / t_0;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = sqrt(Float64(F * 2.0)) t_4 = Float64(-t_0) t_5 = Float64(Float64(4.0 * A) * C) t_6 = Float64((B_m ^ 2.0) - t_5) t_7 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_6 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_6)) tmp = 0.0 if (t_7 <= Float64(-Inf)) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_1)) * t_3) / t_4); elseif (t_7 <= -4e-195) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C) * Float64(Float64(2.0 * F) * t_2))) / fma(Float64(-B_m), B_m, t_5)); elseif (t_7 <= 0.0) tmp = Float64(Float64(sqrt(Float64(t_1 * t_2)) * t_3) / t_4); elseif (t_7 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_2 * F))) * sqrt(Float64(2.0 * t_1))) / t_0); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, Block[{t$95$5 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$6 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$5), $MachinePrecision]}, Block[{t$95$7 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$6 * 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$6)), $MachinePrecision]}, If[LessEqual[t$95$7, (-Infinity)], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$7, -4e-195], N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$7, 0.0], N[(N[(N[Sqrt[N[(t$95$1 * t$95$2), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$7, Infinity], N[(N[((-N[Sqrt[N[(t$95$2 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := \sqrt{F \cdot 2}\\
t_4 := -t\_0\\
t_5 := \left(4 \cdot A\right) \cdot C\\
t_6 := {B\_m}^{2} - t\_5\\
t_7 := \frac{\sqrt{\left(2 \cdot \left(t\_6 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_6}\\
\mathbf{if}\;t\_7 \leq -\infty:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_1}\right) \cdot t\_3}{t\_4}\\
\mathbf{elif}\;t\_7 \leq -4 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_2\right)}}{\mathsf{fma}\left(-B\_m, B\_m, t\_5\right)}\\
\mathbf{elif}\;t\_7 \leq 0:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot t\_2} \cdot t\_3}{t\_4}\\
\mathbf{elif}\;t\_7 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2 \cdot F}\right) \cdot \sqrt{2 \cdot t\_1}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\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))) < -inf.0Initial program 3.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.8
Applied rewrites19.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites19.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites29.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites42.3%
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))) < -4.0000000000000004e-195Initial program 95.7%
Applied rewrites95.7%
if -4.0000000000000004e-195 < (/.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 3.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites50.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites40.6%
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 35.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6440.8
Applied rewrites40.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites40.8%
Applied rewrites41.3%
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 A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6419.0
Applied rewrites19.0%
Applied rewrites29.5%
Applied rewrites29.5%
Final simplification44.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 (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F)))
(t_1 (fma (* C A) -4.0 (* B_m B_m)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (- t_1)))
(if (<= t_5 -5e+172)
(/ (* (* (sqrt t_1) (sqrt t_3)) (sqrt (* F 2.0))) t_6)
(if (<= t_5 -1.5e-188)
t_0
(if (<= t_5 2e+159)
(/ (sqrt (* t_2 (* (* F 2.0) t_3))) t_6)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_2 F))) (sqrt (* 2.0 t_3))) t_1)
t_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 = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
double t_1 = fma((C * A), -4.0, (B_m * B_m));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = -t_1;
double tmp;
if (t_5 <= -5e+172) {
tmp = ((sqrt(t_1) * sqrt(t_3)) * sqrt((F * 2.0))) / t_6;
} else if (t_5 <= -1.5e-188) {
tmp = t_0;
} else if (t_5 <= 2e+159) {
tmp = sqrt((t_2 * ((F * 2.0) * t_3))) / t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_2 * F)) * sqrt((2.0 * t_3))) / t_1;
} else {
tmp = t_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(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)) t_1 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(-t_1) tmp = 0.0 if (t_5 <= -5e+172) tmp = Float64(Float64(Float64(sqrt(t_1) * sqrt(t_3)) * sqrt(Float64(F * 2.0))) / t_6); elseif (t_5 <= -1.5e-188) tmp = t_0; elseif (t_5 <= 2e+159) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(F * 2.0) * t_3))) / t_6); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_2 * F))) * sqrt(Float64(2.0 * t_3))) / t_1); else tmp = t_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[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = (-t$95$1)}, If[LessEqual[t$95$5, -5e+172], N[(N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -1.5e-188], t$95$0, If[LessEqual[t$95$5, 2e+159], N[(N[Sqrt[N[(t$95$2 * N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$2 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], t$95$0]]]]]]]]]]]
\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{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := -t\_1\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{+172}:\\
\;\;\;\;\frac{\left(\sqrt{t\_1} \cdot \sqrt{t\_3}\right) \cdot \sqrt{F \cdot 2}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq -1.5 \cdot 10^{-188}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_5 \leq 2 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(\left(F \cdot 2\right) \cdot t\_3\right)}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2 \cdot F}\right) \cdot \sqrt{2 \cdot t\_3}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\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))) < -5.0000000000000001e172Initial program 8.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites33.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites45.1%
if -5.0000000000000001e172 < (/.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))) < -1.50000000000000008e-188 or +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 22.9%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6421.4
Applied rewrites21.4%
Applied rewrites29.4%
Applied rewrites29.4%
if -1.50000000000000008e-188 < (/.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))) < 1.9999999999999999e159Initial program 15.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6452.9
Applied rewrites52.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites52.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
Applied rewrites50.8%
if 1.9999999999999999e159 < (/.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 20.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.5
Applied rewrites32.5%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites32.5%
Applied rewrites33.1%
Final simplification35.7%
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 (* C A) -4.0 (* B_m B_m)))
(t_1 (sqrt (* F 2.0)))
(t_2 (fma -4.0 (* C A) (* B_m B_m)))
(t_3 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (- t_0)))
(if (<= t_5 -5e+172)
(/ (* (* (sqrt t_0) (sqrt t_3)) t_1) t_6)
(if (<= t_5 -1.5e-188)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(if (<= t_5 2e+159)
(/ (sqrt (* t_2 (* (* F 2.0) t_3))) t_6)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_2 F))) (sqrt (* 2.0 t_3))) t_0)
(/ t_1 (- (sqrt 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((C * A), -4.0, (B_m * B_m));
double t_1 = sqrt((F * 2.0));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double t_3 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = -t_0;
double tmp;
if (t_5 <= -5e+172) {
tmp = ((sqrt(t_0) * sqrt(t_3)) * t_1) / t_6;
} else if (t_5 <= -1.5e-188) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else if (t_5 <= 2e+159) {
tmp = sqrt((t_2 * ((F * 2.0) * t_3))) / t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_2 * F)) * sqrt((2.0 * t_3))) / t_0;
} else {
tmp = t_1 / -sqrt(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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = sqrt(Float64(F * 2.0)) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_3 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(-t_0) tmp = 0.0 if (t_5 <= -5e+172) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_3)) * t_1) / t_6); elseif (t_5 <= -1.5e-188) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); elseif (t_5 <= 2e+159) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(F * 2.0) * t_3))) / t_6); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_2 * F))) * sqrt(Float64(2.0 * t_3))) / t_0); else tmp = Float64(t_1 / Float64(-sqrt(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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = (-t$95$0)}, If[LessEqual[t$95$5, -5e+172], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -1.5e-188], N[(N[Sqrt[N[(N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$5, 2e+159], N[(N[Sqrt[N[(t$95$2 * N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$2 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(t$95$1 / (-N[Sqrt[B$95$m], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{F \cdot 2}\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := -t\_0\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{+172}:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_3}\right) \cdot t\_1}{t\_6}\\
\mathbf{elif}\;t\_5 \leq -1.5 \cdot 10^{-188}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_5 \leq 2 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(\left(F \cdot 2\right) \cdot t\_3\right)}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2 \cdot F}\right) \cdot \sqrt{2 \cdot t\_3}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{-\sqrt{B\_m}}\\
\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))) < -5.0000000000000001e172Initial program 8.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites33.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites45.1%
if -5.0000000000000001e172 < (/.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))) < -1.50000000000000008e-188Initial program 96.7%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6428.9
Applied rewrites28.9%
Applied rewrites29.1%
if -1.50000000000000008e-188 < (/.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))) < 1.9999999999999999e159Initial program 15.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6452.9
Applied rewrites52.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites52.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
Applied rewrites50.8%
if 1.9999999999999999e159 < (/.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 20.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.5
Applied rewrites32.5%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites32.5%
Applied rewrites33.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%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.1
Applied rewrites18.1%
Applied rewrites18.2%
Applied rewrites26.4%
Final simplification34.3%
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 (* C A) -4.0 (* B_m B_m)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (sqrt (* F 2.0)))
(t_3 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_4 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4)))
(t_6 (- t_0)))
(if (<= t_5 -5e+172)
(/ (* (* (sqrt t_0) (sqrt t_3)) t_2) t_6)
(if (<= t_5 -1.5e-188)
(*
(- (sqrt (* (* 2.0 F) t_1)))
(/ (sqrt (+ (* B_m (+ (/ A B_m) 1.0)) C)) t_1))
(if (<= t_5 2e+159)
(/ (sqrt (* t_1 (* (* F 2.0) t_3))) t_6)
(if (<= t_5 INFINITY)
(/ (* (- (sqrt (* t_1 F))) (sqrt (* 2.0 t_3))) t_0)
(/ t_2 (- (sqrt 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((C * A), -4.0, (B_m * B_m));
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = sqrt((F * 2.0));
double t_3 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_4 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double t_6 = -t_0;
double tmp;
if (t_5 <= -5e+172) {
tmp = ((sqrt(t_0) * sqrt(t_3)) * t_2) / t_6;
} else if (t_5 <= -1.5e-188) {
tmp = -sqrt(((2.0 * F) * t_1)) * (sqrt(((B_m * ((A / B_m) + 1.0)) + C)) / t_1);
} else if (t_5 <= 2e+159) {
tmp = sqrt((t_1 * ((F * 2.0) * t_3))) / t_6;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (-sqrt((t_1 * F)) * sqrt((2.0 * t_3))) / t_0;
} else {
tmp = t_2 / -sqrt(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(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = sqrt(Float64(F * 2.0)) t_3 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_4 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) t_6 = Float64(-t_0) tmp = 0.0 if (t_5 <= -5e+172) tmp = Float64(Float64(Float64(sqrt(t_0) * sqrt(t_3)) * t_2) / t_6); elseif (t_5 <= -1.5e-188) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_1))) * Float64(sqrt(Float64(Float64(B_m * Float64(Float64(A / B_m) + 1.0)) + C)) / t_1)); elseif (t_5 <= 2e+159) tmp = Float64(sqrt(Float64(t_1 * Float64(Float64(F * 2.0) * t_3))) / t_6); elseif (t_5 <= Inf) tmp = Float64(Float64(Float64(-sqrt(Float64(t_1 * F))) * sqrt(Float64(2.0 * t_3))) / t_0); else tmp = Float64(t_2 / Float64(-sqrt(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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * 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$4)), $MachinePrecision]}, Block[{t$95$6 = (-t$95$0)}, If[LessEqual[t$95$5, -5e+172], N[(N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -1.5e-188], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(B$95$m * N[(N[(A / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 2e+159], N[(N[Sqrt[N[(t$95$1 * N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[((-N[Sqrt[N[(t$95$1 * F), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(2.0 * t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(t$95$2 / (-N[Sqrt[B$95$m], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \sqrt{F \cdot 2}\\
t_3 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_4 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
t_6 := -t\_0\\
\mathbf{if}\;t\_5 \leq -5 \cdot 10^{+172}:\\
\;\;\;\;\frac{\left(\sqrt{t\_0} \cdot \sqrt{t\_3}\right) \cdot t\_2}{t\_6}\\
\mathbf{elif}\;t\_5 \leq -1.5 \cdot 10^{-188}:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_1}\right) \cdot \frac{\sqrt{B\_m \cdot \left(\frac{A}{B\_m} + 1\right) + C}}{t\_1}\\
\mathbf{elif}\;t\_5 \leq 2 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(\left(F \cdot 2\right) \cdot t\_3\right)}}{t\_6}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_1 \cdot F}\right) \cdot \sqrt{2 \cdot t\_3}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_2}{-\sqrt{B\_m}}\\
\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))) < -5.0000000000000001e172Initial program 8.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites33.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites45.1%
if -5.0000000000000001e172 < (/.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))) < -1.50000000000000008e-188Initial program 96.7%
Applied rewrites97.1%
Taylor expanded in B around inf
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6431.8
Applied rewrites31.8%
if -1.50000000000000008e-188 < (/.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))) < 1.9999999999999999e159Initial program 15.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6452.9
Applied rewrites52.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites52.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
Applied rewrites50.8%
if 1.9999999999999999e159 < (/.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 20.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.5
Applied rewrites32.5%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites32.5%
Applied rewrites33.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%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6418.1
Applied rewrites18.1%
Applied rewrites18.2%
Applied rewrites26.4%
Final simplification34.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 (if (<= (pow B_m 2.0) 1e-87) (/ (sqrt (* -16.0 (* A (* (* C C) F)))) (- (fma (* C A) -4.0 (* B_m B_m)))) (* (/ (sqrt (* (+ C B_m) 2.0)) B_m) (- (sqrt F)))))
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-87) {
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
}
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-87) tmp = Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(F))); 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-87], N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $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^{-87}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e-87Initial program 16.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6425.9
Applied rewrites25.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites25.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6415.6
Applied rewrites15.6%
if 1.00000000000000002e-87 < (pow.f64 B #s(literal 2 binary64)) Initial program 21.9%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6426.8
Applied rewrites26.8%
Applied rewrites39.1%
Applied rewrites39.2%
Taylor expanded in C around 0
Applied rewrites35.4%
Final simplification25.3%
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 (* C A) -4.0 (* B_m B_m))))
(if (<= B_m 4.35e-41)
(/ (sqrt (* (* 2.0 C) (* (* t_0 F) 2.0))) (- t_0))
(* (/ (sqrt (* (+ C B_m) 2.0)) B_m) (- (sqrt F))))))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((C * A), -4.0, (B_m * B_m));
double tmp;
if (B_m <= 4.35e-41) {
tmp = sqrt(((2.0 * C) * ((t_0 * F) * 2.0))) / -t_0;
} else {
tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
}
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(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 4.35e-41) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(F))); 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 * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.35e-41], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $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(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 4.35 \cdot 10^{-41}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 4.34999999999999992e-41Initial program 19.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.8
Applied rewrites20.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites20.8%
Taylor expanded in A around -inf
lower-*.f6418.3
Applied rewrites18.3%
if 4.34999999999999992e-41 < B Initial program 18.2%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6445.4
Applied rewrites45.4%
Applied rewrites66.9%
Applied rewrites67.0%
Taylor expanded in C around 0
Applied rewrites62.2%
Final simplification30.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
(if (<= B_m 1.3e-42)
(/
(* (sqrt (* -8.0 (* A (* C C)))) (sqrt (* F 2.0)))
(- (fma (* C A) -4.0 (* B_m B_m))))
(* (/ (sqrt (* (+ C B_m) 2.0)) B_m) (- (sqrt F)))))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 (B_m <= 1.3e-42) {
tmp = (sqrt((-8.0 * (A * (C * C)))) * sqrt((F * 2.0))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
}
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 <= 1.3e-42) tmp = Float64(Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * C)))) * sqrt(Float64(F * 2.0))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(F))); 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[B$95$m, 1.3e-42], N[(N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $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 \leq 1.3 \cdot 10^{-42}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot C\right)\right)} \cdot \sqrt{F \cdot 2}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 1.3e-42Initial program 19.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.8
Applied rewrites20.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites20.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
Applied rewrites17.8%
Taylor expanded in A around -inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6413.9
Applied rewrites13.9%
if 1.3e-42 < B Initial program 18.2%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6445.4
Applied rewrites45.4%
Applied rewrites66.9%
Applied rewrites67.0%
Taylor expanded in C around 0
Applied rewrites62.2%
Final simplification27.3%
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 (<= C 1.8e+244) (/ (sqrt (* F 2.0)) (- (sqrt B_m))) (* (/ (* (sqrt C) 2.0) (- B_m)) (sqrt F))))
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 (C <= 1.8e+244) {
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
} else {
tmp = ((sqrt(C) * 2.0) / -B_m) * sqrt(F);
}
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 (c <= 1.8d+244) then
tmp = sqrt((f * 2.0d0)) / -sqrt(b_m)
else
tmp = ((sqrt(c) * 2.0d0) / -b_m) * sqrt(f)
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 (C <= 1.8e+244) {
tmp = Math.sqrt((F * 2.0)) / -Math.sqrt(B_m);
} else {
tmp = ((Math.sqrt(C) * 2.0) / -B_m) * Math.sqrt(F);
}
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 C <= 1.8e+244: tmp = math.sqrt((F * 2.0)) / -math.sqrt(B_m) else: tmp = ((math.sqrt(C) * 2.0) / -B_m) * math.sqrt(F) 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 (C <= 1.8e+244) tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m))); else tmp = Float64(Float64(Float64(sqrt(C) * 2.0) / Float64(-B_m)) * sqrt(F)); 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 (C <= 1.8e+244)
tmp = sqrt((F * 2.0)) / -sqrt(B_m);
else
tmp = ((sqrt(C) * 2.0) / -B_m) * sqrt(F);
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[C, 1.8e+244], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[(N[(N[Sqrt[C], $MachinePrecision] * 2.0), $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $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}\;C \leq 1.8 \cdot 10^{+244}:\\
\;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{C} \cdot 2}{-B\_m} \cdot \sqrt{F}\\
\end{array}
\end{array}
if C < 1.8e244Initial program 20.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6415.0
Applied rewrites15.0%
Applied rewrites15.1%
Applied rewrites19.7%
if 1.8e244 < C Initial program 1.0%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f647.8
Applied rewrites7.8%
Applied rewrites12.9%
Applied rewrites12.9%
Taylor expanded in B around 0
Applied rewrites12.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 (/ (sqrt (* F 2.0)) (- (sqrt 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 sqrt((F * 2.0)) / -sqrt(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 = sqrt((f * 2.0d0)) / -sqrt(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 Math.sqrt((F * 2.0)) / -Math.sqrt(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 math.sqrt((F * 2.0)) / -math.sqrt(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(sqrt(Float64(F * 2.0)) / Float64(-sqrt(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 = sqrt((F * 2.0)) / -sqrt(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[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}
\end{array}
Initial program 19.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
Applied rewrites14.3%
Applied rewrites18.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))))
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);
}
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 = sqrt((2.0d0 / b_m)) * -sqrt(f)
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 Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
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)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))) 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);
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[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)
\end{array}
Initial program 19.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
Applied rewrites14.3%
Applied rewrites18.5%
Final simplification18.5%
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 (/ (+ F 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 -sqrt(((F + 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 = -sqrt(((f + 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 -Math.sqrt(((F + 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 -math.sqrt(((F + 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(-sqrt(Float64(Float64(F + 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 = -sqrt(((F + 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[Sqrt[N[(N[(F + F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{F + F}{B\_m}}
\end{array}
Initial program 19.3%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.2
Applied rewrites14.2%
Applied rewrites14.3%
Applied rewrites14.3%
herbie shell --seed 2024354
(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))))