
(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 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (- t_1))
(t_3 (* 2.0 (* t_1 F)))
(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 (- INFINITY))
(/ (* (- (sqrt t_3)) (sqrt (* 2.0 C))) t_1)
(if (<= t_5 -2e-201)
(/
(sqrt (* t_3 (+ (+ A C) (sqrt (fma (- A C) (- A C) (* B_m B_m))))))
t_2)
(if (<= t_5 1e+162)
(/ (sqrt (* t_3 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))) t_2)
(if (<= t_5 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = -t_1;
double t_3 = 2.0 * (t_1 * F);
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 <= -((double) INFINITY)) {
tmp = (-sqrt(t_3) * sqrt((2.0 * C))) / t_1;
} else if (t_5 <= -2e-201) {
tmp = sqrt((t_3 * ((A + C) + sqrt(fma((A - C), (A - C), (B_m * B_m)))))) / t_2;
} else if (t_5 <= 1e+162) {
tmp = sqrt((t_3 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_2;
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(-t_1) t_3 = Float64(2.0 * Float64(t_1 * F)) t_4 = Float64((B_m ^ 2.0) - t_0) t_5 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(t_3)) * sqrt(Float64(2.0 * C))) / t_1); elseif (t_5 <= -2e-201) tmp = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) + sqrt(fma(Float64(A - C), Float64(A - C), Float64(B_m * B_m)))))) / t_2); elseif (t_5 <= 1e+162) tmp = Float64(sqrt(Float64(t_3 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)))) / t_2); elseif (t_5 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = 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 = (-t$95$1)}, Block[{t$95$3 = N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $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, (-Infinity)], N[(N[((-N[Sqrt[t$95$3], $MachinePrecision]) * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$5, -2e-201], N[(N[Sqrt[N[(t$95$3 * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, 1e+162], N[(N[Sqrt[N[(t$95$3 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := B\_m \cdot B\_m - t\_0\\
t_2 := -t\_1\\
t_3 := 2 \cdot \left(t\_1 \cdot F\right)\\
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 -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_3}\right) \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(A - C, A - C, B\_m \cdot B\_m\right)}\right)}}{t\_2}\\
\mathbf{elif}\;t\_5 \leq 10^{+162}:\\
\;\;\;\;\frac{\sqrt{t\_3 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_2}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f643.4
Applied rewrites3.4%
lift-pow.f64N/A
pow2N/A
lift-*.f643.4
lift-pow.f64N/A
pow2N/A
lift-*.f643.4
Applied rewrites3.4%
Taylor expanded in A around -inf
lower-*.f6414.8
Applied rewrites14.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites21.5%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-201Initial program 99.5%
Applied rewrites99.5%
if -1.99999999999999989e-201 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e161Initial program 24.2%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6413.3
Applied rewrites13.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
Applied rewrites13.3%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6438.5
Applied rewrites38.5%
if 9.9999999999999994e161 < (/.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.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6420.5
Applied rewrites20.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6420.5
Applied rewrites20.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6424.0
Applied rewrites24.0%
Final simplification38.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (* 2.0 (* t_1 F)))
(t_3 (- (pow B_m 2.0) t_0))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))))))
t_3)))
(if (<= t_4 -2e+170)
(/ (* (- (sqrt t_2)) (sqrt (* 2.0 C))) t_1)
(if (<= t_4 -2e-201)
(/
(sqrt (* 2.0 (* (* B_m B_m) (* F (+ C (sqrt (fma B_m B_m (* C C))))))))
(- t_3))
(if (<= t_4 1e+162)
(/ (sqrt (* t_2 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))) (- t_1))
(if (<= t_4 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double t_3 = pow(B_m, 2.0) - t_0;
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_3;
double tmp;
if (t_4 <= -2e+170) {
tmp = (-sqrt(t_2) * sqrt((2.0 * C))) / t_1;
} else if (t_4 <= -2e-201) {
tmp = sqrt((2.0 * ((B_m * B_m) * (F * (C + sqrt(fma(B_m, B_m, (C * C)))))))) / -t_3;
} else if (t_4 <= 1e+162) {
tmp = sqrt((t_2 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / -t_1;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(2.0 * Float64(t_1 * F)) t_3 = Float64((B_m ^ 2.0) - t_0) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_3) tmp = 0.0 if (t_4 <= -2e+170) tmp = Float64(Float64(Float64(-sqrt(t_2)) * sqrt(Float64(2.0 * C))) / t_1); elseif (t_4 <= -2e-201) tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(B_m * B_m) * Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))))) / Float64(-t_3)); elseif (t_4 <= 1e+162) tmp = Float64(sqrt(Float64(t_2 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)))) / Float64(-t_1)); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = 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[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+170], 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$4, -2e-201], N[(N[Sqrt[N[(2.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision], If[LessEqual[t$95$4, 1e+162], N[(N[Sqrt[N[(t$95$2 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \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 := {B\_m}^{2} - t\_0\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+170}:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2}\right) \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-201}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot \left(F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)\right)\right)}}{-t\_3}\\
\mathbf{elif}\;t\_4 \leq 10^{+162}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{-t\_1}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000007e170Initial program 13.0%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.3
Applied rewrites7.3%
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
Applied rewrites7.3%
Taylor expanded in A around -inf
lower-*.f6419.3
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites25.3%
if -2.00000000000000007e170 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-201Initial program 99.4%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6472.7
Applied rewrites72.7%
if -1.99999999999999989e-201 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e161Initial program 24.2%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6413.3
Applied rewrites13.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
Applied rewrites13.3%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6438.5
Applied rewrites38.5%
if 9.9999999999999994e161 < (/.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.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6420.5
Applied rewrites20.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6420.5
Applied rewrites20.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6424.0
Applied rewrites24.0%
Final simplification34.1%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (* 2.0 (* t_1 F)))
(t_3 (- t_1))
(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 -2e+170)
(/ (* (- (sqrt t_2)) (sqrt (* 2.0 C))) t_1)
(if (<= t_5 -2e-201)
(/
(* (* B_m (sqrt 2.0)) (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C)))))))
t_3)
(if (<= t_5 1e+162)
(/ (sqrt (* t_2 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))) t_3)
(if (<= t_5 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double t_3 = -t_1;
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 <= -2e+170) {
tmp = (-sqrt(t_2) * sqrt((2.0 * C))) / t_1;
} else if (t_5 <= -2e-201) {
tmp = ((B_m * sqrt(2.0)) * sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))))) / t_3;
} else if (t_5 <= 1e+162) {
tmp = sqrt((t_2 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_3;
} else if (t_5 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(2.0 * Float64(t_1 * F)) t_3 = Float64(-t_1) t_4 = Float64((B_m ^ 2.0) - t_0) t_5 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_4) tmp = 0.0 if (t_5 <= -2e+170) tmp = Float64(Float64(Float64(-sqrt(t_2)) * sqrt(Float64(2.0 * C))) / t_1); elseif (t_5 <= -2e-201) tmp = Float64(Float64(Float64(B_m * sqrt(2.0)) * sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C))))))) / t_3); elseif (t_5 <= 1e+162) tmp = Float64(sqrt(Float64(t_2 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C)))) / t_3); elseif (t_5 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = 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 = (-t$95$1)}, 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, -2e+170], 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, -2e-201], N[(N[(N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, 1e+162], N[(N[Sqrt[N[(t$95$2 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \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 := -t\_1\\
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 -2 \cdot 10^{+170}:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2}\right) \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-201}:\\
\;\;\;\;\frac{\left(B\_m \cdot \sqrt{2}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq 10^{+162}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_3}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000007e170Initial program 13.0%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.3
Applied rewrites7.3%
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
Applied rewrites7.3%
Taylor expanded in A around -inf
lower-*.f6419.3
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites25.3%
if -2.00000000000000007e170 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-201Initial program 99.4%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6492.7
Applied rewrites92.7%
lift-pow.f64N/A
pow2N/A
lift-*.f6492.7
lift-pow.f64N/A
pow2N/A
lift-*.f6492.7
Applied rewrites92.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites25.4%
if -1.99999999999999989e-201 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e161Initial program 24.2%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6413.3
Applied rewrites13.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
Applied rewrites13.3%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6438.5
Applied rewrites38.5%
if 9.9999999999999994e161 < (/.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.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6420.5
Applied rewrites20.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6420.5
Applied rewrites20.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6424.0
Applied rewrites24.0%
Final simplification27.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (* 2.0 (* t_1 F)))
(t_3 (- (pow B_m 2.0) t_0))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))))))
t_3)))
(if (<= t_4 -2e+170)
(/ (* (- (sqrt t_2)) (sqrt (* 2.0 C))) t_1)
(if (<= t_4 -5e-143)
(-
(sqrt
(*
(/
(* F (+ A (+ C (sqrt (fma B_m B_m (* (- A C) (- A C)))))))
(- (* B_m B_m) (* 4.0 (* A C))))
2.0)))
(if (<= t_4 1e+162)
(/ (sqrt (* t_2 (* 2.0 C))) (- t_1))
(if (<= t_4 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double t_3 = pow(B_m, 2.0) - t_0;
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_3;
double tmp;
if (t_4 <= -2e+170) {
tmp = (-sqrt(t_2) * sqrt((2.0 * C))) / t_1;
} else if (t_4 <= -5e-143) {
tmp = -sqrt((((F * (A + (C + sqrt(fma(B_m, B_m, ((A - C) * (A - C))))))) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else if (t_4 <= 1e+162) {
tmp = sqrt((t_2 * (2.0 * C))) / -t_1;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(2.0 * Float64(t_1 * F)) t_3 = Float64((B_m ^ 2.0) - t_0) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_3) tmp = 0.0 if (t_4 <= -2e+170) tmp = Float64(Float64(Float64(-sqrt(t_2)) * sqrt(Float64(2.0 * C))) / t_1); elseif (t_4 <= -5e-143) tmp = Float64(-sqrt(Float64(Float64(Float64(F * Float64(A + Float64(C + sqrt(fma(B_m, B_m, Float64(Float64(A - C) * Float64(A - C))))))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0))); elseif (t_4 <= 1e+162) tmp = Float64(sqrt(Float64(t_2 * Float64(2.0 * C))) / Float64(-t_1)); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = 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[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+170], 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$4, -5e-143], (-N[Sqrt[N[(N[(N[(F * N[(A + N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $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$4, 1e+162], N[(N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \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 := {B\_m}^{2} - t\_0\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+170}:\\
\;\;\;\;\frac{\left(-\sqrt{t\_2}\right) \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-143}:\\
\;\;\;\;-\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{elif}\;t\_4 \leq 10^{+162}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{-t\_1}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000007e170Initial program 13.0%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.3
Applied rewrites7.3%
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
Applied rewrites7.3%
Taylor expanded in A around -inf
lower-*.f6419.3
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites25.3%
if -2.00000000000000007e170 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.0000000000000002e-143Initial program 99.4%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites99.5%
if -5.0000000000000002e-143 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e161Initial program 32.2%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6421.3
lift-pow.f64N/A
pow2N/A
lift-*.f6421.3
Applied rewrites21.3%
Taylor expanded in A around -inf
lower-*.f6429.7
Applied rewrites29.7%
if 9.9999999999999994e161 < (/.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.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6420.5
Applied rewrites20.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6420.5
Applied rewrites20.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6424.0
Applied rewrites24.0%
Final simplification34.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (- t_1))
(t_3 (- (pow B_m 2.0) t_0))
(t_4
(/
(-
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))))))
t_3)))
(if (<= t_4 -2e+170)
(/ (* (- (sqrt (* 2.0 (* t_1 F)))) (sqrt (* 2.0 C))) t_1)
(if (<= t_4 -2e-201)
(/
(* (* B_m (sqrt 2.0)) (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C)))))))
t_2)
(if (<= t_4 1e+162)
(/ (sqrt (* (* -8.0 (* A (* C F))) (* 2.0 C))) t_2)
(if (<= t_4 INFINITY)
(sqrt (/ (- F) A))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = -t_1;
double t_3 = pow(B_m, 2.0) - t_0;
double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_3;
double tmp;
if (t_4 <= -2e+170) {
tmp = (-sqrt((2.0 * (t_1 * F))) * sqrt((2.0 * C))) / t_1;
} else if (t_4 <= -2e-201) {
tmp = ((B_m * sqrt(2.0)) * sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))))) / t_2;
} else if (t_4 <= 1e+162) {
tmp = sqrt(((-8.0 * (A * (C * F))) * (2.0 * C))) / t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(-t_1) t_3 = Float64((B_m ^ 2.0) - t_0) t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_3) tmp = 0.0 if (t_4 <= -2e+170) tmp = Float64(Float64(Float64(-sqrt(Float64(2.0 * Float64(t_1 * F)))) * sqrt(Float64(2.0 * C))) / t_1); elseif (t_4 <= -2e-201) tmp = Float64(Float64(Float64(B_m * sqrt(2.0)) * sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C))))))) / t_2); elseif (t_4 <= 1e+162) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(2.0 * C))) / t_2); elseif (t_4 <= Inf) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = 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 = (-t$95$1)}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+170], 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$4, -2e-201], N[(N[(N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, 1e+162], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := B\_m \cdot B\_m - t\_0\\
t_2 := -t\_1\\
t_3 := {B\_m}^{2} - t\_0\\
t_4 := \frac{-\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -2 \cdot 10^{+170}:\\
\;\;\;\;\frac{\left(-\sqrt{2 \cdot \left(t\_1 \cdot F\right)}\right) \cdot \sqrt{2 \cdot C}}{t\_1}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-201}:\\
\;\;\;\;\frac{\left(B\_m \cdot \sqrt{2}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq 10^{+162}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(2 \cdot C\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000007e170Initial program 13.0%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.3
Applied rewrites7.3%
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
lift-pow.f64N/A
pow2N/A
lift-*.f647.3
Applied rewrites7.3%
Taylor expanded in A around -inf
lower-*.f6419.3
Applied rewrites19.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites25.3%
if -2.00000000000000007e170 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-201Initial program 99.4%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6492.7
Applied rewrites92.7%
lift-pow.f64N/A
pow2N/A
lift-*.f6492.7
lift-pow.f64N/A
pow2N/A
lift-*.f6492.7
Applied rewrites92.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites25.4%
if -1.99999999999999989e-201 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.9999999999999994e161Initial program 24.2%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6413.3
Applied rewrites13.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
lift-pow.f64N/A
pow2N/A
lift-*.f6413.3
Applied rewrites13.3%
Taylor expanded in A around -inf
lower-*.f6432.7
Applied rewrites32.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6432.8
Applied rewrites32.8%
if 9.9999999999999994e161 < (/.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.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites15.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6420.5
Applied rewrites20.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6420.5
Applied rewrites20.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6424.0
Applied rewrites24.0%
Final simplification26.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (* B_m B_m) (* (* 4.0 A) C))) (t_1 (sqrt (/ (- F) A))))
(if (<= B_m 2.25e-265)
t_1
(if (<= B_m 1.06e-193)
(/ (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 C))) (- (* -4.0 (* A C))))
(if (<= B_m 5.2e-30)
t_1
(if (<= B_m 7.2e+85)
(/
(*
(* B_m (sqrt 2.0))
(sqrt (* F (+ C (sqrt (fma B_m B_m (* C C)))))))
(- t_0))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = sqrt((-F / A));
double tmp;
if (B_m <= 2.25e-265) {
tmp = t_1;
} else if (B_m <= 1.06e-193) {
tmp = sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / -(-4.0 * (A * C));
} else if (B_m <= 5.2e-30) {
tmp = t_1;
} else if (B_m <= 7.2e+85) {
tmp = ((B_m * sqrt(2.0)) * sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))))) / -t_0;
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) t_1 = sqrt(Float64(Float64(-F) / A)) tmp = 0.0 if (B_m <= 2.25e-265) tmp = t_1; elseif (B_m <= 1.06e-193) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C))) / Float64(-Float64(-4.0 * Float64(A * C)))); elseif (B_m <= 5.2e-30) tmp = t_1; elseif (B_m <= 7.2e+85) tmp = Float64(Float64(Float64(B_m * sqrt(2.0)) * sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C))))))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.25e-265], t$95$1, If[LessEqual[B$95$m, 1.06e-193], N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 5.2e-30], t$95$1, If[LessEqual[B$95$m, 7.2e+85], N[(N[(N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\\
t_1 := \sqrt{\frac{-F}{A}}\\
\mathbf{if}\;B\_m \leq 2.25 \cdot 10^{-265}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 1.06 \cdot 10^{-193}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{--4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{-30}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+85}:\\
\;\;\;\;\frac{\left(B\_m \cdot \sqrt{2}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 2.2500000000000001e-265 or 1.06e-193 < B < 5.19999999999999973e-30Initial program 21.4%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6418.0
Applied rewrites18.0%
if 2.2500000000000001e-265 < B < 1.06e-193Initial program 34.6%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6418.9
Applied rewrites18.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
Applied rewrites18.9%
Taylor expanded in A around -inf
lower-*.f6435.0
Applied rewrites35.0%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
if 5.19999999999999973e-30 < B < 7.1999999999999996e85Initial program 31.4%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6424.3
Applied rewrites24.3%
lift-pow.f64N/A
pow2N/A
lift-*.f6424.3
lift-pow.f64N/A
pow2N/A
lift-*.f6424.3
Applied rewrites24.3%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites27.5%
if 7.1999999999999996e85 < B Initial program 3.9%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6456.7
Applied rewrites56.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6456.5
Applied rewrites56.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6467.1
Applied rewrites67.1%
Final simplification28.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 (/ (- F) A))))
(if (<= B_m 2.25e-265)
t_0
(if (<= B_m 1.06e-193)
(/
(sqrt (* (* 2.0 (* (- (* B_m B_m) (* (* 4.0 A) C)) F)) (* 2.0 C)))
(- (* -4.0 (* A C))))
(if (<= B_m 5.2e-30)
t_0
(if (<= B_m 7.2e+85)
(*
(/ (sqrt 2.0) B_m)
(- (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((-F / A));
double tmp;
if (B_m <= 2.25e-265) {
tmp = t_0;
} else if (B_m <= 1.06e-193) {
tmp = sqrt(((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F)) * (2.0 * C))) / -(-4.0 * (A * C));
} else if (B_m <= 5.2e-30) {
tmp = t_0;
} else if (B_m <= 7.2e+85) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(Float64(-F) / A)) tmp = 0.0 if (B_m <= 2.25e-265) tmp = t_0; elseif (B_m <= 1.06e-193) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) * F)) * Float64(2.0 * C))) / Float64(-Float64(-4.0 * Float64(A * C)))); elseif (B_m <= 5.2e-30) tmp = t_0; elseif (B_m <= 7.2e+85) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))))); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.25e-265], t$95$0, If[LessEqual[B$95$m, 1.06e-193], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 5.2e-30], t$95$0, If[LessEqual[B$95$m, 7.2e+85], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{-F}{A}}\\
\mathbf{if}\;B\_m \leq 2.25 \cdot 10^{-265}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 1.06 \cdot 10^{-193}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left(B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{--4 \cdot \left(A \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{-30}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+85}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 2.2500000000000001e-265 or 1.06e-193 < B < 5.19999999999999973e-30Initial program 21.4%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6418.0
Applied rewrites18.0%
if 2.2500000000000001e-265 < B < 1.06e-193Initial program 34.6%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6418.9
Applied rewrites18.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
Applied rewrites18.9%
Taylor expanded in A around -inf
lower-*.f6435.0
Applied rewrites35.0%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6435.0
Applied rewrites35.0%
if 5.19999999999999973e-30 < B < 7.1999999999999996e85Initial program 31.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
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
if 7.1999999999999996e85 < B Initial program 3.9%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6456.7
Applied rewrites56.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6456.5
Applied rewrites56.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6467.1
Applied rewrites67.1%
Final simplification28.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 (/ (- F) A))))
(if (<= B_m 2.25e-265)
t_0
(if (<= B_m 1.06e-193)
(/
(sqrt (* (* -8.0 (* A (* C F))) (* 2.0 C)))
(- (- (* B_m B_m) (* (* 4.0 A) C))))
(if (<= B_m 5.2e-30)
t_0
(if (<= B_m 7.2e+85)
(*
(/ (sqrt 2.0) B_m)
(- (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((-F / A));
double tmp;
if (B_m <= 2.25e-265) {
tmp = t_0;
} else if (B_m <= 1.06e-193) {
tmp = sqrt(((-8.0 * (A * (C * F))) * (2.0 * C))) / -((B_m * B_m) - ((4.0 * A) * C));
} else if (B_m <= 5.2e-30) {
tmp = t_0;
} else if (B_m <= 7.2e+85) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = sqrt(Float64(Float64(-F) / A)) tmp = 0.0 if (B_m <= 2.25e-265) tmp = t_0; elseif (B_m <= 1.06e-193) tmp = Float64(sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(2.0 * C))) / Float64(-Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)))); elseif (B_m <= 5.2e-30) tmp = t_0; elseif (B_m <= 7.2e+85) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))))); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.25e-265], t$95$0, If[LessEqual[B$95$m, 1.06e-193], N[(N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 5.2e-30], t$95$0, If[LessEqual[B$95$m, 7.2e+85], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{-F}{A}}\\
\mathbf{if}\;B\_m \leq 2.25 \cdot 10^{-265}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 1.06 \cdot 10^{-193}:\\
\;\;\;\;\frac{\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(2 \cdot C\right)}}{-\left(B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 5.2 \cdot 10^{-30}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+85}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 2.2500000000000001e-265 or 1.06e-193 < B < 5.19999999999999973e-30Initial program 21.4%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6418.0
Applied rewrites18.0%
if 2.2500000000000001e-265 < B < 1.06e-193Initial program 34.6%
Taylor expanded in C around 0
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6418.9
Applied rewrites18.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
lift-pow.f64N/A
pow2N/A
lift-*.f6418.9
Applied rewrites18.9%
Taylor expanded in A around -inf
lower-*.f6435.0
Applied rewrites35.0%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6427.1
Applied rewrites27.1%
if 5.19999999999999973e-30 < B < 7.1999999999999996e85Initial program 31.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
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
if 7.1999999999999996e85 < B Initial program 3.9%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6456.7
Applied rewrites56.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6456.5
Applied rewrites56.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6467.1
Applied rewrites67.1%
Final simplification28.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 5.2e-30)
(sqrt (/ (- F) A))
(if (<= B_m 7.2e+85)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (+ C (sqrt (fma B_m B_m (* C C))))))))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 5.2e-30) {
tmp = sqrt((-F / A));
} else if (B_m <= 7.2e+85) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (C + sqrt(fma(B_m, B_m, (C * C))))));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 5.2e-30) tmp = sqrt(Float64(Float64(-F) / A)); elseif (B_m <= 7.2e+85) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))))); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 5.2e-30], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 7.2e+85], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-30}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;B\_m \leq 7.2 \cdot 10^{+85}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 5.19999999999999973e-30Initial program 22.3%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.7%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6417.0
Applied rewrites17.0%
if 5.19999999999999973e-30 < B < 7.1999999999999996e85Initial program 31.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
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.5
Applied rewrites27.5%
if 7.1999999999999996e85 < B Initial program 3.9%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6456.7
Applied rewrites56.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6456.5
Applied rewrites56.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6467.1
Applied rewrites67.1%
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 3e-16)
(sqrt (/ (- F) A))
(if (<= B_m 5.9e+35)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (* -0.5 (/ (* B_m B_m) A))))))
(* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3e-16) {
tmp = sqrt((-F / A));
} else if (B_m <= 5.9e+35) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(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 <= 3d-16) then
tmp = sqrt((-f / a))
else if (b_m <= 5.9d+35) then
tmp = (sqrt(2.0d0) / b_m) * -sqrt((f * ((-0.5d0) * ((b_m * b_m) / a))))
else
tmp = (sqrt(f) / sqrt(b_m)) * -sqrt(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 <= 3e-16) {
tmp = Math.sqrt((-F / A));
} else if (B_m <= 5.9e+35) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (-0.5 * ((B_m * B_m) / A))));
} else {
tmp = (Math.sqrt(F) / Math.sqrt(B_m)) * -Math.sqrt(2.0);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3e-16: tmp = math.sqrt((-F / A)) elif B_m <= 5.9e+35: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (-0.5 * ((B_m * B_m) / A)))) else: tmp = (math.sqrt(F) / math.sqrt(B_m)) * -math.sqrt(2.0) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3e-16) tmp = sqrt(Float64(Float64(-F) / A)); elseif (B_m <= 5.9e+35) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(-0.5 * Float64(Float64(B_m * B_m) / A)))))); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3e-16)
tmp = sqrt((-F / A));
elseif (B_m <= 5.9e+35)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (-0.5 * ((B_m * B_m) / A))));
else
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3e-16], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 5.9e+35], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3 \cdot 10^{-16}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;B\_m \leq 5.9 \cdot 10^{+35}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(-0.5 \cdot \frac{B\_m \cdot B\_m}{A}\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 2.99999999999999994e-16Initial program 23.3%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites6.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6416.8
Applied rewrites16.8%
if 2.99999999999999994e-16 < B < 5.89999999999999985e35Initial program 8.8%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6410.4
Applied rewrites10.4%
Taylor expanded in F around -inf
sqrt-prodN/A
pow2N/A
pow2N/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites10.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6432.3
Applied rewrites32.3%
if 5.89999999999999985e35 < B Initial program 11.8%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6450.7
Applied rewrites50.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6450.5
Applied rewrites50.5%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6461.1
Applied rewrites61.1%
Final simplification27.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.15e-18) (sqrt (/ (- F) A)) (* (/ (sqrt F) (sqrt B_m)) (- (sqrt 2.0)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.15e-18) {
tmp = sqrt((-F / A));
} else {
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(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 <= 1.15d-18) then
tmp = sqrt((-f / a))
else
tmp = (sqrt(f) / sqrt(b_m)) * -sqrt(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 <= 1.15e-18) {
tmp = Math.sqrt((-F / A));
} else {
tmp = (Math.sqrt(F) / Math.sqrt(B_m)) * -Math.sqrt(2.0);
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 1.15e-18: tmp = math.sqrt((-F / A)) else: tmp = (math.sqrt(F) / math.sqrt(B_m)) * -math.sqrt(2.0) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.15e-18) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(Float64(sqrt(F) / sqrt(B_m)) * Float64(-sqrt(2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.15e-18)
tmp = sqrt((-F / A));
else
tmp = (sqrt(F) / sqrt(B_m)) * -sqrt(2.0);
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.15e-18], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.15 \cdot 10^{-18}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F}}{\sqrt{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 1.15e-18Initial program 22.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites7.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6416.9
Applied rewrites16.9%
if 1.15e-18 < B Initial program 12.5%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6443.2
Applied rewrites43.2%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-sqrt.f6443.0
Applied rewrites43.0%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6451.5
Applied rewrites51.5%
Final simplification26.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 1.15e-18) (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 <= 1.15e-18) {
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 <= 1.15d-18) 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 <= 1.15e-18) {
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 <= 1.15e-18: 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 <= 1.15e-18) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 1.15e-18)
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, 1.15e-18], 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 1.15 \cdot 10^{-18}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 1.15e-18Initial program 22.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites7.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6416.9
Applied rewrites16.9%
if 1.15e-18 < B Initial program 12.5%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6443.2
Applied rewrites43.2%
Final simplification24.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 (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 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 20.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites5.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6413.9
Applied rewrites13.9%
Final simplification13.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* -2.0 (/ F B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-2.0 * (F / B_m)));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((-2.0d0) * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((-2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((-2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(-2.0 * Float64(F / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((-2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(-2.0 * 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])\\
\\
\sqrt{-2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 20.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites5.4%
Taylor expanded in B around -inf
lower-*.f64N/A
lift-/.f642.0
Applied rewrites2.0%
herbie shell --seed 2025064
(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))))