
(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}
Herbie found 10 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 (* A C) (pow B_m 2.0))))
(if (<= B_m 450.0)
(/
(-
(sqrt
(* (* 2.0 (* t_0 F)) (/ (fma -0.5 (pow B_m 2.0) (* 2.0 (* A C))) A))))
t_0)
(if (<= B_m 3e+78)
(*
-1.0
(*
(sqrt
(/
(* F (+ A (+ C (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- (pow B_m 2.0) (* 4.0 (* A C)))))
(sqrt 2.0)))
(if (<= B_m 2e+284)
(*
-1.0
(fma
0.5
(* (sqrt (/ F (pow B_m 3.0))) (* C (sqrt 2.0)))
(* (sqrt (/ F B_m)) (sqrt 2.0))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* B_m F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), pow(B_m, 2.0));
double tmp;
if (B_m <= 450.0) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (fma(-0.5, pow(B_m, 2.0), (2.0 * (A * C))) / A))) / t_0;
} else if (B_m <= 3e+78) {
tmp = -1.0 * (sqrt(((F * (A + (C + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (pow(B_m, 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
} else if (B_m <= 2e+284) {
tmp = -1.0 * fma(0.5, (sqrt((F / pow(B_m, 3.0))) * (C * sqrt(2.0))), (sqrt((F / B_m)) * sqrt(2.0)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), (B_m ^ 2.0)) tmp = 0.0 if (B_m <= 450.0) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(fma(-0.5, (B_m ^ 2.0), Float64(2.0 * Float64(A * C))) / A)))) / t_0); elseif (B_m <= 3e+78) tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64((B_m ^ 2.0) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0))); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * fma(0.5, Float64(sqrt(Float64(F / (B_m ^ 3.0))) * Float64(C * sqrt(2.0))), Float64(sqrt(Float64(F / B_m)) * sqrt(2.0)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 450.0], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(-0.5 * N[Power[B$95$m, 2.0], $MachinePrecision] + N[(2.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 3e+78], N[(-1.0 * N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(0.5 * N[(N[Sqrt[N[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\\
\mathbf{if}\;B\_m \leq 450:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \frac{\mathsf{fma}\left(-0.5, {B\_m}^{2}, 2 \cdot \left(A \cdot C\right)\right)}{A}}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{+78}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)\right)}{{B\_m}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \mathsf{fma}\left(0.5, \sqrt{\frac{F}{{B\_m}^{3}}} \cdot \left(C \cdot \sqrt{2}\right), \sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 450Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-/.f64N/A
lower-fma.f64N/A
lift-pow.f64N/A
lower-*.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.7
Applied rewrites26.7%
if 450 < B < 2.99999999999999982e78Initial program 19.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites18.1%
if 2.99999999999999982e78 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lift-sqrt.f6425.7
Applied rewrites25.7%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.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 (- (pow B_m 2.0) (* (* 4.0 A) C))))
(if (<= B_m 450.0)
(/
(- (sqrt (* (* 2.0 (* t_0 F)) (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C)))))
t_0)
(if (<= B_m 3e+78)
(*
-1.0
(*
(sqrt
(/
(* F (+ A (+ C (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- (pow B_m 2.0) (* 4.0 (* A C)))))
(sqrt 2.0)))
(if (<= B_m 2e+284)
(*
-1.0
(fma
0.5
(* (sqrt (/ F (pow B_m 3.0))) (* C (sqrt 2.0)))
(* (sqrt (/ F B_m)) (sqrt 2.0))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* B_m F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = pow(B_m, 2.0) - ((4.0 * A) * C);
double tmp;
if (B_m <= 450.0) {
tmp = -sqrt(((2.0 * (t_0 * F)) * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))) / t_0;
} else if (B_m <= 3e+78) {
tmp = -1.0 * (sqrt(((F * (A + (C + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (pow(B_m, 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
} else if (B_m <= 2e+284) {
tmp = -1.0 * fma(0.5, (sqrt((F / pow(B_m, 3.0))) * (C * sqrt(2.0))), (sqrt((F / B_m)) * sqrt(2.0)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if (B_m <= 450.0) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C))))) / t_0); elseif (B_m <= 3e+78) tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64((B_m ^ 2.0) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0))); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * fma(0.5, Float64(sqrt(Float64(F / (B_m ^ 3.0))) * Float64(C * sqrt(2.0))), Float64(sqrt(Float64(F / B_m)) * sqrt(2.0)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 450.0], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 3e+78], N[(-1.0 * N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(0.5 * N[(N[Sqrt[N[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 450:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{+78}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)\right)}{{B\_m}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \mathsf{fma}\left(0.5, \sqrt{\frac{F}{{B\_m}^{3}}} \cdot \left(C \cdot \sqrt{2}\right), \sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 450Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
if 450 < B < 2.99999999999999982e78Initial program 19.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites18.1%
if 2.99999999999999982e78 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lift-sqrt.f6425.7
Applied rewrites25.7%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (pow B_m 2.0))))
(if (<= B_m 6.2e+65)
(/ (- (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 C)))) t_0)
(if (<= B_m 2e+284)
(*
-1.0
(fma
0.5
(* (sqrt (/ F (pow B_m 3.0))) (* C (sqrt 2.0)))
(* (sqrt (/ F B_m)) (sqrt 2.0))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* B_m F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (A * C), pow(B_m, 2.0));
double tmp;
if (B_m <= 6.2e+65) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
} else if (B_m <= 2e+284) {
tmp = -1.0 * fma(0.5, (sqrt((F / pow(B_m, 3.0))) * (C * sqrt(2.0))), (sqrt((F / B_m)) * sqrt(2.0)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(A * C), (B_m ^ 2.0)) tmp = 0.0 if (B_m <= 6.2e+65) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * fma(0.5, Float64(sqrt(Float64(F / (B_m ^ 3.0))) * Float64(C * sqrt(2.0))), Float64(sqrt(Float64(F / B_m)) * sqrt(2.0)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.2e+65], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(0.5 * N[(N[Sqrt[N[(F / N[Power[B$95$m, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)\\
\mathbf{if}\;B\_m \leq 6.2 \cdot 10^{+65}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \mathsf{fma}\left(0.5, \sqrt{\frac{F}{{B\_m}^{3}}} \cdot \left(C \cdot \sqrt{2}\right), \sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 6.19999999999999981e65Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-/.f64N/A
lower-fma.f64N/A
lift-pow.f64N/A
lower-*.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.7
Applied rewrites26.7%
Taylor expanded in A around inf
lift-*.f6426.7
Applied rewrites26.7%
if 6.19999999999999981e65 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lift-sqrt.f6425.7
Applied rewrites25.7%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m)) (t_1 (* -4.0 (* A C))))
(if (<= B_m 0.000115)
(/
(-
(sqrt
(* (* 2.0 (* t_1 F)) (/ (fma -0.5 (pow B_m 2.0) (* 2.0 (* A C))) A))))
t_1)
(if (<= B_m 8e+109)
(* -1.0 (* t_0 (sqrt (* F (+ C (sqrt (+ (pow B_m 2.0) (pow C 2.0))))))))
(if (<= B_m 2e+284)
(* -1.0 (* (sqrt (/ F B_m)) (sqrt 2.0)))
(* -1.0 (* t_0 (sqrt (* B_m F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(2.0) / B_m;
double t_1 = -4.0 * (A * C);
double tmp;
if (B_m <= 0.000115) {
tmp = -sqrt(((2.0 * (t_1 * F)) * (fma(-0.5, pow(B_m, 2.0), (2.0 * (A * C))) / A))) / t_1;
} else if (B_m <= 8e+109) {
tmp = -1.0 * (t_0 * sqrt((F * (C + sqrt((pow(B_m, 2.0) + pow(C, 2.0)))))));
} else if (B_m <= 2e+284) {
tmp = -1.0 * (sqrt((F / B_m)) * sqrt(2.0));
} else {
tmp = -1.0 * (t_0 * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(sqrt(2.0) / B_m) t_1 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (B_m <= 0.000115) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(fma(-0.5, (B_m ^ 2.0), Float64(2.0 * Float64(A * C))) / A)))) / t_1); elseif (B_m <= 8e+109) tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(F * Float64(C + sqrt(Float64((B_m ^ 2.0) + (C ^ 2.0)))))))); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(2.0))); else tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 0.000115], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(-0.5 * N[Power[B$95$m, 2.0], $MachinePrecision] + N[(2.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 8e+109], N[(-1.0 * N[(t$95$0 * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{2}}{B\_m}\\
t_1 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B\_m \leq 0.000115:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \frac{\mathsf{fma}\left(-0.5, {B\_m}^{2}, 2 \cdot \left(A \cdot C\right)\right)}{A}}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{+109}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \sqrt{F \cdot \left(C + \sqrt{{B\_m}^{2} + {C}^{2}}\right)}\right)\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 1.15e-4Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-/.f64N/A
lower-fma.f64N/A
lift-pow.f64N/A
lower-*.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.6
Applied rewrites26.6%
Taylor expanded in A around 0
lower-fma.f64N/A
lift-*.f64N/A
lift-pow.f6426.7
Applied rewrites26.7%
Taylor expanded in A around inf
lower-*.f64N/A
lift-*.f6425.5
Applied rewrites25.5%
Taylor expanded in A around inf
lower-*.f64N/A
lift-*.f6423.1
Applied rewrites23.1%
if 1.15e-4 < B < 7.99999999999999985e109Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
if 7.99999999999999985e109 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m)) (t_1 (* -4.0 (* A C))))
(if (<= B_m 0.000115)
(/
(- (sqrt (* (* 2.0 (* t_1 F)) (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C)))))
t_1)
(if (<= B_m 8e+109)
(* -1.0 (* t_0 (sqrt (* F (+ C (sqrt (+ (pow B_m 2.0) (pow C 2.0))))))))
(if (<= B_m 2e+284)
(* -1.0 (* (sqrt (/ F B_m)) (sqrt 2.0)))
(* -1.0 (* t_0 (sqrt (* B_m F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(2.0) / B_m;
double t_1 = -4.0 * (A * C);
double tmp;
if (B_m <= 0.000115) {
tmp = -sqrt(((2.0 * (t_1 * F)) * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))) / t_1;
} else if (B_m <= 8e+109) {
tmp = -1.0 * (t_0 * sqrt((F * (C + sqrt((pow(B_m, 2.0) + pow(C, 2.0)))))));
} else if (B_m <= 2e+284) {
tmp = -1.0 * (sqrt((F / B_m)) * sqrt(2.0));
} else {
tmp = -1.0 * (t_0 * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(sqrt(2.0) / B_m) t_1 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (B_m <= 0.000115) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C))))) / t_1); elseif (B_m <= 8e+109) tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(F * Float64(C + sqrt(Float64((B_m ^ 2.0) + (C ^ 2.0)))))))); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(2.0))); else tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 0.000115], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 8e+109], N[(-1.0 * N[(t$95$0 * N[Sqrt[N[(F * N[(C + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[C, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{2}}{B\_m}\\
t_1 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B\_m \leq 0.000115:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{+109}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \sqrt{F \cdot \left(C + \sqrt{{B\_m}^{2} + {C}^{2}}\right)}\right)\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 1.15e-4Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6425.4
Applied rewrites25.4%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
if 1.15e-4 < B < 7.99999999999999985e109Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
if 7.99999999999999985e109 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))))
(if (<= B_m 0.000115)
(/
(- (sqrt (* (* 2.0 (* t_0 F)) (fma -0.5 (/ (pow B_m 2.0) A) (* 2.0 C)))))
t_0)
(if (<= B_m 2e+284)
(* -1.0 (* (sqrt (/ F B_m)) (sqrt 2.0)))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* B_m F))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = -4.0 * (A * C);
double tmp;
if (B_m <= 0.000115) {
tmp = -sqrt(((2.0 * (t_0 * F)) * fma(-0.5, (pow(B_m, 2.0) / A), (2.0 * C)))) / t_0;
} else if (B_m <= 2e+284) {
tmp = -1.0 * (sqrt((F / B_m)) * sqrt(2.0));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (B_m <= 0.000115) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * fma(-0.5, Float64((B_m ^ 2.0) / A), Float64(2.0 * C))))) / t_0); elseif (B_m <= 2e+284) tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(2.0))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(B_m * F)))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 0.000115], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 2e+284], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;B\_m \leq 0.000115:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \mathsf{fma}\left(-0.5, \frac{{B\_m}^{2}}{A}, 2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 2 \cdot 10^{+284}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{B\_m \cdot F}\right)\\
\end{array}
\end{array}
if B < 1.15e-4Initial program 19.2%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
lift-pow.f64N/A
lower-*.f6426.6
Applied rewrites26.6%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6425.4
Applied rewrites25.4%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
if 1.15e-4 < B < 2.00000000000000016e284Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
if 2.00000000000000016e284 < B Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* -4.0 (* A C))))
(if (<= F 7.5e-307)
(/
(- (sqrt (* (* 2.0 (* t_0 F)) (+ C (* C (+ 1.0 (* -1.0 (/ A C))))))))
t_0)
(if (<= F 4.9e+68)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ B_m C)))))
(* -1.0 (* (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) {
double t_0 = -4.0 * (A * C);
double tmp;
if (F <= 7.5e-307) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (C + (C * (1.0 + (-1.0 * (A / C))))))) / t_0;
} else if (F <= 4.9e+68) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (B_m + C))));
} else {
tmp = -1.0 * (sqrt((F / 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) :: t_0
real(8) :: tmp
t_0 = (-4.0d0) * (a * c)
if (f <= 7.5d-307) then
tmp = -sqrt(((2.0d0 * (t_0 * f)) * (c + (c * (1.0d0 + ((-1.0d0) * (a / c))))))) / t_0
else if (f <= 4.9d+68) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((f * (b_m + c))))
else
tmp = (-1.0d0) * (sqrt((f / 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 t_0 = -4.0 * (A * C);
double tmp;
if (F <= 7.5e-307) {
tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (C + (C * (1.0 + (-1.0 * (A / C))))))) / t_0;
} else if (F <= 4.9e+68) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (B_m + C))));
} else {
tmp = -1.0 * (Math.sqrt((F / 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): t_0 = -4.0 * (A * C) tmp = 0 if F <= 7.5e-307: tmp = -math.sqrt(((2.0 * (t_0 * F)) * (C + (C * (1.0 + (-1.0 * (A / C))))))) / t_0 elif F <= 4.9e+68: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (B_m + C)))) else: tmp = -1.0 * (math.sqrt((F / 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) t_0 = Float64(-4.0 * Float64(A * C)) tmp = 0.0 if (F <= 7.5e-307) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(C + Float64(C * Float64(1.0 + Float64(-1.0 * Float64(A / C)))))))) / t_0); elseif (F <= 4.9e+68) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(B_m + C))))); else tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * 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)
t_0 = -4.0 * (A * C);
tmp = 0.0;
if (F <= 7.5e-307)
tmp = -sqrt(((2.0 * (t_0 * F)) * (C + (C * (1.0 + (-1.0 * (A / C))))))) / t_0;
elseif (F <= 4.9e+68)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (B_m + C))));
else
tmp = -1.0 * (sqrt((F / 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_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[F, 7.5e-307], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(C + N[(C * N[(1.0 + N[(-1.0 * N[(A / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[F, 4.9e+68], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(B$95$m + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
\mathbf{if}\;F \leq 7.5 \cdot 10^{-307}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(C + C \cdot \left(1 + -1 \cdot \frac{A}{C}\right)\right)}}{t\_0}\\
\mathbf{elif}\;F \leq 4.9 \cdot 10^{+68}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(B\_m + C\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if F < 7.5000000000000006e-307Initial program 19.2%
Taylor expanded in A around 0
Applied rewrites18.6%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f648.3
Applied rewrites8.3%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f648.3
Applied rewrites8.3%
Taylor expanded in C around inf
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f6411.9
Applied rewrites11.9%
if 7.5000000000000006e-307 < F < 4.89999999999999978e68Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in C around 0
lower-+.f6427.0
Applied rewrites27.0%
if 4.89999999999999978e68 < F Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.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 (<= F 4.9e+68) (* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ B_m C))))) (* -1.0 (* (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) {
double tmp;
if (F <= 4.9e+68) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (B_m + C))));
} else {
tmp = -1.0 * (sqrt((F / 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 (f <= 4.9d+68) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((f * (b_m + c))))
else
tmp = (-1.0d0) * (sqrt((f / 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 (F <= 4.9e+68) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (B_m + C))));
} else {
tmp = -1.0 * (Math.sqrt((F / 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 F <= 4.9e+68: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (B_m + C)))) else: tmp = -1.0 * (math.sqrt((F / 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 (F <= 4.9e+68) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(B_m + C))))); else tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * 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 (F <= 4.9e+68)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (B_m + C))));
else
tmp = -1.0 * (sqrt((F / 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[F, 4.9e+68], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(B$95$m + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 4.9 \cdot 10^{+68}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(B\_m + C\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if F < 4.89999999999999978e68Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in C around 0
lower-+.f6427.0
Applied rewrites27.0%
if 4.89999999999999978e68 < F Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.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 (<= F 4e-18) (* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* B_m F)))) (* -1.0 (* (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) {
double tmp;
if (F <= 4e-18) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
} else {
tmp = -1.0 * (sqrt((F / 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 (f <= 4d-18) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((b_m * f)))
else
tmp = (-1.0d0) * (sqrt((f / 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 (F <= 4e-18) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((B_m * F)));
} else {
tmp = -1.0 * (Math.sqrt((F / 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 F <= 4e-18: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((B_m * F))) else: tmp = -1.0 * (math.sqrt((F / 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 (F <= 4e-18) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(B_m * F)))); else tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * 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 (F <= 4e-18)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((B_m * F)));
else
tmp = -1.0 * (sqrt((F / 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[F, 4e-18], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq 4 \cdot 10^{-18}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{B\_m \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if F < 4.0000000000000003e-18Initial program 19.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lift-pow.f64N/A
lower-pow.f6417.4
Applied rewrites17.4%
Taylor expanded in B around inf
lower-*.f6426.7
Applied rewrites26.7%
if 4.0000000000000003e-18 < F Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.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 (* -1.0 (* (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 -1.0 * (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 = (-1.0d0) * (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 -1.0 * (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 -1.0 * (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(-1.0 * Float64(sqrt(Float64(F / B_m)) * 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 = -1.0 * (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[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)
\end{array}
Initial program 19.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6427.3
Applied rewrites27.3%
herbie shell --seed 2025132
(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))))