
(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 20 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 (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(t_1 (hypot (- A C) B_m))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (fma (* -4.0 A) C (* 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))
(t_7 (* (* 2.0 F) t_3)))
(if (<= t_6 -2e+255)
(*
(* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F))
(/ t_0 (- t_2)))
(if (<= t_6 -2e-216)
(/ (sqrt (fma (* t_3 2.0) (* F t_1) (* (+ C A) t_7))) t_5)
(if (<= t_6 0.0)
(/ (* (* t_0 (sqrt (* F 2.0))) (sqrt t_2)) t_5)
(if (<= t_6 INFINITY)
(/ (* (sqrt t_7) (sqrt (+ (+ t_1 A) C))) t_5)
(*
(* (/ (exp (* (log 2.0) 0.5)) B_m) (sqrt (+ (hypot C B_m) C)))
(- (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 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0)));
double t_1 = hypot((A - C), B_m);
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = fma((-4.0 * A), C, (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 t_7 = (2.0 * F) * t_3;
double tmp;
if (t_6 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * (t_0 / -t_2);
} else if (t_6 <= -2e-216) {
tmp = sqrt(fma((t_3 * 2.0), (F * t_1), ((C + A) * t_7))) / t_5;
} else if (t_6 <= 0.0) {
tmp = ((t_0 * sqrt((F * 2.0))) * sqrt(t_2)) / t_5;
} else if (t_6 <= ((double) INFINITY)) {
tmp = (sqrt(t_7) * sqrt(((t_1 + A) + C))) / t_5;
} else {
tmp = ((exp((log(2.0) * 0.5)) / B_m) * sqrt((hypot(C, B_m) + C))) * -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 = sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) t_1 = hypot(Float64(A - C), B_m) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = fma(Float64(-4.0 * A), C, 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) t_7 = Float64(Float64(2.0 * F) * t_3) tmp = 0.0 if (t_6 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * Float64(t_0 / Float64(-t_2))); elseif (t_6 <= -2e-216) tmp = Float64(sqrt(fma(Float64(t_3 * 2.0), Float64(F * t_1), Float64(Float64(C + A) * t_7))) / t_5); elseif (t_6 <= 0.0) tmp = Float64(Float64(Float64(t_0 * sqrt(Float64(F * 2.0))) * sqrt(t_2)) / t_5); elseif (t_6 <= Inf) tmp = Float64(Float64(sqrt(t_7) * sqrt(Float64(Float64(t_1 + A) + C))) / t_5); else tmp = Float64(Float64(Float64(exp(Float64(log(2.0) * 0.5)) / B_m) * sqrt(Float64(hypot(C, B_m) + C))) * 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[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(-4.0 * A), $MachinePrecision] * C + 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]}, Block[{t$95$7 = N[(N[(2.0 * F), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$6, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / (-t$95$2)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, -2e-216], N[(N[Sqrt[N[(N[(t$95$3 * 2.0), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision] + N[(N[(C + A), $MachinePrecision] * t$95$7), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, 0.0], N[(N[(N[(t$95$0 * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[(N[Sqrt[t$95$7], $MachinePrecision] * N[Sqrt[N[(N[(t$95$1 + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}\\
t_1 := \mathsf{hypot}\left(A - C, B\_m\right)\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := \mathsf{fma}\left(-4 \cdot A, C, 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}\\
t_7 := \left(2 \cdot F\right) \cdot t\_3\\
\mathbf{if}\;t\_6 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot \frac{t\_0}{-t\_2}\\
\mathbf{elif}\;t\_6 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_3 \cdot 2, F \cdot t\_1, \left(C + A\right) \cdot t\_7\right)}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq 0:\\
\;\;\;\;\frac{\left(t\_0 \cdot \sqrt{F \cdot 2}\right) \cdot \sqrt{t\_2}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_7} \cdot \sqrt{\left(t\_1 + A\right) + C}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{e^{\log 2 \cdot 0.5}}{B\_m} \cdot \sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}\right) \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites98.3%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 42.9%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites86.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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification47.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 (+ (hypot C B_m) C))
(t_1 (- (sqrt 2.0)))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3)))
(t_5 (- t_2))
(t_6 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_5)))
(if (<= t_4 -2e+154)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_6)
(if (<= t_4 -1e-99)
(*
(sqrt
(/
(* (+ (+ (hypot (- A C) B_m) C) A) F)
(fma (* C A) -4.0 (* B_m B_m))))
t_1)
(if (<= t_4 -2e-216)
(/ (sqrt (* (* t_0 F) 2.0)) (- B_m))
(if (<= t_4 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_2) t_6))
(if (<= t_4 INFINITY)
(* (sqrt (* (* F 2.0) t_2)) (/ (* (sqrt C) (sqrt 2.0)) t_5))
(* (* t_1 (/ (sqrt t_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 = hypot(C, B_m) + C;
double t_1 = -sqrt(2.0);
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double t_5 = -t_2;
double t_6 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_5;
double tmp;
if (t_4 <= -2e+154) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_6;
} else if (t_4 <= -1e-99) {
tmp = sqrt(((((hypot((A - C), B_m) + C) + A) * F) / fma((C * A), -4.0, (B_m * B_m)))) * t_1;
} else if (t_4 <= -2e-216) {
tmp = sqrt(((t_0 * F) * 2.0)) / -B_m;
} else if (t_4 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_2) * t_6);
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_2)) * ((sqrt(C) * sqrt(2.0)) / t_5);
} else {
tmp = (t_1 * (sqrt(t_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 = Float64(hypot(C, B_m) + C) t_1 = Float64(-sqrt(2.0)) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) t_5 = Float64(-t_2) t_6 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_5) tmp = 0.0 if (t_4 <= -2e+154) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_6); elseif (t_4 <= -1e-99) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / fma(Float64(C * A), -4.0, Float64(B_m * B_m)))) * t_1); elseif (t_4 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(t_0 * F) * 2.0)) / Float64(-B_m)); elseif (t_4 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_2) * t_6)); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_2)) * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_5)); else tmp = Float64(Float64(t_1 * Float64(sqrt(t_0) / 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[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * 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$3)), $MachinePrecision]}, Block[{t$95$5 = (-t$95$2)}, Block[{t$95$6 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+154], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$6), $MachinePrecision], If[LessEqual[t$95$4, -1e-99], N[(N[Sqrt[N[(N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$4, -2e-216], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$2], $MachinePrecision] * t$95$6), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(N[Sqrt[t$95$0], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(C, B\_m\right) + C\\
t_1 := -\sqrt{2}\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
t_5 := -t\_2\\
t_6 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_5}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+154}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_6\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-99}:\\
\;\;\;\;\sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}} \cdot t\_1\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_2} \cdot t\_6\right)\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_2} \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \frac{\sqrt{t\_0}}{B\_m}\right) \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))) < -2.00000000000000007e154Initial program 18.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6422.9
Applied rewrites22.9%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites29.1%
Applied rewrites29.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites41.7%
if -2.00000000000000007e154 < (/.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))) < -1e-99Initial program 97.5%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites97.2%
if -1e-99 < (/.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))) < -2.0000000000000001e-216Initial program 98.9%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6447.6
Applied rewrites47.6%
Applied rewrites47.6%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification39.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
(let* ((t_0 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0)))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (sqrt (* (* F 2.0) t_2)))
(t_4 (- t_2))
(t_5 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_4)))
(if (<= t_1 (- INFINITY))
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_5)
(if (<= t_1 -2e-65)
(* (- t_3) (/ (sqrt (* 2.0 C)) t_2))
(if (<= t_1 -2e-216)
(* t_3 (/ (sqrt (* B_m (+ 1.0 (/ (+ A C) B_m)))) t_4))
(if (<= t_1 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_2) t_5))
(if (<= t_1 INFINITY)
(* t_3 (/ (* (sqrt C) (sqrt 2.0)) t_4))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = sqrt(((F * 2.0) * t_2));
double t_4 = -t_2;
double t_5 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_4;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_5;
} else if (t_1 <= -2e-65) {
tmp = -t_3 * (sqrt((2.0 * C)) / t_2);
} else if (t_1 <= -2e-216) {
tmp = t_3 * (sqrt((B_m * (1.0 + ((A + C) / B_m)))) / t_4);
} else if (t_1 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_2) * t_5);
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_3 * ((sqrt(C) * sqrt(2.0)) / t_4);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = sqrt(Float64(Float64(F * 2.0) * t_2)) t_4 = Float64(-t_2) t_5 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_4) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_5); elseif (t_1 <= -2e-65) tmp = Float64(Float64(-t_3) * Float64(sqrt(Float64(2.0 * C)) / t_2)); elseif (t_1 <= -2e-216) tmp = Float64(t_3 * Float64(sqrt(Float64(B_m * Float64(1.0 + Float64(Float64(A + C) / B_m)))) / t_4)); elseif (t_1 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_2) * t_5)); elseif (t_1 <= Inf) tmp = Float64(t_3 * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_4)); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = (-t$95$2)}, Block[{t$95$5 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$1, -2e-65], N[((-t$95$3) * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -2e-216], N[(t$95$3 * N[(N[Sqrt[N[(B$95$m * N[(1.0 + N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$2], $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(t$95$3 * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := \sqrt{\left(F \cdot 2\right) \cdot t\_2}\\
t_4 := -t\_2\\
t_5 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_4}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_5\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{-65}:\\
\;\;\;\;\left(-t\_3\right) \cdot \frac{\sqrt{2 \cdot C}}{t\_2}\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;t\_3 \cdot \frac{\sqrt{B\_m \cdot \left(1 + \frac{A + C}{B\_m}\right)}}{t\_4}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_2} \cdot t\_5\right)\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_3 \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \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.4%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.0
Applied rewrites19.0%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites26.3%
Applied rewrites26.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites41.2%
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))) < -1.99999999999999985e-65Initial program 97.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6422.7
Applied rewrites22.7%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites22.7%
Applied rewrites22.8%
Taylor expanded in A around inf
Applied rewrites39.2%
if -1.99999999999999985e-65 < (/.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))) < -2.0000000000000001e-216Initial program 99.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f643.0
Applied rewrites3.0%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites3.0%
Applied rewrites3.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
div-add-revN/A
lower-/.f64N/A
lower-+.f6452.5
Applied rewrites52.5%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Taylor expanded in C around 0
Applied rewrites27.6%
Final simplification32.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m)))
(t_1 (sqrt (* (* F 2.0) t_0)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (- t_0))
(t_5
(*
(sqrt (* F 2.0))
(*
(sqrt t_0)
(/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_4)))))
(if (<= t_3 -1e+195)
t_5
(if (<= t_3 -2e-65)
(* (- t_1) (/ (sqrt (* 2.0 C)) t_0))
(if (<= t_3 -2e-216)
(* t_1 (/ (sqrt (* B_m (+ 1.0 (/ (+ A C) B_m)))) t_4))
(if (<= t_3 0.0)
t_5
(if (<= t_3 INFINITY)
(* t_1 (/ (* (sqrt C) (sqrt 2.0)) t_4))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 * -4.0), A, (B_m * B_m));
double t_1 = sqrt(((F * 2.0) * t_0));
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = -t_0;
double t_5 = sqrt((F * 2.0)) * (sqrt(t_0) * (sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_4));
double tmp;
if (t_3 <= -1e+195) {
tmp = t_5;
} else if (t_3 <= -2e-65) {
tmp = -t_1 * (sqrt((2.0 * C)) / t_0);
} else if (t_3 <= -2e-216) {
tmp = t_1 * (sqrt((B_m * (1.0 + ((A + C) / B_m)))) / t_4);
} else if (t_3 <= 0.0) {
tmp = t_5;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_1 * ((sqrt(C) * sqrt(2.0)) / t_4);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 * -4.0), A, Float64(B_m * B_m)) t_1 = sqrt(Float64(Float64(F * 2.0) * t_0)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = Float64(-t_0) t_5 = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_0) * Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_4))) tmp = 0.0 if (t_3 <= -1e+195) tmp = t_5; elseif (t_3 <= -2e-65) tmp = Float64(Float64(-t_1) * Float64(sqrt(Float64(2.0 * C)) / t_0)); elseif (t_3 <= -2e-216) tmp = Float64(t_1 * Float64(sqrt(Float64(B_m * Float64(1.0 + Float64(Float64(A + C) / B_m)))) / t_4)); elseif (t_3 <= 0.0) tmp = t_5; elseif (t_3 <= Inf) tmp = Float64(t_1 * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_4)); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, Block[{t$95$5 = N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+195], t$95$5, If[LessEqual[t$95$3, -2e-65], N[((-t$95$1) * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -2e-216], N[(t$95$1 * N[(N[Sqrt[N[(B$95$m * N[(1.0 + N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], t$95$5, If[LessEqual[t$95$3, Infinity], N[(t$95$1 * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \sqrt{\left(F \cdot 2\right) \cdot t\_0}\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := -t\_0\\
t_5 := \sqrt{F \cdot 2} \cdot \left(\sqrt{t\_0} \cdot \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_4}\right)\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+195}:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-65}:\\
\;\;\;\;\left(-t\_1\right) \cdot \frac{\sqrt{2 \cdot C}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{B\_m \cdot \left(1 + \frac{A + C}{B\_m}\right)}}{t\_4}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;t\_5\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \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))) < -9.99999999999999977e194 or -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 5.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6425.1
Applied rewrites25.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites26.2%
Applied rewrites35.9%
if -9.99999999999999977e194 < (/.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.99999999999999985e-65Initial program 97.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.7
Applied rewrites20.7%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites20.8%
Applied rewrites20.9%
Taylor expanded in A around inf
Applied rewrites38.5%
if -1.99999999999999985e-65 < (/.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))) < -2.0000000000000001e-216Initial program 99.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f643.0
Applied rewrites3.0%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites3.0%
Applied rewrites3.0%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
div-add-revN/A
lower-/.f64N/A
lower-+.f6452.5
Applied rewrites52.5%
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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Taylor expanded in C around 0
Applied rewrites27.6%
Final simplification32.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(t_1 (hypot (- A C) B_m))
(t_2 (fma (* C -4.0) A (* B_m B_m)))
(t_3 (fma (* -4.0 A) C (* 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))
(t_7 (* (* 2.0 F) t_3)))
(if (<= t_6 -2e+255)
(*
(* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F))
(/ t_0 (- t_2)))
(if (<= t_6 -2e-216)
(/ (sqrt (fma (* t_3 2.0) (* F t_1) (* (+ C A) t_7))) t_5)
(if (<= t_6 0.0)
(/ (* (* t_0 (sqrt (* F 2.0))) (sqrt t_2)) t_5)
(if (<= t_6 INFINITY)
(/ (* (sqrt t_7) (sqrt (+ (+ t_1 A) C))) t_5)
(*
(* (- (sqrt 2.0)) (/ (sqrt (+ (hypot C B_m) C)) 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 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0)));
double t_1 = hypot((A - C), B_m);
double t_2 = fma((C * -4.0), A, (B_m * B_m));
double t_3 = fma((-4.0 * A), C, (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 t_7 = (2.0 * F) * t_3;
double tmp;
if (t_6 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * (t_0 / -t_2);
} else if (t_6 <= -2e-216) {
tmp = sqrt(fma((t_3 * 2.0), (F * t_1), ((C + A) * t_7))) / t_5;
} else if (t_6 <= 0.0) {
tmp = ((t_0 * sqrt((F * 2.0))) * sqrt(t_2)) / t_5;
} else if (t_6 <= ((double) INFINITY)) {
tmp = (sqrt(t_7) * sqrt(((t_1 + A) + C))) / t_5;
} else {
tmp = (-sqrt(2.0) * (sqrt((hypot(C, B_m) + C)) / 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 = sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) t_1 = hypot(Float64(A - C), B_m) t_2 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_3 = fma(Float64(-4.0 * A), C, 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) t_7 = Float64(Float64(2.0 * F) * t_3) tmp = 0.0 if (t_6 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * Float64(t_0 / Float64(-t_2))); elseif (t_6 <= -2e-216) tmp = Float64(sqrt(fma(Float64(t_3 * 2.0), Float64(F * t_1), Float64(Float64(C + A) * t_7))) / t_5); elseif (t_6 <= 0.0) tmp = Float64(Float64(Float64(t_0 * sqrt(Float64(F * 2.0))) * sqrt(t_2)) / t_5); elseif (t_6 <= Inf) tmp = Float64(Float64(sqrt(t_7) * sqrt(Float64(Float64(t_1 + A) + C))) / t_5); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$2 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(-4.0 * A), $MachinePrecision] * C + 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]}, Block[{t$95$7 = N[(N[(2.0 * F), $MachinePrecision] * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$6, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / (-t$95$2)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, -2e-216], N[(N[Sqrt[N[(N[(t$95$3 * 2.0), $MachinePrecision] * N[(F * t$95$1), $MachinePrecision] + N[(N[(C + A), $MachinePrecision] * t$95$7), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, 0.0], N[(N[(N[(t$95$0 * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$2], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[(N[Sqrt[t$95$7], $MachinePrecision] * N[Sqrt[N[(N[(t$95$1 + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}\\
t_1 := \mathsf{hypot}\left(A - C, B\_m\right)\\
t_2 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_3 := \mathsf{fma}\left(-4 \cdot A, C, 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}\\
t_7 := \left(2 \cdot F\right) \cdot t\_3\\
\mathbf{if}\;t\_6 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot \frac{t\_0}{-t\_2}\\
\mathbf{elif}\;t\_6 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_3 \cdot 2, F \cdot t\_1, \left(C + A\right) \cdot t\_7\right)}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq 0:\\
\;\;\;\;\frac{\left(t\_0 \cdot \sqrt{F \cdot 2}\right) \cdot \sqrt{t\_2}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_7} \cdot \sqrt{\left(t\_1 + A\right) + C}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{B\_m}\right) \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))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites98.3%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 42.9%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites86.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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification47.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 (+ (+ (hypot (- A C) B_m) A) C))
(t_1 (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(t_2 (fma (* -4.0 A) C (* B_m B_m)))
(t_3 (* (* 2.0 F) t_2))
(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))
(t_7 (fma (* C -4.0) A (* B_m B_m))))
(if (<= t_6 -2e+255)
(*
(* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F))
(/ t_1 (- t_7)))
(if (<= t_6 -2e-216)
(/ (sqrt (* t_0 t_3)) (- t_2))
(if (<= t_6 0.0)
(/ (* (* t_1 (sqrt (* F 2.0))) (sqrt t_7)) t_5)
(if (<= t_6 INFINITY)
(/ (* (sqrt t_3) (sqrt t_0)) t_5)
(*
(* (- (sqrt 2.0)) (/ (sqrt (+ (hypot C B_m) C)) 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 = (hypot((A - C), B_m) + A) + C;
double t_1 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0)));
double t_2 = fma((-4.0 * A), C, (B_m * B_m));
double t_3 = (2.0 * F) * t_2;
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 t_7 = fma((C * -4.0), A, (B_m * B_m));
double tmp;
if (t_6 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * (t_1 / -t_7);
} else if (t_6 <= -2e-216) {
tmp = sqrt((t_0 * t_3)) / -t_2;
} else if (t_6 <= 0.0) {
tmp = ((t_1 * sqrt((F * 2.0))) * sqrt(t_7)) / t_5;
} else if (t_6 <= ((double) INFINITY)) {
tmp = (sqrt(t_3) * sqrt(t_0)) / t_5;
} else {
tmp = (-sqrt(2.0) * (sqrt((hypot(C, B_m) + C)) / 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 = Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) t_1 = sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) t_2 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_3 = Float64(Float64(2.0 * F) * t_2) 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) t_7 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if (t_6 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * Float64(t_1 / Float64(-t_7))); elseif (t_6 <= -2e-216) tmp = Float64(sqrt(Float64(t_0 * t_3)) / Float64(-t_2)); elseif (t_6 <= 0.0) tmp = Float64(Float64(Float64(t_1 * sqrt(Float64(F * 2.0))) * sqrt(t_7)) / t_5); elseif (t_6 <= Inf) tmp = Float64(Float64(sqrt(t_3) * sqrt(t_0)) / t_5); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $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]}, Block[{t$95$7 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$6, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(t$95$1 / (-t$95$7)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, -2e-216], N[(N[Sqrt[N[(t$95$0 * t$95$3), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision], If[LessEqual[t$95$6, 0.0], N[(N[(N[(t$95$1 * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$7], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$6, Infinity], N[(N[(N[Sqrt[t$95$3], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\
t_1 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}\\
t_2 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_3 := \left(2 \cdot F\right) \cdot t\_2\\
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}\\
t_7 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_6 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot \frac{t\_1}{-t\_7}\\
\mathbf{elif}\;t\_6 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot t\_3}}{-t\_2}\\
\mathbf{elif}\;t\_6 \leq 0:\\
\;\;\;\;\frac{\left(t\_1 \cdot \sqrt{F \cdot 2}\right) \cdot \sqrt{t\_7}}{t\_5}\\
\mathbf{elif}\;t\_6 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_3} \cdot \sqrt{t\_0}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{B\_m}\right) \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))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites98.2%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 42.9%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites86.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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification47.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 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))))
(t_1 (fma (* -4.0 A) C (* B_m B_m)))
(t_2 (* (* 2.0 F) t_1))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4 (- t_3))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
t_4))
(t_6 (fma (* C -4.0) A (* B_m B_m))))
(if (<= t_5 -2e+255)
(*
(* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F))
(/ t_0 (- t_6)))
(if (<= t_5 -2e-216)
(/ (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) t_2)) (- t_1))
(if (<= t_5 0.0)
(/ (* (* t_0 (sqrt (* F 2.0))) (sqrt t_6)) t_4)
(if (<= t_5 INFINITY)
(/ (* (sqrt t_2) (sqrt (* 2.0 C))) t_4)
(*
(* (- (sqrt 2.0)) (/ (sqrt (+ (hypot C B_m) C)) 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 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0)));
double t_1 = fma((-4.0 * A), C, (B_m * B_m));
double t_2 = (2.0 * F) * t_1;
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = -t_3;
double t_5 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_4;
double t_6 = fma((C * -4.0), A, (B_m * B_m));
double tmp;
if (t_5 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * (t_0 / -t_6);
} else if (t_5 <= -2e-216) {
tmp = sqrt((((hypot((A - C), B_m) + A) + C) * t_2)) / -t_1;
} else if (t_5 <= 0.0) {
tmp = ((t_0 * sqrt((F * 2.0))) * sqrt(t_6)) / t_4;
} else if (t_5 <= ((double) INFINITY)) {
tmp = (sqrt(t_2) * sqrt((2.0 * C))) / t_4;
} else {
tmp = (-sqrt(2.0) * (sqrt((hypot(C, B_m) + C)) / 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 = sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) t_1 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_2 = Float64(Float64(2.0 * F) * t_1) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(-t_3) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_4) t_6 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if (t_5 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * Float64(t_0 / Float64(-t_6))); elseif (t_5 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * t_2)) / Float64(-t_1)); elseif (t_5 <= 0.0) tmp = Float64(Float64(Float64(t_0 * sqrt(Float64(F * 2.0))) * sqrt(t_6)) / t_4); elseif (t_5 <= Inf) tmp = Float64(Float64(sqrt(t_2) * sqrt(Float64(2.0 * C))) / t_4); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * 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 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / (-t$95$6)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -2e-216], N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[(t$95$0 * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[t$95$6], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}\\
t_1 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_2 := \left(2 \cdot F\right) \cdot t\_1\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := -t\_3\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_4}\\
t_6 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_5 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot \frac{t\_0}{-t\_6}\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot t\_2}}{-t\_1}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\left(t\_0 \cdot \sqrt{F \cdot 2}\right) \cdot \sqrt{t\_6}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2} \cdot \sqrt{2 \cdot C}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{B\_m}\right) \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))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites98.2%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Taylor expanded in A around inf
Applied rewrites30.7%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification42.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (* (* 2.0 F) t_0))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3 (- t_2))
(t_4 (fma (* C -4.0) A (* B_m B_m)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
t_3))
(t_6 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) (- t_4))))
(if (<= t_5 -2e+255)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_6)
(if (<= t_5 -2e-216)
(/ (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) t_1)) (- t_0))
(if (<= t_5 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_4) t_6))
(if (<= t_5 INFINITY)
(/ (* (sqrt t_1) (sqrt (* 2.0 C))) t_3)
(*
(* (- (sqrt 2.0)) (/ (sqrt (+ (hypot C B_m) C)) 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 * A), C, (B_m * B_m));
double t_1 = (2.0 * F) * t_0;
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = -t_2;
double t_4 = fma((C * -4.0), A, (B_m * B_m));
double t_5 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_3;
double t_6 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / -t_4;
double tmp;
if (t_5 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_6;
} else if (t_5 <= -2e-216) {
tmp = sqrt((((hypot((A - C), B_m) + A) + C) * t_1)) / -t_0;
} else if (t_5 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_4) * t_6);
} else if (t_5 <= ((double) INFINITY)) {
tmp = (sqrt(t_1) * sqrt((2.0 * C))) / t_3;
} else {
tmp = (-sqrt(2.0) * (sqrt((hypot(C, B_m) + C)) / 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(-4.0 * A), C, Float64(B_m * B_m)) t_1 = Float64(Float64(2.0 * F) * t_0) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(-t_2) t_4 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_3) t_6 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_6); elseif (t_5 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * t_1)) / Float64(-t_0)); elseif (t_5 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_4) * t_6)); elseif (t_5 <= Inf) tmp = Float64(Float64(sqrt(t_1) * sqrt(Float64(2.0 * C))) / t_3); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$2)}, Block[{t$95$4 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * 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$3), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]}, If[LessEqual[t$95$5, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$6), $MachinePrecision], If[LessEqual[t$95$5, -2e-216], N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$4], $MachinePrecision] * t$95$6), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \left(2 \cdot F\right) \cdot t\_0\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := -t\_2\\
t_4 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_3}\\
t_6 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_6\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot t\_1}}{-t\_0}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_4} \cdot t\_6\right)\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_1} \cdot \sqrt{2 \cdot C}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{B\_m}\right) \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))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites98.2%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Taylor expanded in A around inf
Applied rewrites30.7%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification42.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 A) C (* B_m B_m)))
(t_1 (fma (* C -4.0) A (* B_m B_m)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (- t_1))
(t_5 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_4)))
(if (<= t_3 -2e+255)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_5)
(if (<= t_3 -2e-216)
(/ (sqrt (* (+ (+ (hypot (- A C) B_m) A) C) (* (* 2.0 F) t_0))) (- t_0))
(if (<= t_3 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_1) t_5))
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_1)) (/ (* (sqrt C) (sqrt 2.0)) t_4))
(*
(* (- (sqrt 2.0)) (/ (sqrt (+ (hypot C B_m) C)) 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 * A), C, (B_m * B_m));
double t_1 = fma((C * -4.0), A, (B_m * B_m));
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = -t_1;
double t_5 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_4;
double tmp;
if (t_3 <= -2e+255) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_5;
} else if (t_3 <= -2e-216) {
tmp = sqrt((((hypot((A - C), B_m) + A) + C) * ((2.0 * F) * t_0))) / -t_0;
} else if (t_3 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_1) * t_5);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_1)) * ((sqrt(C) * sqrt(2.0)) / t_4);
} else {
tmp = (-sqrt(2.0) * (sqrt((hypot(C, B_m) + C)) / 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(-4.0 * A), C, Float64(B_m * B_m)) t_1 = fma(Float64(C * -4.0), A, Float64(B_m * B_m)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = Float64(-t_1) t_5 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_4) tmp = 0.0 if (t_3 <= -2e+255) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_5); elseif (t_3 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C) * Float64(Float64(2.0 * F) * t_0))) / Float64(-t_0)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_1) * t_5)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_1)) * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_4)); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(Float64(hypot(C, B_m) + C)) / 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[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = (-t$95$1)}, Block[{t$95$5 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+255], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$3, -2e-216], N[(N[Sqrt[N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$1], $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := -t\_1\\
t_5 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_4}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+255}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_5\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_1} \cdot t\_5\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_1} \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{B\_m}\right) \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))) < -1.99999999999999998e255Initial program 5.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6418.5
Applied rewrites18.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites25.7%
Applied rewrites25.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites40.2%
if -1.99999999999999998e255 < (/.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))) < -2.0000000000000001e-216Initial program 98.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites98.2%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification42.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m)))
(t_1 (+ (hypot C B_m) C))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (- t_0))
(t_5 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_4)))
(if (<= t_3 -1e+139)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_5)
(if (<= t_3 -2e-216)
(/ (sqrt (* (* t_1 F) 2.0)) (- B_m))
(if (<= t_3 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_0) t_5))
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (* (sqrt C) (sqrt 2.0)) t_4))
(* (* (- (sqrt 2.0)) (/ (sqrt t_1) 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 * -4.0), A, (B_m * B_m));
double t_1 = hypot(C, B_m) + C;
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = -t_0;
double t_5 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_4;
double tmp;
if (t_3 <= -1e+139) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_5;
} else if (t_3 <= -2e-216) {
tmp = sqrt(((t_1 * F) * 2.0)) / -B_m;
} else if (t_3 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_0) * t_5);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * ((sqrt(C) * sqrt(2.0)) / t_4);
} else {
tmp = (-sqrt(2.0) * (sqrt(t_1) / 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 * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(hypot(C, B_m) + C) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = Float64(-t_0) t_5 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_4) tmp = 0.0 if (t_3 <= -1e+139) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_5); elseif (t_3 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(t_1 * F) * 2.0)) / Float64(-B_m)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_0) * t_5)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_4)); else tmp = Float64(Float64(Float64(-sqrt(2.0)) * Float64(sqrt(t_1) / 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, Block[{t$95$5 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+139], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$3, -2e-216], N[(N[Sqrt[N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) * N[(N[Sqrt[t$95$1], $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{hypot}\left(C, B\_m\right) + C\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := -t\_0\\
t_5 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_4}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+139}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_5\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(t\_1 \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_0} \cdot t\_5\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(-\sqrt{2}\right) \cdot \frac{\sqrt{t\_1}}{B\_m}\right) \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))) < -1.00000000000000003e139Initial program 19.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6424.5
Applied rewrites24.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.5%
Applied rewrites30.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites42.9%
if -1.00000000000000003e139 < (/.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))) < -2.0000000000000001e-216Initial program 97.9%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6434.6
Applied rewrites34.6%
Applied rewrites34.6%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification33.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 -4.0) A (* B_m B_m)))
(t_1 (+ (hypot C B_m) C))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (- t_0))
(t_5 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_4)))
(if (<= t_3 -1e+139)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_5)
(if (<= t_3 -2e-216)
(/ (sqrt (* (* t_1 F) 2.0)) (- B_m))
(if (<= t_3 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_0) t_5))
(if (<= t_3 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (* (sqrt C) (sqrt 2.0)) t_4))
(* (/ (sqrt (* 2.0 t_1)) (- 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 * -4.0), A, (B_m * B_m));
double t_1 = hypot(C, B_m) + C;
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = -t_0;
double t_5 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_4;
double tmp;
if (t_3 <= -1e+139) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_5;
} else if (t_3 <= -2e-216) {
tmp = sqrt(((t_1 * F) * 2.0)) / -B_m;
} else if (t_3 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_0) * t_5);
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * ((sqrt(C) * sqrt(2.0)) / t_4);
} else {
tmp = (sqrt((2.0 * t_1)) / -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 * -4.0), A, Float64(B_m * B_m)) t_1 = Float64(hypot(C, B_m) + C) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = Float64(-t_0) t_5 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_4) tmp = 0.0 if (t_3 <= -1e+139) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_5); elseif (t_3 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(t_1 * F) * 2.0)) / Float64(-B_m)); elseif (t_3 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_0) * t_5)); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_4)); else tmp = Float64(Float64(sqrt(Float64(2.0 * t_1)) / 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = (-t$95$0)}, Block[{t$95$5 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+139], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$5), $MachinePrecision], If[LessEqual[t$95$3, -2e-216], N[(N[Sqrt[N[(N[(t$95$1 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(2.0 * t$95$1), $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 -4, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{hypot}\left(C, B\_m\right) + C\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := -t\_0\\
t_5 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_4}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+139}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_5\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(t\_1 \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_0} \cdot t\_5\right)\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot t\_1}}{-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))) < -1.00000000000000003e139Initial program 19.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6424.5
Applied rewrites24.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.5%
Applied rewrites30.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites42.9%
if -1.00000000000000003e139 < (/.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))) < -2.0000000000000001e-216Initial program 97.9%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6434.6
Applied rewrites34.6%
Applied rewrites34.6%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Applied rewrites30.1%
Final simplification33.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 -4.0) A (* B_m B_m)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1)))
(t_3 (- t_0))
(t_4 (/ (sqrt (fma -0.5 (/ (* B_m B_m) A) (* C 2.0))) t_3)))
(if (<= t_2 -1e+139)
(* (* (sqrt (* (fma (* -4.0 C) A (* B_m B_m)) 2.0)) (sqrt F)) t_4)
(if (<= t_2 -2e-216)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(if (<= t_2 0.0)
(* (sqrt (* F 2.0)) (* (sqrt t_0) t_4))
(if (<= t_2 INFINITY)
(* (sqrt (* (* F 2.0) t_0)) (/ (* (sqrt C) (sqrt 2.0)) t_3))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 * -4.0), A, (B_m * B_m));
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double t_3 = -t_0;
double t_4 = sqrt(fma(-0.5, ((B_m * B_m) / A), (C * 2.0))) / t_3;
double tmp;
if (t_2 <= -1e+139) {
tmp = (sqrt((fma((-4.0 * C), A, (B_m * B_m)) * 2.0)) * sqrt(F)) * t_4;
} else if (t_2 <= -2e-216) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else if (t_2 <= 0.0) {
tmp = sqrt((F * 2.0)) * (sqrt(t_0) * t_4);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * 2.0) * t_0)) * ((sqrt(C) * sqrt(2.0)) / t_3);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 * -4.0), A, Float64(B_m * B_m)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) t_3 = Float64(-t_0) t_4 = Float64(sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0))) / t_3) tmp = 0.0 if (t_2 <= -1e+139) tmp = Float64(Float64(sqrt(Float64(fma(Float64(-4.0 * C), A, Float64(B_m * B_m)) * 2.0)) * sqrt(F)) * t_4); elseif (t_2 <= -2e-216) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); elseif (t_2 <= 0.0) tmp = Float64(sqrt(Float64(F * 2.0)) * Float64(sqrt(t_0) * t_4)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) * Float64(Float64(sqrt(C) * sqrt(2.0)) / t_3)); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, Block[{t$95$4 = N[(N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+139], N[(N[(N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * t$95$4), $MachinePrecision], If[LessEqual[t$95$2, -2e-216], 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$2, 0.0], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
t_3 := -t\_0\\
t_4 := \frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_3}\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+139}:\\
\;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right) \cdot 2} \cdot \sqrt{F}\right) \cdot t\_4\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-216}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{F \cdot 2} \cdot \left(\sqrt{t\_0} \cdot t\_4\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(F \cdot 2\right) \cdot t\_0} \cdot \frac{\sqrt{C} \cdot \sqrt{2}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \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))) < -1.00000000000000003e139Initial program 19.8%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6424.5
Applied rewrites24.5%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.5%
Applied rewrites30.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
metadata-evalN/A
distribute-lft-neg-inN/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
lift-*.f64N/A
lower--.f64N/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
Applied rewrites42.9%
if -1.00000000000000003e139 < (/.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))) < -2.0000000000000001e-216Initial program 97.9%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6434.6
Applied rewrites34.6%
Applied rewrites34.6%
if -2.0000000000000001e-216 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -0.0Initial program 3.6%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6430.2
Applied rewrites30.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites24.8%
Applied rewrites29.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 42.9%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.1
Applied rewrites26.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites30.7%
Applied rewrites30.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6430.9
Applied rewrites30.9%
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
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6421.5
Applied rewrites21.5%
Applied rewrites30.0%
Taylor expanded in C around 0
Applied rewrites27.6%
Final simplification31.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m)))
(t_1 (fma (* -4.0 A) C (* B_m B_m)))
(t_2 (/ (* B_m B_m) A)))
(if (<= B_m 9e-225)
(/ (sqrt (* (fma t_2 -0.5 (* C 2.0)) (* (* 2.0 F) t_1))) (- t_1))
(if (<= B_m 23500000000000.0)
(* (sqrt (* (+ F F) t_0)) (/ (sqrt (fma -0.5 t_2 (* C 2.0))) (- t_0)))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 * -4.0), A, (B_m * B_m));
double t_1 = fma((-4.0 * A), C, (B_m * B_m));
double t_2 = (B_m * B_m) / A;
double tmp;
if (B_m <= 9e-225) {
tmp = sqrt((fma(t_2, -0.5, (C * 2.0)) * ((2.0 * F) * t_1))) / -t_1;
} else if (B_m <= 23500000000000.0) {
tmp = sqrt(((F + F) * t_0)) * (sqrt(fma(-0.5, t_2, (C * 2.0))) / -t_0);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 * -4.0), A, Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) t_2 = Float64(Float64(B_m * B_m) / A) tmp = 0.0 if (B_m <= 9e-225) tmp = Float64(sqrt(Float64(fma(t_2, -0.5, Float64(C * 2.0)) * Float64(Float64(2.0 * F) * t_1))) / Float64(-t_1)); elseif (B_m <= 23500000000000.0) tmp = Float64(sqrt(Float64(Float64(F + F) * t_0)) * Float64(sqrt(fma(-0.5, t_2, Float64(C * 2.0))) / Float64(-t_0))); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, If[LessEqual[B$95$m, 9e-225], N[(N[Sqrt[N[(N[(t$95$2 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[B$95$m, 23500000000000.0], N[(N[Sqrt[N[(N[(F + F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(-0.5 * t$95$2 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
t_2 := \frac{B\_m \cdot B\_m}{A}\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-225}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_2, -0.5, C \cdot 2\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_1\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 23500000000000:\\
\;\;\;\;\sqrt{\left(F + F\right) \cdot t\_0} \cdot \frac{\sqrt{\mathsf{fma}\left(-0.5, t\_2, C \cdot 2\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \cdot \sqrt{F}\\
\end{array}
\end{array}
if B < 8.9999999999999999e-225Initial program 20.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6416.2
Applied rewrites16.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites16.2%
if 8.9999999999999999e-225 < B < 2.35e13Initial program 32.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.2
Applied rewrites20.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites19.8%
Applied rewrites19.9%
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
lower-+.f6419.9
Applied rewrites19.9%
if 2.35e13 < B Initial program 14.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.6
Applied rewrites53.6%
Applied rewrites72.6%
Taylor expanded in C around 0
Applied rewrites69.7%
Final simplification28.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 -4.0) A (* B_m B_m)))
(t_1 (fma (* -4.0 A) C (* B_m B_m))))
(if (<= B_m 9e-225)
(/
(sqrt (* (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)) (* (* 2.0 F) t_1)))
(- t_1))
(if (<= B_m 21500000000000.0)
(* (- (sqrt (* (* F 2.0) t_0))) (/ (sqrt (* 2.0 C)) t_0))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 * -4.0), A, (B_m * B_m));
double t_1 = fma((-4.0 * A), C, (B_m * B_m));
double tmp;
if (B_m <= 9e-225) {
tmp = sqrt((fma(((B_m * B_m) / A), -0.5, (C * 2.0)) * ((2.0 * F) * t_1))) / -t_1;
} else if (B_m <= 21500000000000.0) {
tmp = -sqrt(((F * 2.0) * t_0)) * (sqrt((2.0 * C)) / t_0);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 * -4.0), A, Float64(B_m * B_m)) t_1 = fma(Float64(-4.0 * A), C, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 9e-225) tmp = Float64(sqrt(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) * Float64(Float64(2.0 * F) * t_1))) / Float64(-t_1)); elseif (B_m <= 21500000000000.0) tmp = Float64(Float64(-sqrt(Float64(Float64(F * 2.0) * t_0))) * Float64(sqrt(Float64(2.0 * C)) / t_0)); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 9e-225], N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[B$95$m, 21500000000000.0], N[((-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 9 \cdot 10^{-225}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_1\right)}}{-t\_1}\\
\mathbf{elif}\;B\_m \leq 21500000000000:\\
\;\;\;\;\left(-\sqrt{\left(F \cdot 2\right) \cdot t\_0}\right) \cdot \frac{\sqrt{2 \cdot C}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \cdot \sqrt{F}\\
\end{array}
\end{array}
if B < 8.9999999999999999e-225Initial program 20.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6416.2
Applied rewrites16.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites16.2%
if 8.9999999999999999e-225 < B < 2.15e13Initial program 32.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6420.2
Applied rewrites20.2%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites19.8%
Applied rewrites19.9%
Taylor expanded in A around inf
Applied rewrites23.7%
if 2.15e13 < B Initial program 14.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.6
Applied rewrites53.6%
Applied rewrites72.6%
Taylor expanded in C around 0
Applied rewrites69.7%
Final simplification29.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C -4.0) A (* B_m B_m))))
(if (<= B_m 21500000000000.0)
(* (- (sqrt (* (* F 2.0) t_0))) (/ (sqrt (* 2.0 C)) t_0))
(* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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 * -4.0), A, (B_m * B_m));
double tmp;
if (B_m <= 21500000000000.0) {
tmp = -sqrt(((F * 2.0) * t_0)) * (sqrt((2.0 * C)) / t_0);
} else {
tmp = ((-sqrt(2.0) / B_m) * sqrt((B_m + C))) * 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 * -4.0), A, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 21500000000000.0) tmp = Float64(Float64(-sqrt(Float64(Float64(F * 2.0) * t_0))) * Float64(sqrt(Float64(2.0 * C)) / t_0)); else tmp = Float64(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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 * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 21500000000000.0], N[((-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 21500000000000:\\
\;\;\;\;\left(-\sqrt{\left(F \cdot 2\right) \cdot t\_0}\right) \cdot \frac{\sqrt{2 \cdot C}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \cdot \sqrt{F}\\
\end{array}
\end{array}
if B < 2.15e13Initial program 23.1%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6417.1
Applied rewrites17.1%
lift-neg.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
distribute-rgt-neg-inN/A
Applied rewrites16.4%
Applied rewrites16.4%
Taylor expanded in A around inf
Applied rewrites16.8%
if 2.15e13 < B Initial program 14.5%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.6
Applied rewrites53.6%
Applied rewrites72.6%
Taylor expanded in C around 0
Applied rewrites69.7%
Final simplification28.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 (* (* (/ (- (sqrt 2.0)) B_m) (sqrt (+ B_m C))) (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((B_m + C))) * 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((b_m + c))) * 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((B_m + C))) * 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((B_m + C))) * 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(Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(B_m + C))) * 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((B_m + C))) * 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[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $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])\\
\\
\left(\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{B\_m + C}\right) \cdot \sqrt{F}
\end{array}
Initial program 21.2%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f6415.5
Applied rewrites15.5%
Applied rewrites19.7%
Taylor expanded in C around 0
Applied rewrites16.7%
Final simplification16.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 (if (<= C 2.1e+137) (- (sqrt (/ (* F 2.0) B_m))) (- (* (/ 2.0 B_m) (sqrt (* C 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 <= 2.1e+137) {
tmp = -sqrt(((F * 2.0) / B_m));
} else {
tmp = -((2.0 / B_m) * sqrt((C * 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 <= 2.1d+137) then
tmp = -sqrt(((f * 2.0d0) / b_m))
else
tmp = -((2.0d0 / b_m) * sqrt((c * 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 <= 2.1e+137) {
tmp = -Math.sqrt(((F * 2.0) / B_m));
} else {
tmp = -((2.0 / B_m) * Math.sqrt((C * 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 <= 2.1e+137: tmp = -math.sqrt(((F * 2.0) / B_m)) else: tmp = -((2.0 / B_m) * math.sqrt((C * 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 <= 2.1e+137) tmp = Float64(-sqrt(Float64(Float64(F * 2.0) / B_m))); else tmp = Float64(-Float64(Float64(2.0 / B_m) * sqrt(Float64(C * 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 <= 2.1e+137)
tmp = -sqrt(((F * 2.0) / B_m));
else
tmp = -((2.0 / B_m) * sqrt((C * 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, 2.1e+137], (-N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), (-N[(N[(2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 2.1 \cdot 10^{+137}:\\
\;\;\;\;-\sqrt{\frac{F \cdot 2}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;-\frac{2}{B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 2.0999999999999999e137Initial program 23.7%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6413.0
Applied rewrites13.0%
Applied rewrites13.0%
Applied rewrites13.1%
if 2.0999999999999999e137 < C Initial program 6.8%
Taylor expanded in A around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
lower-hypot.f64N/A
lower-/.f64N/A
lower-sqrt.f649.7
Applied rewrites9.7%
Taylor expanded in B around 0
Applied rewrites4.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 21.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6411.6
Applied rewrites11.6%
Applied rewrites11.6%
Applied rewrites17.0%
Final simplification17.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 (- (sqrt (/ (* F 2.0) 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) / 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) / 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) / 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) / 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 * 2.0) / 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) / 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 * 2.0), $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 \cdot 2}{B\_m}}
\end{array}
Initial program 21.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6411.6
Applied rewrites11.6%
Applied rewrites11.6%
Applied rewrites11.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 (- (sqrt (* F (/ 2.0 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 / 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 / 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 / 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 / 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 * Float64(2.0 / 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 / 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[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 21.2%
Taylor expanded in B around inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6411.6
Applied rewrites11.6%
Applied rewrites11.6%
Applied rewrites11.7%
herbie shell --seed 2025017
(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))))