
(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 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 9.2e-41)
(/
(sqrt (* (* t_0 2.0) (* 2.0 (* A F))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 4.8e+46)
(- (sqrt (* (/ (- (+ C A) (hypot (- A C) B_m)) t_0) (* F 2.0))))
(if (<= B_m 9e+226)
(/ (sqrt (* (* (- A (hypot B_m A)) F) 2.0)) (- B_m))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) 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 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (B_m <= 9.2e-41) {
tmp = sqrt(((t_0 * 2.0) * (2.0 * (A * F)))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else if (B_m <= 4.8e+46) {
tmp = -sqrt(((((C + A) - hypot((A - C), B_m)) / t_0) * (F * 2.0)));
} else if (B_m <= 9e+226) {
tmp = sqrt((((A - hypot(B_m, A)) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / 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 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 9.2e-41) tmp = Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(2.0 * Float64(A * F)))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); elseif (B_m <= 4.8e+46) tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0) * Float64(F * 2.0)))); elseif (B_m <= 9e+226) tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(B_m, A)) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 9.2e-41], N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 4.8e+46], (-N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 9e+226], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $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 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 9.2 \cdot 10^{-41}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(2 \cdot \left(A \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{elif}\;B\_m \leq 4.8 \cdot 10^{+46}:\\
\;\;\;\;-\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0} \cdot \left(F \cdot 2\right)}\\
\mathbf{elif}\;B\_m \leq 9 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 9.20000000000000041e-41Initial program 18.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6423.6
Applied rewrites23.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites23.8%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f6424.8
Applied rewrites24.8%
if 9.20000000000000041e-41 < B < 4.80000000000000017e46Initial program 41.1%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites54.6%
Applied rewrites54.8%
if 4.80000000000000017e46 < B < 8.99999999999999978e226Initial program 13.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.7
Applied rewrites3.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.6
Applied rewrites47.6%
Applied rewrites47.7%
if 8.99999999999999978e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites57.9%
Final simplification31.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1))))
(if (<= t_2 -5e+56)
(/ (sqrt (* (* 4.0 A) F)) (- (sqrt (fma -4.0 (* C A) (* B_m B_m)))))
(if (<= t_2 -1e-210)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- B_m))))
(if (<= t_2 0.0)
(* (sqrt (* -0.5 (/ F C))) t_0)
(if (<= t_2 INFINITY)
(/
(sqrt (* -16.0 (* (* A A) (* C F))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) B_m))) t_0)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double tmp;
if (t_2 <= -5e+56) {
tmp = sqrt(((4.0 * A) * F)) / -sqrt(fma(-4.0, (C * A), (B_m * B_m)));
} else if (t_2 <= -1e-210) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * -B_m));
} else if (t_2 <= 0.0) {
tmp = sqrt((-0.5 * (F / C))) * t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / B_m))) * t_0;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-sqrt(2.0)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) tmp = 0.0 if (t_2 <= -5e+56) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-sqrt(fma(-4.0, Float64(C * A), Float64(B_m * B_m))))); elseif (t_2 <= -1e-210) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(-B_m)))); elseif (t_2 <= 0.0) tmp = Float64(sqrt(Float64(-0.5 * Float64(F / C))) * t_0); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / B_m))) * t_0); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+56], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-210], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * (-B$95$m)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $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{2}\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+56}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-210}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(-B\_m\right)}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{C}} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot t\_0\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000024e56Initial program 26.6%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites63.1%
Applied rewrites61.6%
Taylor expanded in A around -inf
Applied rewrites38.3%
if -5.00000000000000024e56 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-210Initial program 99.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6421.0
Applied rewrites21.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites21.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.1
Applied rewrites48.1%
Taylor expanded in A around 0
Applied rewrites44.1%
if -1e-210 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 0.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in A around -inf
Applied rewrites21.8%
if 0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 44.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6450.0
Applied rewrites50.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites46.7%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6446.7
Applied rewrites46.7%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.0
Applied rewrites32.0%
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 F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in B around inf
Applied rewrites18.5%
Final simplification27.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 (- (sqrt 2.0)))
(t_1 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_2
(/
(sqrt
(*
(* 2.0 (* t_1 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_1))))
(if (<= t_2 -5e+56)
(/ (sqrt (* (* 4.0 A) F)) (- (sqrt (fma -4.0 (* C A) (* B_m B_m)))))
(if (<= t_2 -1e-210)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- B_m))))
(if (<= t_2 0.0)
(* (sqrt (* -0.5 (/ F C))) t_0)
(if (<= t_2 INFINITY)
(/
(sqrt (* -16.0 (* (* A A) (* C F))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (/ F (- B_m))) t_0)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double t_1 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_2 = sqrt(((2.0 * (t_1 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_1;
double tmp;
if (t_2 <= -5e+56) {
tmp = sqrt(((4.0 * A) * F)) / -sqrt(fma(-4.0, (C * A), (B_m * B_m)));
} else if (t_2 <= -1e-210) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * -B_m));
} else if (t_2 <= 0.0) {
tmp = sqrt((-0.5 * (F / C))) * t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else {
tmp = sqrt((F / -B_m)) * t_0;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-sqrt(2.0)) t_1 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_1)) tmp = 0.0 if (t_2 <= -5e+56) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-sqrt(fma(-4.0, Float64(C * A), Float64(B_m * B_m))))); elseif (t_2 <= -1e-210) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(-B_m)))); elseif (t_2 <= 0.0) tmp = Float64(sqrt(Float64(-0.5 * Float64(F / C))) * t_0); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); else tmp = Float64(sqrt(Float64(F / Float64(-B_m))) * t_0); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+56], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -1e-210], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * (-B$95$m)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F / (-B$95$m)), $MachinePrecision]], $MachinePrecision] * t$95$0), $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{2}\\
t_1 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_1}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+56}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-210}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(-B\_m\right)}\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{C}} \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{F}{-B\_m}} \cdot t\_0\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000024e56Initial program 26.6%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites63.1%
Applied rewrites61.6%
Taylor expanded in A around -inf
Applied rewrites38.3%
if -5.00000000000000024e56 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-210Initial program 99.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6421.0
Applied rewrites21.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites21.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.1
Applied rewrites48.1%
Taylor expanded in A around 0
Applied rewrites44.1%
if -1e-210 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 0.0Initial program 3.3%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in A around -inf
Applied rewrites21.8%
if 0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 44.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6450.0
Applied rewrites50.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites46.7%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6446.7
Applied rewrites46.7%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6432.0
Applied rewrites32.0%
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 F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in B around inf
Applied rewrites17.3%
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
(let* ((t_0 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_1
(/
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_0))))
(if (<= t_1 -5e+56)
(/ (sqrt (* (* 4.0 A) F)) (- (sqrt (fma -4.0 (* C A) (* B_m B_m)))))
(if (<= t_1 -1e-210)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- B_m))))
(if (<= t_1 INFINITY)
(/
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) B_m))) (- (sqrt 2.0))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_1 = sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_0;
double tmp;
if (t_1 <= -5e+56) {
tmp = sqrt(((4.0 * A) * F)) / -sqrt(fma(-4.0, (C * A), (B_m * B_m)));
} else if (t_1 <= -1e-210) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * -B_m));
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / B_m))) * -sqrt(2.0);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_0)) tmp = 0.0 if (t_1 <= -5e+56) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-sqrt(fma(-4.0, Float64(C * A), Float64(B_m * B_m))))); elseif (t_1 <= -1e-210) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(-B_m)))); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / B_m))) * Float64(-sqrt(2.0))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+56], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$1, -1e-210], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * (-B$95$m)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_0}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+56}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-210}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(-B\_m\right)}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{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))) < -5.00000000000000024e56Initial program 26.6%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites63.1%
Applied rewrites61.6%
Taylor expanded in A around -inf
Applied rewrites38.3%
if -5.00000000000000024e56 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-210Initial program 99.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6421.0
Applied rewrites21.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites21.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.1
Applied rewrites48.1%
Taylor expanded in A around 0
Applied rewrites44.1%
if -1e-210 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 20.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6440.8
Applied rewrites40.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites39.3%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6439.3
Applied rewrites39.3%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-*.f6434.6
Applied rewrites34.6%
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 F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in B around inf
Applied rewrites18.5%
Final simplification29.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 1e-40)
(/
(sqrt (* (* (fma -4.0 (* C A) (* B_m B_m)) 2.0) (* 2.0 (* A F))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 4.8e+46)
(-
(sqrt
(*
(- (+ A C) (hypot (- A C) B_m))
(/ (* F 2.0) (fma (* C -4.0) A (* B_m B_m))))))
(if (<= B_m 9e+226)
(/ (sqrt (* (* (- A (hypot B_m A)) F) 2.0)) (- B_m))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) 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 <= 1e-40) {
tmp = sqrt(((fma(-4.0, (C * A), (B_m * B_m)) * 2.0) * (2.0 * (A * F)))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else if (B_m <= 4.8e+46) {
tmp = -sqrt((((A + C) - hypot((A - C), B_m)) * ((F * 2.0) / fma((C * -4.0), A, (B_m * B_m)))));
} else if (B_m <= 9e+226) {
tmp = sqrt((((A - hypot(B_m, A)) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / 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 <= 1e-40) tmp = Float64(sqrt(Float64(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0) * Float64(2.0 * Float64(A * F)))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); elseif (B_m <= 4.8e+46) tmp = Float64(-sqrt(Float64(Float64(Float64(A + C) - hypot(Float64(A - C), B_m)) * Float64(Float64(F * 2.0) / fma(Float64(C * -4.0), A, Float64(B_m * B_m)))))); elseif (B_m <= 9e+226) tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(B_m, A)) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / 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, 1e-40], N[(N[Sqrt[N[(N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 4.8e+46], (-N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] / N[(N[(C * -4.0), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[B$95$m, 9e+226], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $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 10^{-40}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right) \cdot \left(2 \cdot \left(A \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{elif}\;B\_m \leq 4.8 \cdot 10^{+46}:\\
\;\;\;\;-\sqrt{\left(\left(A + C\right) - \mathsf{hypot}\left(A - C, B\_m\right)\right) \cdot \frac{F \cdot 2}{\mathsf{fma}\left(C \cdot -4, A, B\_m \cdot B\_m\right)}}\\
\mathbf{elif}\;B\_m \leq 9 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 9.9999999999999993e-41Initial program 18.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6423.6
Applied rewrites23.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites23.8%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6423.8
Applied rewrites23.8%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f6424.8
Applied rewrites24.8%
if 9.9999999999999993e-41 < B < 4.80000000000000017e46Initial program 41.1%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites54.6%
Applied rewrites47.3%
Applied rewrites48.3%
if 4.80000000000000017e46 < B < 8.99999999999999978e226Initial program 13.2%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.7
Applied rewrites3.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.6
Applied rewrites47.6%
Applied rewrites47.7%
if 8.99999999999999978e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites57.9%
Final simplification31.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 8.8e+73)
(/
(sqrt
(*
(* (fma -4.0 (* C A) (* B_m B_m)) 2.0)
(* F (fma (* -0.5 B_m) (/ B_m C) (+ A A)))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 9e+226)
(/ (sqrt (* (* (- A (hypot B_m A)) F) 2.0)) (- B_m))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) 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 <= 8.8e+73) {
tmp = sqrt(((fma(-4.0, (C * A), (B_m * B_m)) * 2.0) * (F * fma((-0.5 * B_m), (B_m / C), (A + A))))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else if (B_m <= 9e+226) {
tmp = sqrt((((A - hypot(B_m, A)) * F) * 2.0)) / -B_m;
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / 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 <= 8.8e+73) tmp = Float64(sqrt(Float64(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0) * Float64(F * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A))))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); elseif (B_m <= 9e+226) tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(B_m, A)) * F) * 2.0)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / 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, 8.8e+73], N[(N[Sqrt[N[(N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * N[(F * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 9e+226], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $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 8.8 \cdot 10^{+73}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{elif}\;B\_m \leq 9 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 8.8e73Initial program 20.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6422.3
Applied rewrites22.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites22.4%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6422.4
Applied rewrites22.4%
Applied rewrites22.4%
if 8.8e73 < B < 8.99999999999999978e226Initial program 10.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.8
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.3
Applied rewrites47.3%
Applied rewrites47.4%
if 8.99999999999999978e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites57.9%
Final simplification28.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
(if (<= B_m 1.05e+74)
(/
(sqrt
(*
(* (fma -4.0 (* C A) (* B_m B_m)) 2.0)
(* F (fma (* -0.5 B_m) (/ B_m C) (+ A A)))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 2.7e+226)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- A B_m))))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) 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.05e+74) {
tmp = sqrt(((fma(-4.0, (C * A), (B_m * B_m)) * 2.0) * (F * fma((-0.5 * B_m), (B_m / C), (A + A))))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else if (B_m <= 2.7e+226) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (A - B_m)));
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / 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 <= 1.05e+74) tmp = Float64(sqrt(Float64(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0) * Float64(F * fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A))))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); elseif (B_m <= 2.7e+226) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(A - B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / 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, 1.05e+74], N[(N[Sqrt[N[(N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * N[(F * N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 2.7e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $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.05 \cdot 10^{+74}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right) \cdot \left(F \cdot \mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{elif}\;B\_m \leq 2.7 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(A - B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 1.0499999999999999e74Initial program 20.7%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6422.3
Applied rewrites22.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites22.4%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6422.4
Applied rewrites22.4%
Applied rewrites22.4%
if 1.0499999999999999e74 < B < 2.7000000000000003e226Initial program 10.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.8
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.3
Applied rewrites47.3%
Taylor expanded in A around 0
Applied rewrites36.4%
if 2.7000000000000003e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites57.9%
Final simplification26.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 5e+64)
(/
(sqrt (* (* (fma -4.0 (* C A) (* B_m B_m)) 2.0) (* 2.0 (* A F))))
(- (fma B_m B_m (* -4.0 (* A C)))))
(if (<= B_m 2.7e+226)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- A B_m))))
(* (sqrt (* F (/ (- (/ (+ A C) B_m) 1.0) 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 <= 5e+64) {
tmp = sqrt(((fma(-4.0, (C * A), (B_m * B_m)) * 2.0) * (2.0 * (A * F)))) / -fma(B_m, B_m, (-4.0 * (A * C)));
} else if (B_m <= 2.7e+226) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (A - B_m)));
} else {
tmp = sqrt((F * ((((A + C) / B_m) - 1.0) / 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 <= 5e+64) tmp = Float64(sqrt(Float64(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * 2.0) * Float64(2.0 * Float64(A * F)))) / Float64(-fma(B_m, B_m, Float64(-4.0 * Float64(A * C))))); elseif (B_m <= 2.7e+226) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(A - B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A + C) / B_m) - 1.0) / 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, 5e+64], N[(N[Sqrt[N[(N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] * N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 2.7e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $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 \cdot 10^{+64}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot 2\right) \cdot \left(2 \cdot \left(A \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}\\
\mathbf{elif}\;B\_m \leq 2.7 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(A - B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot \frac{\frac{A + C}{B\_m} - 1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if B < 5e64Initial program 20.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f6422.3
Applied rewrites22.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites22.5%
Taylor expanded in B around 0
fp-cancel-sub-sign-invN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6422.5
Applied rewrites22.5%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
if 5e64 < B < 2.7000000000000003e226Initial program 10.5%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.7
Applied rewrites3.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6446.0
Applied rewrites46.0%
Taylor expanded in A around 0
Applied rewrites35.2%
if 2.7000000000000003e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites57.9%
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
(let* ((t_0 (- (sqrt 2.0))))
(if (<= B_m 1.02e+74)
(* (sqrt (* -0.5 (/ F C))) t_0)
(if (<= B_m 2.7e+226)
(* (/ (sqrt 2.0) (- B_m)) (sqrt (* F (- A B_m))))
(* (sqrt (/ F (- B_m))) t_0)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double tmp;
if (B_m <= 1.02e+74) {
tmp = sqrt((-0.5 * (F / C))) * t_0;
} else if (B_m <= 2.7e+226) {
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (A - B_m)));
} else {
tmp = sqrt((F / -B_m)) * t_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) :: t_0
real(8) :: tmp
t_0 = -sqrt(2.0d0)
if (b_m <= 1.02d+74) then
tmp = sqrt(((-0.5d0) * (f / c))) * t_0
else if (b_m <= 2.7d+226) then
tmp = (sqrt(2.0d0) / -b_m) * sqrt((f * (a - b_m)))
else
tmp = sqrt((f / -b_m)) * t_0
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 t_0 = -Math.sqrt(2.0);
double tmp;
if (B_m <= 1.02e+74) {
tmp = Math.sqrt((-0.5 * (F / C))) * t_0;
} else if (B_m <= 2.7e+226) {
tmp = (Math.sqrt(2.0) / -B_m) * Math.sqrt((F * (A - B_m)));
} else {
tmp = Math.sqrt((F / -B_m)) * t_0;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -math.sqrt(2.0) tmp = 0 if B_m <= 1.02e+74: tmp = math.sqrt((-0.5 * (F / C))) * t_0 elif B_m <= 2.7e+226: tmp = (math.sqrt(2.0) / -B_m) * math.sqrt((F * (A - B_m))) else: tmp = math.sqrt((F / -B_m)) * t_0 return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 1.02e+74) tmp = Float64(sqrt(Float64(-0.5 * Float64(F / C))) * t_0); elseif (B_m <= 2.7e+226) tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(F * Float64(A - B_m)))); else tmp = Float64(sqrt(Float64(F / Float64(-B_m))) * t_0); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = -sqrt(2.0);
tmp = 0.0;
if (B_m <= 1.02e+74)
tmp = sqrt((-0.5 * (F / C))) * t_0;
elseif (B_m <= 2.7e+226)
tmp = (sqrt(2.0) / -B_m) * sqrt((F * (A - B_m)));
else
tmp = sqrt((F / -B_m)) * t_0;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 1.02e+74], N[(N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 2.7e+226], N[(N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F / (-B$95$m)), $MachinePrecision]], $MachinePrecision] * t$95$0), $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{2}\\
\mathbf{if}\;B\_m \leq 1.02 \cdot 10^{+74}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{C}} \cdot t\_0\\
\mathbf{elif}\;B\_m \leq 2.7 \cdot 10^{+226}:\\
\;\;\;\;\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{F \cdot \left(A - B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{F}{-B\_m}} \cdot t\_0\\
\end{array}
\end{array}
if B < 1.02000000000000005e74Initial program 20.7%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites23.5%
Taylor expanded in A around -inf
Applied rewrites14.5%
if 1.02000000000000005e74 < B < 2.7000000000000003e226Initial program 10.8%
Taylor expanded in C around inf
mul-1-negN/A
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-neg.f643.8
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.3
Applied rewrites47.3%
Taylor expanded in A around 0
Applied rewrites36.4%
if 2.7000000000000003e226 < B Initial program 0.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites4.8%
Taylor expanded in B around inf
Applied rewrites55.2%
Final simplification20.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (sqrt 2.0))))
(if (<= B_m 2.9e+131)
(* (sqrt (* -0.5 (/ F C))) t_0)
(* (sqrt (/ F (- B_m))) t_0))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -sqrt(2.0);
double tmp;
if (B_m <= 2.9e+131) {
tmp = sqrt((-0.5 * (F / C))) * t_0;
} else {
tmp = sqrt((F / -B_m)) * t_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) :: t_0
real(8) :: tmp
t_0 = -sqrt(2.0d0)
if (b_m <= 2.9d+131) then
tmp = sqrt(((-0.5d0) * (f / c))) * t_0
else
tmp = sqrt((f / -b_m)) * t_0
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 t_0 = -Math.sqrt(2.0);
double tmp;
if (B_m <= 2.9e+131) {
tmp = Math.sqrt((-0.5 * (F / C))) * t_0;
} else {
tmp = Math.sqrt((F / -B_m)) * t_0;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = -math.sqrt(2.0) tmp = 0 if B_m <= 2.9e+131: tmp = math.sqrt((-0.5 * (F / C))) * t_0 else: tmp = math.sqrt((F / -B_m)) * t_0 return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-sqrt(2.0)) tmp = 0.0 if (B_m <= 2.9e+131) tmp = Float64(sqrt(Float64(-0.5 * Float64(F / C))) * t_0); else tmp = Float64(sqrt(Float64(F / Float64(-B_m))) * t_0); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = -sqrt(2.0);
tmp = 0.0;
if (B_m <= 2.9e+131)
tmp = sqrt((-0.5 * (F / C))) * t_0;
else
tmp = sqrt((F / -B_m)) * t_0;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 2.9e+131], N[(N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[Sqrt[N[(F / (-B$95$m)), $MachinePrecision]], $MachinePrecision] * t$95$0), $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{2}\\
\mathbf{if}\;B\_m \leq 2.9 \cdot 10^{+131}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{C}} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{F}{-B\_m}} \cdot t\_0\\
\end{array}
\end{array}
if B < 2.9000000000000001e131Initial program 20.5%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites24.9%
Taylor expanded in A around -inf
Applied rewrites13.7%
if 2.9000000000000001e131 < B Initial program 3.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites12.4%
Taylor expanded in B around inf
Applied rewrites50.4%
Final simplification18.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* (/ F (sqrt (* B_m B_m))) 2.0)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt(((F / sqrt((B_m * B_m))) * 2.0));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((f / sqrt((b_m * b_m))) * 2.0d0))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt(((F / Math.sqrt((B_m * B_m))) * 2.0));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt(((F / math.sqrt((B_m * B_m))) * 2.0))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(Float64(F / sqrt(Float64(B_m * B_m))) * 2.0)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt(((F / sqrt((B_m * B_m))) * 2.0));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(F / N[Sqrt[N[(B$95$m * B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{F}{\sqrt{B\_m \cdot B\_m}} \cdot 2}
\end{array}
Initial program 18.0%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.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 (* (sqrt (/ F (- 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) {
return sqrt((F / -B_m)) * -sqrt(2.0);
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((f / -b_m)) * -sqrt(2.0d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((F / -B_m)) * -Math.sqrt(2.0);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((F / -B_m)) * -math.sqrt(2.0)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(F / Float64(-B_m))) * Float64(-sqrt(2.0))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((F / -B_m)) * -sqrt(2.0);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(F / (-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])\\
\\
\sqrt{\frac{F}{-B\_m}} \cdot \left(-\sqrt{2}\right)
\end{array}
Initial program 18.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites23.2%
Taylor expanded in B around inf
Applied rewrites11.6%
Final simplification11.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (/ (fma F B_m (* B_m F)) (* B_m 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((fma(F, B_m, (B_m * F)) / (B_m * 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(fma(F, B_m, Float64(B_m * F)) / Float64(B_m * B_m))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(N[(F * B$95$m + N[(B$95$m * F), $MachinePrecision]), $MachinePrecision] / N[(B$95$m * 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{\frac{\mathsf{fma}\left(F, B\_m, B\_m \cdot F\right)}{B\_m \cdot B\_m}}
\end{array}
Initial program 18.0%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* F (/ 2.0 B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((F * (2.0 / B_m)));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((f * (2.0d0 / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((F * (2.0 / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((F * (2.0 / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(F * Float64(2.0 / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((F * (2.0 / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{F \cdot \frac{2}{B\_m}}
\end{array}
Initial program 18.0%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.1
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
Applied rewrites2.1%
herbie shell --seed 2024351
(FPCore (A B C F)
:name "ABCF->ab-angle b"
: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))))