
(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 12 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 (pow (- A C) 2.0))
(t_1 (* (* 4.0 A) C))
(t_2 (- (* B_m B_m) t_1))
(t_3 (- (pow B_m 2.0) t_1))
(t_4
(/
(sqrt (* (* 2.0 (* t_3 F)) (+ (+ A C) (sqrt (+ t_0 (pow B_m 2.0))))))
(- t_3)))
(t_5 (* 2.0 (* t_2 F)))
(t_6 (+ (* (- B_m) B_m) t_1)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt t_5) (- (sqrt (* 2.0 C)))) t_2)
(if (<= t_4 -1e-205)
(/ (sqrt (* t_5 (+ (+ A C) (sqrt (+ t_0 (* B_m B_m)))))) t_6)
(if (<= t_4 INFINITY)
(/ (sqrt (* t_5 (- (* -0.5 (/ (* B_m B_m) A)) (* -2.0 C)))) t_6)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = pow((A - C), 2.0);
double t_1 = (4.0 * A) * C;
double t_2 = (B_m * B_m) - t_1;
double t_3 = pow(B_m, 2.0) - t_1;
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((t_0 + pow(B_m, 2.0)))))) / -t_3;
double t_5 = 2.0 * (t_2 * F);
double t_6 = (-B_m * B_m) + t_1;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(t_5) * -sqrt((2.0 * C))) / t_2;
} else if (t_4 <= -1e-205) {
tmp = sqrt((t_5 * ((A + C) + sqrt((t_0 + (B_m * B_m)))))) / t_6;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_5 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_6;
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.pow((A - C), 2.0);
double t_1 = (4.0 * A) * C;
double t_2 = (B_m * B_m) - t_1;
double t_3 = Math.pow(B_m, 2.0) - t_1;
double t_4 = Math.sqrt(((2.0 * (t_3 * F)) * ((A + C) + Math.sqrt((t_0 + Math.pow(B_m, 2.0)))))) / -t_3;
double t_5 = 2.0 * (t_2 * F);
double t_6 = (-B_m * B_m) + t_1;
double tmp;
if (t_4 <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt(t_5) * -Math.sqrt((2.0 * C))) / t_2;
} else if (t_4 <= -1e-205) {
tmp = Math.sqrt((t_5 * ((A + C) + Math.sqrt((t_0 + (B_m * B_m)))))) / t_6;
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_5 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_6;
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = math.pow((A - C), 2.0) t_1 = (4.0 * A) * C t_2 = (B_m * B_m) - t_1 t_3 = math.pow(B_m, 2.0) - t_1 t_4 = math.sqrt(((2.0 * (t_3 * F)) * ((A + C) + math.sqrt((t_0 + math.pow(B_m, 2.0)))))) / -t_3 t_5 = 2.0 * (t_2 * F) t_6 = (-B_m * B_m) + t_1 tmp = 0 if t_4 <= -math.inf: tmp = (math.sqrt(t_5) * -math.sqrt((2.0 * C))) / t_2 elif t_4 <= -1e-205: tmp = math.sqrt((t_5 * ((A + C) + math.sqrt((t_0 + (B_m * B_m)))))) / t_6 elif t_4 <= math.inf: tmp = math.sqrt((t_5 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_6 else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A - C) ^ 2.0 t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(Float64(B_m * B_m) - t_1) t_3 = Float64((B_m ^ 2.0) - t_1) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64(t_0 + (B_m ^ 2.0)))))) / Float64(-t_3)) t_5 = Float64(2.0 * Float64(t_2 * F)) t_6 = Float64(Float64(Float64(-B_m) * B_m) + t_1) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(t_5) * Float64(-sqrt(Float64(2.0 * C)))) / t_2); elseif (t_4 <= -1e-205) tmp = Float64(sqrt(Float64(t_5 * Float64(Float64(A + C) + sqrt(Float64(t_0 + Float64(B_m * B_m)))))) / t_6); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_5 * Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) - Float64(-2.0 * C)))) / t_6); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (A - C) ^ 2.0;
t_1 = (4.0 * A) * C;
t_2 = (B_m * B_m) - t_1;
t_3 = (B_m ^ 2.0) - t_1;
t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((t_0 + (B_m ^ 2.0)))))) / -t_3;
t_5 = 2.0 * (t_2 * F);
t_6 = (-B_m * B_m) + t_1;
tmp = 0.0;
if (t_4 <= -Inf)
tmp = (sqrt(t_5) * -sqrt((2.0 * C))) / t_2;
elseif (t_4 <= -1e-205)
tmp = sqrt((t_5 * ((A + C) + sqrt((t_0 + (B_m * B_m)))))) / t_6;
elseif (t_4 <= Inf)
tmp = sqrt((t_5 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_6;
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $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[(t$95$0 + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, Block[{t$95$5 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[t$95$5], $MachinePrecision] * (-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, -1e-205], N[(N[Sqrt[N[(t$95$5 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(t$95$0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$5 * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] - N[(-2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$6), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := {\left(A - C\right)}^{2}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := B\_m \cdot B\_m - t\_1\\
t_3 := {B\_m}^{2} - t\_1\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{t\_0 + {B\_m}^{2}}\right)}}{-t\_3}\\
t_5 := 2 \cdot \left(t\_2 \cdot F\right)\\
t_6 := \left(-B\_m\right) \cdot B\_m + t\_1\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{t\_5} \cdot \left(-\sqrt{2 \cdot C}\right)}{t\_2}\\
\mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(\left(A + C\right) + \sqrt{t\_0 + B\_m \cdot B\_m}\right)}}{t\_6}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A} - -2 \cdot C\right)}}{t\_6}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in A around -inf
lower-*.f6417.9
Applied rewrites17.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites28.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f6428.6
Applied rewrites28.6%
Applied rewrites28.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-205Initial program 99.5%
lift-pow.f64N/A
unpow2N/A
lower-*.f6499.5
lift-pow.f64N/A
unpow2N/A
lower-*.f6499.5
Applied rewrites99.5%
if -1e-205 < (/.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 14.8%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6441.1
Applied rewrites41.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
Applied rewrites41.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification38.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 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (- (pow B_m 2.0) t_0))
(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 (/ (* (sqrt (* 2.0 (* t_1 F))) (- (sqrt (* 2.0 C)))) t_1)))
(if (<= t_3 -4e+159)
t_4
(if (<= t_3 -1e-205)
(/
(sqrt
(* 2.0 (* (* B_m B_m) (* F (+ C (sqrt (+ (* B_m B_m) (* C C))))))))
(+ (* (- B_m) B_m) t_0))
(if (<= t_3 0.0)
(- (sqrt (/ (- F) A)))
(if (<= t_3 INFINITY)
t_4
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = pow(B_m, 2.0) - t_0;
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 = (sqrt((2.0 * (t_1 * F))) * -sqrt((2.0 * C))) / t_1;
double tmp;
if (t_3 <= -4e+159) {
tmp = t_4;
} else if (t_3 <= -1e-205) {
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / ((-B_m * B_m) + t_0);
} else if (t_3 <= 0.0) {
tmp = -sqrt((-F / A));
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = Math.pow(B_m, 2.0) - t_0;
double t_3 = Math.sqrt(((2.0 * (t_2 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_2;
double t_4 = (Math.sqrt((2.0 * (t_1 * F))) * -Math.sqrt((2.0 * C))) / t_1;
double tmp;
if (t_3 <= -4e+159) {
tmp = t_4;
} else if (t_3 <= -1e-205) {
tmp = Math.sqrt((2.0 * ((B_m * B_m) * (F * (C + Math.sqrt(((B_m * B_m) + (C * C)))))))) / ((-B_m * B_m) + t_0);
} else if (t_3 <= 0.0) {
tmp = -Math.sqrt((-F / A));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = t_4;
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = (B_m * B_m) - t_0 t_2 = math.pow(B_m, 2.0) - t_0 t_3 = math.sqrt(((2.0 * (t_2 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_2 t_4 = (math.sqrt((2.0 * (t_1 * F))) * -math.sqrt((2.0 * C))) / t_1 tmp = 0 if t_3 <= -4e+159: tmp = t_4 elif t_3 <= -1e-205: tmp = math.sqrt((2.0 * ((B_m * B_m) * (F * (C + math.sqrt(((B_m * B_m) + (C * C)))))))) / ((-B_m * B_m) + t_0) elif t_3 <= 0.0: tmp = -math.sqrt((-F / A)) elif t_3 <= math.inf: tmp = t_4 else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64((B_m ^ 2.0) - t_0) 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(Float64(sqrt(Float64(2.0 * Float64(t_1 * F))) * Float64(-sqrt(Float64(2.0 * C)))) / t_1) tmp = 0.0 if (t_3 <= -4e+159) tmp = t_4; elseif (t_3 <= -1e-205) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(B_m * B_m) * Float64(F * Float64(C + sqrt(Float64(Float64(B_m * B_m) + Float64(C * C)))))))) / Float64(Float64(Float64(-B_m) * B_m) + t_0)); elseif (t_3 <= 0.0) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = (B_m * B_m) - t_0;
t_2 = (B_m ^ 2.0) - t_0;
t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_2;
t_4 = (sqrt((2.0 * (t_1 * F))) * -sqrt((2.0 * C))) / t_1;
tmp = 0.0;
if (t_3 <= -4e+159)
tmp = t_4;
elseif (t_3 <= -1e-205)
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / ((-B_m * B_m) + t_0);
elseif (t_3 <= 0.0)
tmp = -sqrt((-F / A));
elseif (t_3 <= Inf)
tmp = t_4;
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $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 = N[(N[(N[Sqrt[N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, -4e+159], t$95$4, If[LessEqual[t$95$3, -1e-205], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(F * N[(C + N[Sqrt[N[(N[(B$95$m * B$95$m), $MachinePrecision] + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := B\_m \cdot B\_m - t\_0\\
t_2 := {B\_m}^{2} - t\_0\\
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 := \frac{\sqrt{2 \cdot \left(t\_1 \cdot F\right)} \cdot \left(-\sqrt{2 \cdot C}\right)}{t\_1}\\
\mathbf{if}\;t\_3 \leq -4 \cdot 10^{+159}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot \left(F \cdot \left(C + \sqrt{B\_m \cdot B\_m + C \cdot C}\right)\right)\right)}}{\left(-B\_m\right) \cdot B\_m + t\_0}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999997e159 or 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 18.2%
Taylor expanded in A around -inf
lower-*.f6423.6
Applied rewrites23.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites33.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f6433.4
Applied rewrites33.4%
Applied rewrites33.5%
if -3.9999999999999997e159 < (/.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-205Initial program 99.5%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.3
Applied rewrites15.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6415.3
lift-pow.f64N/A
pow2N/A
lift-*.f6415.3
Applied rewrites15.3%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
pow2N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6477.6
Applied rewrites77.6%
if -1e-205 < (/.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.4%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites12.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6433.7
Applied rewrites33.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 C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification33.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (pow B_m 2.0) t_0))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1))))
(if (<= t_2 -2e+279)
(- (sqrt (* (/ (* F (* 2.0 C)) (- (* B_m B_m) (* 4.0 (* A C)))) 2.0)))
(if (<= t_2 -1e-205)
(/
(sqrt
(* 2.0 (* (* B_m B_m) (* F (+ C (sqrt (+ (* B_m B_m) (* C C))))))))
(- (* B_m B_m)))
(if (<= t_2 0.0)
(- (sqrt (/ (- F) A)))
(if (<= t_2 INFINITY)
(/ (sqrt (* -16.0 (* A (* (* C C) F)))) (+ (* (- B_m) B_m) t_0))
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = pow(B_m, 2.0) - t_0;
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 tmp;
if (t_2 <= -2e+279) {
tmp = -sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_2 <= -1e-205) {
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / -(B_m * B_m);
} else if (t_2 <= 0.0) {
tmp = -sqrt((-F / A));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_0);
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = Math.pow(B_m, 2.0) - t_0;
double t_2 = Math.sqrt(((2.0 * (t_1 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_1;
double tmp;
if (t_2 <= -2e+279) {
tmp = -Math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_2 <= -1e-205) {
tmp = Math.sqrt((2.0 * ((B_m * B_m) * (F * (C + Math.sqrt(((B_m * B_m) + (C * C)))))))) / -(B_m * B_m);
} else if (t_2 <= 0.0) {
tmp = -Math.sqrt((-F / A));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_0);
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = math.pow(B_m, 2.0) - t_0 t_2 = math.sqrt(((2.0 * (t_1 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_1 tmp = 0 if t_2 <= -2e+279: tmp = -math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_2 <= -1e-205: tmp = math.sqrt((2.0 * ((B_m * B_m) * (F * (C + math.sqrt(((B_m * B_m) + (C * C)))))))) / -(B_m * B_m) elif t_2 <= 0.0: tmp = -math.sqrt((-F / A)) elif t_2 <= math.inf: tmp = math.sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_0) else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64((B_m ^ 2.0) - t_0) 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)) tmp = 0.0 if (t_2 <= -2e+279) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(2.0 * C)) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_2 <= -1e-205) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(B_m * B_m) * Float64(F * Float64(C + sqrt(Float64(Float64(B_m * B_m) + Float64(C * C)))))))) / Float64(-Float64(B_m * B_m))); elseif (t_2 <= 0.0) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(Float64(Float64(-B_m) * B_m) + t_0)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = (B_m ^ 2.0) - t_0;
t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_1;
tmp = 0.0;
if (t_2 <= -2e+279)
tmp = -sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_2 <= -1e-205)
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / -(B_m * B_m);
elseif (t_2 <= 0.0)
tmp = -sqrt((-F / A));
elseif (t_2 <= Inf)
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_0);
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, 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]}, If[LessEqual[t$95$2, -2e+279], (-N[Sqrt[N[(N[(N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$2, -1e-205], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(F * N[(C + N[Sqrt[N[(N[(B$95$m * B$95$m), $MachinePrecision] + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, 0.0], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := {B\_m}^{2} - t\_0\\
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}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+279}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot C\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot \left(F \cdot \left(C + \sqrt{B\_m \cdot B\_m + C \cdot C}\right)\right)\right)}}{-B\_m \cdot B\_m}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{\left(-B\_m\right) \cdot B\_m + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000012e279Initial program 4.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites13.9%
Taylor expanded in A around -inf
lift-*.f6429.6
Applied rewrites29.6%
if -2.00000000000000012e279 < (/.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-205Initial program 99.4%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6413.9
Applied rewrites13.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6413.9
lift-pow.f64N/A
pow2N/A
lift-*.f6413.9
Applied rewrites13.9%
Taylor expanded in A around 0
pow2N/A
pow2N/A
lift-*.f643.4
Applied rewrites3.4%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
pow2N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6474.6
Applied rewrites74.6%
if -1e-205 < (/.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.4%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites12.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6433.7
Applied rewrites33.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 38.9%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6439.9
Applied rewrites39.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6439.9
lift-pow.f64N/A
pow2N/A
lift-*.f6439.9
Applied rewrites39.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.3
Applied rewrites14.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 C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification31.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) (- B_m)))
(t_1 (* (* 4.0 A) C))
(t_2 (- (pow B_m 2.0) t_1))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2))))
(if (<= t_3 -2e+279)
(- (sqrt (* (/ (* F (* 2.0 C)) (- (* B_m B_m) (* 4.0 (* A C)))) 2.0)))
(if (<= t_3 -1e-205)
(* t_0 (sqrt (* F (+ C (sqrt (+ (* B_m B_m) (* C C)))))))
(if (<= t_3 0.0)
(- (sqrt (/ (- F) A)))
(if (<= t_3 INFINITY)
(/ (sqrt (* -16.0 (* A (* (* C C) F)))) (+ (* (- B_m) B_m) t_1))
(* t_0 (sqrt (* F B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(2.0) / -B_m;
double t_1 = (4.0 * A) * C;
double t_2 = pow(B_m, 2.0) - t_1;
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 tmp;
if (t_3 <= -2e+279) {
tmp = -sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_3 <= -1e-205) {
tmp = t_0 * sqrt((F * (C + sqrt(((B_m * B_m) + (C * C))))));
} else if (t_3 <= 0.0) {
tmp = -sqrt((-F / A));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_1);
} else {
tmp = t_0 * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.sqrt(2.0) / -B_m;
double t_1 = (4.0 * A) * C;
double t_2 = Math.pow(B_m, 2.0) - t_1;
double t_3 = Math.sqrt(((2.0 * (t_2 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_2;
double tmp;
if (t_3 <= -2e+279) {
tmp = -Math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_3 <= -1e-205) {
tmp = t_0 * Math.sqrt((F * (C + Math.sqrt(((B_m * B_m) + (C * C))))));
} else if (t_3 <= 0.0) {
tmp = -Math.sqrt((-F / A));
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_1);
} else {
tmp = t_0 * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = math.sqrt(2.0) / -B_m t_1 = (4.0 * A) * C t_2 = math.pow(B_m, 2.0) - t_1 t_3 = math.sqrt(((2.0 * (t_2 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_2 tmp = 0 if t_3 <= -2e+279: tmp = -math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_3 <= -1e-205: tmp = t_0 * math.sqrt((F * (C + math.sqrt(((B_m * B_m) + (C * C)))))) elif t_3 <= 0.0: tmp = -math.sqrt((-F / A)) elif t_3 <= math.inf: tmp = math.sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_1) else: tmp = t_0 * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(sqrt(2.0) / Float64(-B_m)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64((B_m ^ 2.0) - t_1) 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)) tmp = 0.0 if (t_3 <= -2e+279) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(2.0 * C)) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_3 <= -1e-205) tmp = Float64(t_0 * sqrt(Float64(F * Float64(C + sqrt(Float64(Float64(B_m * B_m) + Float64(C * C))))))); elseif (t_3 <= 0.0) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(Float64(Float64(-B_m) * B_m) + t_1)); else tmp = Float64(t_0 * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = sqrt(2.0) / -B_m;
t_1 = (4.0 * A) * C;
t_2 = (B_m ^ 2.0) - t_1;
t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_2;
tmp = 0.0;
if (t_3 <= -2e+279)
tmp = -sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_3 <= -1e-205)
tmp = t_0 * sqrt((F * (C + sqrt(((B_m * B_m) + (C * C))))));
elseif (t_3 <= 0.0)
tmp = -sqrt((-F / A));
elseif (t_3 <= Inf)
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / ((-B_m * B_m) + t_1);
else
tmp = t_0 * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $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]}, If[LessEqual[t$95$3, -2e+279], (-N[Sqrt[N[(N[(N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$3, -1e-205], N[(t$95$0 * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(N[(B$95$m * B$95$m), $MachinePrecision] + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{2}}{-B\_m}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := {B\_m}^{2} - t\_1\\
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}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+279}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(2 \cdot C\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;t\_0 \cdot \sqrt{F \cdot \left(C + \sqrt{B\_m \cdot B\_m + C \cdot C}\right)}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{\left(-B\_m\right) \cdot B\_m + t\_1}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000012e279Initial program 4.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites13.9%
Taylor expanded in A around -inf
lift-*.f6429.6
Applied rewrites29.6%
if -2.00000000000000012e279 < (/.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-205Initial program 99.4%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6437.7
Applied rewrites37.7%
if -1e-205 < (/.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.4%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites12.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6433.7
Applied rewrites33.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 38.9%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6439.9
Applied rewrites39.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6439.9
lift-pow.f64N/A
pow2N/A
lift-*.f6439.9
Applied rewrites39.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.3
Applied rewrites14.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 C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification26.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 (- A C) 2.0))
(t_1 (* (* 4.0 A) C))
(t_2 (- (* B_m B_m) t_1))
(t_3 (* 2.0 (* t_2 F)))
(t_4 (- (pow B_m 2.0) t_1))
(t_5
(/
(sqrt (* (* 2.0 (* t_4 F)) (+ (+ A C) (sqrt (+ t_0 (pow B_m 2.0))))))
(- t_4))))
(if (<= t_5 -4e+159)
(/ (* (sqrt t_3) (- (sqrt (* 2.0 C)))) t_2)
(if (<= t_5 -1e-205)
(-
(sqrt
(*
(/
(* F (+ A (+ C (sqrt (+ (* B_m B_m) t_0)))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_5 INFINITY)
(/
(sqrt (* t_3 (- (* -0.5 (/ (* B_m B_m) A)) (* -2.0 C))))
(+ (* (- B_m) B_m) t_1))
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = pow((A - C), 2.0);
double t_1 = (4.0 * A) * C;
double t_2 = (B_m * B_m) - t_1;
double t_3 = 2.0 * (t_2 * F);
double t_4 = pow(B_m, 2.0) - t_1;
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((t_0 + pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -4e+159) {
tmp = (sqrt(t_3) * -sqrt((2.0 * C))) / t_2;
} else if (t_5 <= -1e-205) {
tmp = -sqrt((((F * (A + (C + sqrt(((B_m * B_m) + t_0))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((t_3 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / ((-B_m * B_m) + t_1);
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.pow((A - C), 2.0);
double t_1 = (4.0 * A) * C;
double t_2 = (B_m * B_m) - t_1;
double t_3 = 2.0 * (t_2 * F);
double t_4 = Math.pow(B_m, 2.0) - t_1;
double t_5 = Math.sqrt(((2.0 * (t_4 * F)) * ((A + C) + Math.sqrt((t_0 + Math.pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -4e+159) {
tmp = (Math.sqrt(t_3) * -Math.sqrt((2.0 * C))) / t_2;
} else if (t_5 <= -1e-205) {
tmp = -Math.sqrt((((F * (A + (C + Math.sqrt(((B_m * B_m) + t_0))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_5 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_3 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / ((-B_m * B_m) + t_1);
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = math.pow((A - C), 2.0) t_1 = (4.0 * A) * C t_2 = (B_m * B_m) - t_1 t_3 = 2.0 * (t_2 * F) t_4 = math.pow(B_m, 2.0) - t_1 t_5 = math.sqrt(((2.0 * (t_4 * F)) * ((A + C) + math.sqrt((t_0 + math.pow(B_m, 2.0)))))) / -t_4 tmp = 0 if t_5 <= -4e+159: tmp = (math.sqrt(t_3) * -math.sqrt((2.0 * C))) / t_2 elif t_5 <= -1e-205: tmp = -math.sqrt((((F * (A + (C + math.sqrt(((B_m * B_m) + t_0))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) elif t_5 <= math.inf: tmp = math.sqrt((t_3 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / ((-B_m * B_m) + t_1) else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(A - C) ^ 2.0 t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(Float64(B_m * B_m) - t_1) t_3 = Float64(2.0 * Float64(t_2 * F)) t_4 = Float64((B_m ^ 2.0) - t_1) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64(t_0 + (B_m ^ 2.0)))))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= -4e+159) tmp = Float64(Float64(sqrt(t_3) * Float64(-sqrt(Float64(2.0 * C)))) / t_2); elseif (t_5 <= -1e-205) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + sqrt(Float64(Float64(B_m * B_m) + t_0))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_5 <= Inf) tmp = Float64(sqrt(Float64(t_3 * Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) - Float64(-2.0 * C)))) / Float64(Float64(Float64(-B_m) * B_m) + t_1)); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (A - C) ^ 2.0;
t_1 = (4.0 * A) * C;
t_2 = (B_m * B_m) - t_1;
t_3 = 2.0 * (t_2 * F);
t_4 = (B_m ^ 2.0) - t_1;
t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((t_0 + (B_m ^ 2.0)))))) / -t_4;
tmp = 0.0;
if (t_5 <= -4e+159)
tmp = (sqrt(t_3) * -sqrt((2.0 * C))) / t_2;
elseif (t_5 <= -1e-205)
tmp = -sqrt((((F * (A + (C + sqrt(((B_m * B_m) + t_0))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
elseif (t_5 <= Inf)
tmp = sqrt((t_3 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / ((-B_m * B_m) + t_1);
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(t$95$0 + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]}, If[LessEqual[t$95$5, -4e+159], N[(N[(N[Sqrt[t$95$3], $MachinePrecision] * (-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, -1e-205], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[N[(N[(B$95$m * B$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[N[(t$95$3 * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] - N[(-2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := {\left(A - C\right)}^{2}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := B\_m \cdot B\_m - t\_1\\
t_3 := 2 \cdot \left(t\_2 \cdot F\right)\\
t_4 := {B\_m}^{2} - t\_1\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{t\_0 + {B\_m}^{2}}\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -4 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_3} \cdot \left(-\sqrt{2 \cdot C}\right)}{t\_2}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{B\_m \cdot B\_m + t\_0}\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A} - -2 \cdot C\right)}}{\left(-B\_m\right) \cdot B\_m + t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999997e159Initial program 11.4%
Taylor expanded in A around -inf
lower-*.f6418.2
Applied rewrites18.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites28.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f6428.0
Applied rewrites28.0%
Applied rewrites28.2%
if -3.9999999999999997e159 < (/.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-205Initial program 99.5%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites93.6%
if -1e-205 < (/.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 14.8%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6441.1
Applied rewrites41.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
Applied rewrites41.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification36.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (* 2.0 (* t_1 F)))
(t_3 (+ (* (- B_m) B_m) t_0))
(t_4 (- (pow B_m 2.0) t_0))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_4 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_4))))
(if (<= t_5 -4e+159)
(/ (* (sqrt t_2) (- (sqrt (* 2.0 C)))) t_1)
(if (<= t_5 -1e-205)
(/
(sqrt
(* 2.0 (* (* B_m B_m) (* F (+ C (sqrt (+ (* B_m B_m) (* C C))))))))
t_3)
(if (<= t_5 INFINITY)
(/ (sqrt (* t_2 (- (* -0.5 (/ (* B_m B_m) A)) (* -2.0 C)))) t_3)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double t_3 = (-B_m * B_m) + t_0;
double t_4 = pow(B_m, 2.0) - t_0;
double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -4e+159) {
tmp = (sqrt(t_2) * -sqrt((2.0 * C))) / t_1;
} else if (t_5 <= -1e-205) {
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / t_3;
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((t_2 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_3;
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double t_3 = (-B_m * B_m) + t_0;
double t_4 = Math.pow(B_m, 2.0) - t_0;
double t_5 = Math.sqrt(((2.0 * (t_4 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / -t_4;
double tmp;
if (t_5 <= -4e+159) {
tmp = (Math.sqrt(t_2) * -Math.sqrt((2.0 * C))) / t_1;
} else if (t_5 <= -1e-205) {
tmp = Math.sqrt((2.0 * ((B_m * B_m) * (F * (C + Math.sqrt(((B_m * B_m) + (C * C)))))))) / t_3;
} else if (t_5 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((t_2 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_3;
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C t_1 = (B_m * B_m) - t_0 t_2 = 2.0 * (t_1 * F) t_3 = (-B_m * B_m) + t_0 t_4 = math.pow(B_m, 2.0) - t_0 t_5 = math.sqrt(((2.0 * (t_4 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / -t_4 tmp = 0 if t_5 <= -4e+159: tmp = (math.sqrt(t_2) * -math.sqrt((2.0 * C))) / t_1 elif t_5 <= -1e-205: tmp = math.sqrt((2.0 * ((B_m * B_m) * (F * (C + math.sqrt(((B_m * B_m) + (C * C)))))))) / t_3 elif t_5 <= math.inf: tmp = math.sqrt((t_2 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_3 else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(2.0 * Float64(t_1 * F)) t_3 = Float64(Float64(Float64(-B_m) * B_m) + t_0) t_4 = Float64((B_m ^ 2.0) - t_0) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4)) tmp = 0.0 if (t_5 <= -4e+159) tmp = Float64(Float64(sqrt(t_2) * Float64(-sqrt(Float64(2.0 * C)))) / t_1); elseif (t_5 <= -1e-205) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(B_m * B_m) * Float64(F * Float64(C + sqrt(Float64(Float64(B_m * B_m) + Float64(C * C)))))))) / t_3); elseif (t_5 <= Inf) tmp = Float64(sqrt(Float64(t_2 * Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)) - Float64(-2.0 * C)))) / t_3); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
t_1 = (B_m * B_m) - t_0;
t_2 = 2.0 * (t_1 * F);
t_3 = (-B_m * B_m) + t_0;
t_4 = (B_m ^ 2.0) - t_0;
t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / -t_4;
tmp = 0.0;
if (t_5 <= -4e+159)
tmp = (sqrt(t_2) * -sqrt((2.0 * C))) / t_1;
elseif (t_5 <= -1e-205)
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(((B_m * B_m) + (C * C)))))))) / t_3;
elseif (t_5 <= Inf)
tmp = sqrt((t_2 * ((-0.5 * ((B_m * B_m) / A)) - (-2.0 * C)))) / t_3;
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[((-B$95$m) * B$95$m), $MachinePrecision] + t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$4 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]}, If[LessEqual[t$95$5, -4e+159], N[(N[(N[Sqrt[t$95$2], $MachinePrecision] * (-N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$5, -1e-205], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(F * N[(C + N[Sqrt[N[(N[(B$95$m * B$95$m), $MachinePrecision] + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[N[(t$95$2 * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] - N[(-2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := B\_m \cdot B\_m - t\_0\\
t_2 := 2 \cdot \left(t\_1 \cdot F\right)\\
t_3 := \left(-B\_m\right) \cdot B\_m + t\_0\\
t_4 := {B\_m}^{2} - t\_0\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_4}\\
\mathbf{if}\;t\_5 \leq -4 \cdot 10^{+159}:\\
\;\;\;\;\frac{\sqrt{t\_2} \cdot \left(-\sqrt{2 \cdot C}\right)}{t\_1}\\
\mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-205}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot \left(F \cdot \left(C + \sqrt{B\_m \cdot B\_m + C \cdot C}\right)\right)\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A} - -2 \cdot C\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999997e159Initial program 11.4%
Taylor expanded in A around -inf
lower-*.f6418.2
Applied rewrites18.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites28.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f6428.0
Applied rewrites28.0%
Applied rewrites28.2%
if -3.9999999999999997e159 < (/.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-205Initial program 99.5%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.3
Applied rewrites15.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6415.3
lift-pow.f64N/A
pow2N/A
lift-*.f6415.3
Applied rewrites15.3%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
pow2N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6477.6
Applied rewrites77.6%
if -1e-205 < (/.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 14.8%
Taylor expanded in A around -inf
fp-cancel-sign-sub-invN/A
metadata-evalN/A
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6441.1
Applied rewrites41.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
lift-pow.f64N/A
pow2N/A
lift-*.f6441.1
Applied rewrites41.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.0
Applied rewrites2.0%
Taylor expanded in A around 0
Applied rewrites20.8%
Final simplification34.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1
(/
(sqrt (* (* 2.0 (* (- (* B_m B_m) t_0) F)) (* 2.0 C)))
(+ (* (- B_m) B_m) t_0)))
(t_2 (/ (sqrt 2.0) (- B_m))))
(if (<= B_m 1.22e-241)
t_1
(if (<= B_m 2e-151)
(- (sqrt (/ (- F) A)))
(if (<= B_m 6e+35)
t_1
(if (<= B_m 3.05e+63)
(* t_2 (sqrt (* -0.5 (/ (* (* B_m B_m) F) A))))
(*
t_2
(sqrt
(*
F
(+ A (* B_m (+ 1.0 (* 0.5 (ratio-of-squares A B_m))))))))))))))\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\left(-B\_m\right) \cdot B\_m + t\_0}\\
t_2 := \frac{\sqrt{2}}{-B\_m}\\
\mathbf{if}\;B\_m \leq 1.22 \cdot 10^{-241}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{-151}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;B\_m \leq 6 \cdot 10^{+35}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 3.05 \cdot 10^{+63}:\\
\;\;\;\;t\_2 \cdot \sqrt{-0.5 \cdot \frac{\left(B\_m \cdot B\_m\right) \cdot F}{A}}\\
\mathbf{else}:\\
\;\;\;\;t\_2 \cdot \sqrt{F \cdot \left(A + B\_m \cdot \left(1 + 0.5 \cdot \mathsf{ratio\_of\_squares}\left(A, B\_m\right)\right)\right)}\\
\end{array}
\end{array}
if B < 1.21999999999999993e-241 or 1.9999999999999999e-151 < B < 5.99999999999999981e35Initial program 22.2%
Taylor expanded in A around -inf
lower-*.f6420.6
Applied rewrites20.6%
lift-pow.f64N/A
pow2N/A
lift-*.f6420.6
lift-pow.f64N/A
pow2N/A
lift-*.f6420.6
Applied rewrites20.6%
if 1.21999999999999993e-241 < B < 1.9999999999999999e-151Initial program 2.0%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6439.1
Applied rewrites39.1%
if 5.99999999999999981e35 < B < 3.04999999999999984e63Initial program 3.2%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f643.2
Applied rewrites3.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6498.4
Applied rewrites98.4%
if 3.04999999999999984e63 < B Initial program 11.2%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.5
Applied rewrites16.5%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
pow2N/A
pow2N/A
lower-ratio-of-squares.f6450.3
Applied rewrites50.3%
Final simplification29.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.05e+63)
(- (sqrt (/ (- F) A)))
(*
(/ (sqrt 2.0) (- B_m))
(sqrt (* F (+ A (* B_m (+ 1.0 (* 0.5 (ratio-of-squares A B_m))))))))))\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.05 \cdot 10^{+63}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(A + B\_m \cdot \left(1 + 0.5 \cdot \mathsf{ratio\_of\_squares}\left(A, B\_m\right)\right)\right)}\\
\end{array}
\end{array}
if B < 3.04999999999999984e63Initial program 20.5%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites18.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6420.6
Applied rewrites20.6%
if 3.04999999999999984e63 < B Initial program 11.2%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.5
Applied rewrites16.5%
Taylor expanded in B around inf
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
pow2N/A
pow2N/A
lower-ratio-of-squares.f6450.3
Applied rewrites50.3%
Final simplification27.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 (if (<= B_m 3.05e+63) (- (sqrt (/ (- F) A))) (* (/ (sqrt 2.0) (- B_m)) (sqrt (* F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.05e+63) {
tmp = -sqrt((-F / A));
} else {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
}
return tmp;
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.05d+63) then
tmp = -sqrt((-f / a))
else
tmp = (sqrt(2.0d0) / -b_m) * sqrt((f * b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.05e+63) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * B_m));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.05e+63: tmp = -math.sqrt((-F / A)) else: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * B_m)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.05e+63) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * B_m))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.05e+63)
tmp = -sqrt((-F / A));
else
tmp = (sqrt(2.0) / -B_m) * sqrt((F * B_m));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.05e+63], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.05 \cdot 10^{+63}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot B\_m}\\
\end{array}
\end{array}
if B < 3.04999999999999984e63Initial program 20.5%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites18.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6420.6
Applied rewrites20.6%
if 3.04999999999999984e63 < B Initial program 11.2%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.5
Applied rewrites16.5%
Taylor expanded in A around 0
Applied rewrites50.9%
Final simplification27.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.05e+63) (- (sqrt (/ (- F) A))) (- (sqrt (* (/ F B_m) 2.0)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.05e+63) {
tmp = -sqrt((-F / A));
} else {
tmp = -sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (b_m <= 3.05d+63) then
tmp = -sqrt((-f / a))
else
tmp = -sqrt(((f / b_m) * 2.0d0))
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 (B_m <= 3.05e+63) {
tmp = -Math.sqrt((-F / A));
} else {
tmp = -Math.sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.05e+63: tmp = -math.sqrt((-F / A)) else: tmp = -math.sqrt(((F / B_m) * 2.0)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.05e+63) tmp = Float64(-sqrt(Float64(Float64(-F) / A))); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.05e+63)
tmp = -sqrt((-F / A));
else
tmp = -sqrt(((F / B_m) * 2.0));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.05e+63], (-N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.05 \cdot 10^{+63}:\\
\;\;\;\;-\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 3.04999999999999984e63Initial program 20.5%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites18.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6420.6
Applied rewrites20.6%
if 3.04999999999999984e63 < B Initial program 11.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6438.6
Applied rewrites38.6%
Final simplification24.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* (/ F B_m) 2.0)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F / B_m) * 2.0));
}
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 / b_m) * 2.0d0))
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 / B_m) * 2.0));
}
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 / B_m) * 2.0))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(F / B_m) * 2.0)) 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 / B_m) * 2.0));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{F}{B\_m} \cdot 2}
\end{array}
Initial program 18.4%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6411.6
Applied rewrites11.6%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-prodN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f642.0
Applied rewrites2.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) A))))
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 / A));
}
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 / a))
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 / A));
}
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 / A))
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) / A))) 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 / A));
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) / A), $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}{A}}
\end{array}
Initial program 18.4%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites16.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6418.2
Applied rewrites18.2%
Final simplification18.2%
herbie shell --seed 2025058
(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))))