
(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 18 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 (* C A) -4.0 (* B_m B_m)) 2.0))
(t_1 (- (sqrt F)))
(t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_3
(/
(sqrt
(*
(* 2.0 (* t_2 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_2)))
(t_4 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= t_3 -2e-203)
(* (* (sqrt t_0) t_1) (/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) t_4))
(if (<= t_3 0.0)
(/
(* (sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)) t_0)) t_1)
(* C (- (/ (* B_m B_m) C) (* 4.0 A))))
(if (<= t_3 INFINITY)
(*
(- (sqrt (* (* 2.0 F) t_4)))
(/ (sqrt (+ (* C (fma 0.0 (/ A C) 1.0)) C)) t_4))
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m)) * 2.0;
double t_1 = -sqrt(F);
double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
double t_4 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (t_3 <= -2e-203) {
tmp = (sqrt(t_0) * t_1) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / t_4);
} else if (t_3 <= 0.0) {
tmp = (sqrt((fma(-0.5, ((B_m * B_m) / A), (C * 2.0)) * t_0)) * t_1) / (C * (((B_m * B_m) / C) - (4.0 * A)));
} else if (t_3 <= ((double) INFINITY)) {
tmp = -sqrt(((2.0 * F) * t_4)) * (sqrt(((C * fma(0.0, (A / C), 1.0)) + C)) / t_4);
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(fma(Float64(C * A), -4.0, Float64(B_m * B_m)) * 2.0) t_1 = Float64(-sqrt(F)) t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2)) t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (t_3 <= -2e-203) tmp = Float64(Float64(sqrt(t_0) * t_1) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / t_4)); elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) * t_0)) * t_1) / Float64(C * Float64(Float64(Float64(B_m * B_m) / C) - Float64(4.0 * A)))); elseif (t_3 <= Inf) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_4))) * Float64(sqrt(Float64(Float64(C * fma(0.0, Float64(A / C), 1.0)) + C)) / t_4)); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[F], $MachinePrecision])}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e-203], N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision] / N[(C * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C * N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right) \cdot 2\\
t_1 := -\sqrt{F}\\
t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(t\_2 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_2}\\
t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{-203}:\\
\;\;\;\;\left(\sqrt{t\_0} \cdot t\_1\right) \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{t\_4}\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right) \cdot t\_0} \cdot t\_1}{C \cdot \left(\frac{B\_m \cdot B\_m}{C} - 4 \cdot A\right)}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_4}\right) \cdot \frac{\sqrt{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right) + C}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000001e-203Initial program 34.3%
Applied rewrites62.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lift-fma.f64N/A
+-commutativeN/A
fp-cancel-sign-sub-invN/A
lift-*.f64N/A
pow2N/A
lift-pow.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
*-commutativeN/A
lift-*.f64N/A
Applied rewrites76.5%
if -2.0000000000000001e-203 < (/.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.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites26.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.7
Applied rewrites26.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 38.5%
Applied rewrites82.8%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6444.6
Applied rewrites44.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 A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6415.6
Applied rewrites15.6%
Applied rewrites27.1%
Applied rewrites27.1%
Final simplification44.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 F)))
(t_1 (fma -4.0 (* C A) (* B_m B_m)))
(t_2 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3)))
(t_5 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_4 (- INFINITY))
(/ (* (- (sqrt t_1)) (* (sqrt (* t_2 2.0)) (sqrt F))) t_5)
(if (<= t_4 -2e-203)
(/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
(if (<= t_4 0.0)
(/
(* (sqrt (* t_2 (* t_5 2.0))) t_0)
(* C (- (/ (* B_m B_m) C) (* 4.0 A))))
(if (<= t_4 INFINITY)
(*
(- (sqrt (* (* 2.0 F) t_1)))
(/ (sqrt (+ (* C (fma 0.0 (/ A C) 1.0)) C)) t_1))
(* (sqrt (/ 2.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(F);
double t_1 = fma(-4.0, (C * A), (B_m * B_m));
double t_2 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double t_5 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (-sqrt(t_1) * (sqrt((t_2 * 2.0)) * sqrt(F))) / t_5;
} else if (t_4 <= -2e-203) {
tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
} else if (t_4 <= 0.0) {
tmp = (sqrt((t_2 * (t_5 * 2.0))) * t_0) / (C * (((B_m * B_m) / C) - (4.0 * A)));
} else if (t_4 <= ((double) INFINITY)) {
tmp = -sqrt(((2.0 * F) * t_1)) * (sqrt(((C * fma(0.0, (A / C), 1.0)) + C)) / t_1);
} else {
tmp = sqrt((2.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(F)) t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_2 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) t_5 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(t_1)) * Float64(sqrt(Float64(t_2 * 2.0)) * sqrt(F))) / t_5); elseif (t_4 <= -2e-203) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(Float64(t_2 * Float64(t_5 * 2.0))) * t_0) / Float64(C * Float64(Float64(Float64(B_m * B_m) / C) - Float64(4.0 * A)))); elseif (t_4 <= Inf) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_1))) * Float64(sqrt(Float64(Float64(C * fma(0.0, Float64(A / C), 1.0)) + C)) / t_1)); else tmp = Float64(sqrt(Float64(2.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[F], $MachinePrecision])}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, Block[{t$95$5 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[((-N[Sqrt[t$95$1], $MachinePrecision]) * N[(N[Sqrt[N[(t$95$2 * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$4, -2e-203], N[(N[Sqrt[N[(N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(t$95$2 * N[(t$95$5 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(C * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(C * N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / 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{F}\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
t_5 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_1}\right) \cdot \left(\sqrt{t\_2 \cdot 2} \cdot \sqrt{F}\right)}{t\_5}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-203}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(t\_5 \cdot 2\right)} \cdot t\_0}{C \cdot \left(\frac{B\_m \cdot B\_m}{C} - 4 \cdot A\right)}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_1}\right) \cdot \frac{\sqrt{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right) + C}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{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))) < -inf.0Initial program 3.1%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.9
Applied rewrites12.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites12.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites18.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites27.4%
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))) < -2.0000000000000001e-203Initial program 99.0%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6435.7
Applied rewrites35.7%
Applied rewrites35.9%
if -2.0000000000000001e-203 < (/.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.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites26.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.7
Applied rewrites26.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 38.5%
Applied rewrites82.8%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6444.6
Applied rewrites44.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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.8
Applied rewrites17.8%
Applied rewrites17.9%
Applied rewrites22.9%
Final simplification27.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- (sqrt (* (* 2.0 F) t_0))))
(t_2 (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4 (fma (* C A) -4.0 (* B_m B_m)))
(t_5
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3)))
(t_6 (- (sqrt F))))
(if (<= t_5 (- INFINITY))
(/ (* (- (sqrt t_0)) (* (sqrt (* t_2 2.0)) (sqrt F))) t_4)
(if (<= t_5 -2e-203)
(* t_1 (/ (sqrt (+ (* B_m (+ (/ A B_m) 1.0)) C)) t_0))
(if (<= t_5 0.0)
(/
(* (sqrt (* t_2 (* t_4 2.0))) t_6)
(* C (- (/ (* B_m B_m) C) (* 4.0 A))))
(if (<= t_5 INFINITY)
(* t_1 (/ (sqrt (+ (* C (fma 0.0 (/ A C) 1.0)) C)) t_0))
(* (sqrt (/ 2.0 B_m)) t_6)))))))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 t_1 = -sqrt(((2.0 * F) * t_0));
double t_2 = fma(-0.5, ((B_m * B_m) / A), (C * 2.0));
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = fma((C * A), -4.0, (B_m * B_m));
double t_5 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double t_6 = -sqrt(F);
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (-sqrt(t_0) * (sqrt((t_2 * 2.0)) * sqrt(F))) / t_4;
} else if (t_5 <= -2e-203) {
tmp = t_1 * (sqrt(((B_m * ((A / B_m) + 1.0)) + C)) / t_0);
} else if (t_5 <= 0.0) {
tmp = (sqrt((t_2 * (t_4 * 2.0))) * t_6) / (C * (((B_m * B_m) / C) - (4.0 * A)));
} else if (t_5 <= ((double) INFINITY)) {
tmp = t_1 * (sqrt(((C * fma(0.0, (A / C), 1.0)) + C)) / t_0);
} else {
tmp = sqrt((2.0 / B_m)) * t_6;
}
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)) t_1 = Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) t_2 = fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) t_6 = Float64(-sqrt(F)) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(t_0)) * Float64(sqrt(Float64(t_2 * 2.0)) * sqrt(F))) / t_4); elseif (t_5 <= -2e-203) tmp = Float64(t_1 * Float64(sqrt(Float64(Float64(B_m * Float64(Float64(A / B_m) + 1.0)) + C)) / t_0)); elseif (t_5 <= 0.0) tmp = Float64(Float64(sqrt(Float64(t_2 * Float64(t_4 * 2.0))) * t_6) / Float64(C * Float64(Float64(Float64(B_m * B_m) / C) - Float64(4.0 * A)))); elseif (t_5 <= Inf) tmp = Float64(t_1 * Float64(sqrt(Float64(Float64(C * fma(0.0, Float64(A / C), 1.0)) + C)) / t_0)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * t_6); 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]}, Block[{t$95$1 = (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$2 = N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, Block[{t$95$6 = (-N[Sqrt[F], $MachinePrecision])}, If[LessEqual[t$95$5, (-Infinity)], N[(N[((-N[Sqrt[t$95$0], $MachinePrecision]) * N[(N[Sqrt[N[(t$95$2 * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -2e-203], N[(t$95$1 * N[(N[Sqrt[N[(N[(B$95$m * N[(N[(A / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(N[(N[Sqrt[N[(t$95$2 * N[(t$95$4 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$6), $MachinePrecision] / N[(C * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] - N[(4.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(t$95$1 * N[(N[Sqrt[N[(N[(C * N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * t$95$6), $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)\\
t_1 := -\sqrt{\left(2 \cdot F\right) \cdot t\_0}\\
t_2 := \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_5 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
t_6 := -\sqrt{F}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0}\right) \cdot \left(\sqrt{t\_2 \cdot 2} \cdot \sqrt{F}\right)}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-203}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{B\_m \cdot \left(\frac{A}{B\_m} + 1\right) + C}}{t\_0}\\
\mathbf{elif}\;t\_5 \leq 0:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(t\_4 \cdot 2\right)} \cdot t\_6}{C \cdot \left(\frac{B\_m \cdot B\_m}{C} - 4 \cdot A\right)}\\
\mathbf{elif}\;t\_5 \leq \infty:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right) + C}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot t\_6\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.9
Applied rewrites12.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites12.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites18.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites27.4%
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))) < -2.0000000000000001e-203Initial program 99.0%
Applied rewrites99.5%
Taylor expanded in B around inf
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6437.8
Applied rewrites37.8%
if -2.0000000000000001e-203 < (/.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.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied rewrites26.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6426.7
Applied rewrites26.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 38.5%
Applied rewrites82.8%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6444.6
Applied rewrites44.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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.8
Applied rewrites17.8%
Applied rewrites17.9%
Applied rewrites22.9%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
(t_1 (- (sqrt (* (* 2.0 F) t_0))))
(t_2 (/ (* B_m B_m) A))
(t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
(t_4
(/
(sqrt
(*
(* 2.0 (* t_3 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
(- t_3)))
(t_5 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= t_4 (- INFINITY))
(/
(* (- (sqrt t_0)) (* (sqrt (* (fma -0.5 t_2 (* C 2.0)) 2.0)) (sqrt F)))
t_5)
(if (<= t_4 -2e-203)
(* t_1 (/ (sqrt (+ (* B_m (+ (/ A B_m) 1.0)) C)) t_0))
(if (<= t_4 0.0)
(/
(* (sqrt (* (fma t_2 -0.5 (* C 2.0)) t_0)) (sqrt (* F 2.0)))
(- t_5))
(if (<= t_4 INFINITY)
(* t_1 (/ (sqrt (+ (* C (fma 0.0 (/ A C) 1.0)) C)) t_0))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double t_1 = -sqrt(((2.0 * F) * t_0));
double t_2 = (B_m * B_m) / A;
double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
double t_4 = sqrt(((2.0 * (t_3 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_3;
double t_5 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (-sqrt(t_0) * (sqrt((fma(-0.5, t_2, (C * 2.0)) * 2.0)) * sqrt(F))) / t_5;
} else if (t_4 <= -2e-203) {
tmp = t_1 * (sqrt(((B_m * ((A / B_m) + 1.0)) + C)) / t_0);
} else if (t_4 <= 0.0) {
tmp = (sqrt((fma(t_2, -0.5, (C * 2.0)) * t_0)) * sqrt((F * 2.0))) / -t_5;
} else if (t_4 <= ((double) INFINITY)) {
tmp = t_1 * (sqrt(((C * fma(0.0, (A / C), 1.0)) + C)) / t_0);
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) t_1 = Float64(-sqrt(Float64(Float64(2.0 * F) * t_0))) t_2 = Float64(Float64(B_m * B_m) / A) t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_3)) t_5 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(t_0)) * Float64(sqrt(Float64(fma(-0.5, t_2, Float64(C * 2.0)) * 2.0)) * sqrt(F))) / t_5); elseif (t_4 <= -2e-203) tmp = Float64(t_1 * Float64(sqrt(Float64(Float64(B_m * Float64(Float64(A / B_m) + 1.0)) + C)) / t_0)); elseif (t_4 <= 0.0) tmp = Float64(Float64(sqrt(Float64(fma(t_2, -0.5, Float64(C * 2.0)) * t_0)) * sqrt(Float64(F * 2.0))) / Float64(-t_5)); elseif (t_4 <= Inf) tmp = Float64(t_1 * Float64(sqrt(Float64(Float64(C * fma(0.0, Float64(A / C), 1.0)) + C)) / t_0)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision])}, Block[{t$95$2 = N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$3)), $MachinePrecision]}, Block[{t$95$5 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[((-N[Sqrt[t$95$0], $MachinePrecision]) * N[(N[Sqrt[N[(N[(-0.5 * t$95$2 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$4, -2e-203], N[(t$95$1 * N[(N[Sqrt[N[(N[(B$95$m * N[(N[(A / B$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(t$95$2 * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$5)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(t$95$1 * N[(N[Sqrt[N[(N[(C * N[(0.0 * N[(A / C), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
t_1 := -\sqrt{\left(2 \cdot F\right) \cdot t\_0}\\
t_2 := \frac{B\_m \cdot B\_m}{A}\\
t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(t\_3 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{-t\_3}\\
t_5 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0}\right) \cdot \left(\sqrt{\mathsf{fma}\left(-0.5, t\_2, C \cdot 2\right) \cdot 2} \cdot \sqrt{F}\right)}{t\_5}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-203}:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{B\_m \cdot \left(\frac{A}{B\_m} + 1\right) + C}}{t\_0}\\
\mathbf{elif}\;t\_4 \leq 0:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(t\_2, -0.5, C \cdot 2\right) \cdot t\_0} \cdot \sqrt{F \cdot 2}}{-t\_5}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;t\_1 \cdot \frac{\sqrt{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right) + C}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.9
Applied rewrites12.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites12.9%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites18.7%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
unpow-prod-downN/A
pow1/2N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites27.4%
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))) < -2.0000000000000001e-203Initial program 99.0%
Applied rewrites99.5%
Taylor expanded in B around inf
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6437.8
Applied rewrites37.8%
if -2.0000000000000001e-203 < (/.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.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6419.7
Applied rewrites19.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites19.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites26.7%
if -0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 38.5%
Applied rewrites82.8%
Taylor expanded in C around inf
lower-*.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f6444.6
Applied rewrites44.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 B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6417.8
Applied rewrites17.8%
Applied rewrites17.9%
Applied rewrites22.9%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_1 (- (fma (* C A) -4.0 (* B_m B_m))))
(t_2 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 6.6e-65)
(/ (* (sqrt (* (* t_2 2.0) F)) (sqrt t_0)) t_1)
(if (<= B_m 1.3e+24)
(*
(sqrt (* (* 2.0 F) t_2))
(/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) (- t_2)))
(if (<= B_m 2.3e+63)
(/ (* (sqrt (* t_0 t_2)) (sqrt (* F 2.0))) t_1)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_1 = -fma((C * A), -4.0, (B_m * B_m));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (B_m <= 6.6e-65) {
tmp = (sqrt(((t_2 * 2.0) * F)) * sqrt(t_0)) / t_1;
} else if (B_m <= 1.3e+24) {
tmp = sqrt(((2.0 * F) * t_2)) * (sqrt(((hypot(B_m, (A - C)) + A) + C)) / -t_2);
} else if (B_m <= 2.3e+63) {
tmp = (sqrt((t_0 * t_2)) * sqrt((F * 2.0))) / t_1;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_1 = Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m))) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 6.6e-65) tmp = Float64(Float64(sqrt(Float64(Float64(t_2 * 2.0) * F)) * sqrt(t_0)) / t_1); elseif (B_m <= 1.3e+24) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * t_2)) * Float64(sqrt(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C)) / Float64(-t_2))); elseif (B_m <= 2.3e+63) tmp = Float64(Float64(sqrt(Float64(t_0 * t_2)) * sqrt(Float64(F * 2.0))) / t_1); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.6e-65], N[(N[(N[Sqrt[N[(N[(t$95$2 * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.3e+24], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.3e+63], N[(N[(N[Sqrt[N[(t$95$0 * t$95$2), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_1 := -\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 6.6 \cdot 10^{-65}:\\
\;\;\;\;\frac{\sqrt{\left(t\_2 \cdot 2\right) \cdot F} \cdot \sqrt{t\_0}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.3 \cdot 10^{+24}:\\
\;\;\;\;\sqrt{\left(2 \cdot F\right) \cdot t\_2} \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{-t\_2}\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot t\_2} \cdot \sqrt{F \cdot 2}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\end{array}
\end{array}
if B < 6.6000000000000002e-65Initial program 14.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.8
Applied rewrites15.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.8%
Applied rewrites14.6%
if 6.6000000000000002e-65 < B < 1.2999999999999999e24Initial program 28.5%
Applied rewrites45.6%
if 1.2999999999999999e24 < B < 2.29999999999999993e63Initial program 11.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f642.1
Applied rewrites2.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites2.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites11.1%
if 2.29999999999999993e63 < B Initial program 12.5%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6446.7
Applied rewrites46.7%
Applied rewrites73.6%
Applied rewrites73.7%
Final simplification27.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.3e+63)
(/
(sqrt
(*
(fma -4.0 (* C A) (* B_m B_m))
(* (* F 2.0) (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))))
(- (fma (* C A) -4.0 (* B_m B_m))))
(*
(/
(fma
0.5
(* (sqrt (pow B_m -1.0)) (* C (sqrt 2.0)))
(* (sqrt B_m) (sqrt 2.0)))
B_m)
(- (sqrt F)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.3e+63) {
tmp = sqrt((fma(-4.0, (C * A), (B_m * B_m)) * ((F * 2.0) * fma(((B_m * B_m) / A), -0.5, (C * 2.0))))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = (fma(0.5, (sqrt(pow(B_m, -1.0)) * (C * sqrt(2.0))), (sqrt(B_m) * sqrt(2.0))) / B_m) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.3e+63) tmp = Float64(sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0))))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(Float64(fma(0.5, Float64(sqrt((B_m ^ -1.0)) * Float64(C * sqrt(2.0))), Float64(sqrt(B_m) * sqrt(2.0))) / B_m) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.3e+63], N[(N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[(0.5 * N[(N[Sqrt[N[Power[B$95$m, -1.0], $MachinePrecision]], $MachinePrecision] * N[(C * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.5, \sqrt{{B\_m}^{-1}} \cdot \left(C \cdot \sqrt{2}\right), \sqrt{B\_m} \cdot \sqrt{2}\right)}{B\_m} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 2.29999999999999993e63Initial program 15.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6414.9
Applied rewrites14.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites14.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites14.9%
if 2.29999999999999993e63 < B Initial program 12.5%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6446.7
Applied rewrites46.7%
Applied rewrites73.6%
Applied rewrites73.7%
Taylor expanded in C around 0
Applied rewrites64.5%
Final simplification24.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))
(t_1 (- (fma (* C A) -4.0 (* B_m B_m))))
(t_2 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= B_m 2.2e-72)
(/ (* (sqrt (* (* t_2 2.0) F)) (sqrt t_0)) t_1)
(if (<= B_m 1.25e+24)
(/
(sqrt (* (+ (+ (hypot B_m (- A C)) A) C) (* (* 2.0 F) t_2)))
(fma (- B_m) B_m (* (* 4.0 A) C)))
(if (<= B_m 2.3e+63)
(/ (* (sqrt (* t_0 t_2)) (sqrt (* F 2.0))) t_1)
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(((B_m * B_m) / A), -0.5, (C * 2.0));
double t_1 = -fma((C * A), -4.0, (B_m * B_m));
double t_2 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (B_m <= 2.2e-72) {
tmp = (sqrt(((t_2 * 2.0) * F)) * sqrt(t_0)) / t_1;
} else if (B_m <= 1.25e+24) {
tmp = sqrt((((hypot(B_m, (A - C)) + A) + C) * ((2.0 * F) * t_2))) / fma(-B_m, B_m, ((4.0 * A) * C));
} else if (B_m <= 2.3e+63) {
tmp = (sqrt((t_0 * t_2)) * sqrt((F * 2.0))) / t_1;
} else {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) t_1 = Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m))) t_2 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 2.2e-72) tmp = Float64(Float64(sqrt(Float64(Float64(t_2 * 2.0) * F)) * sqrt(t_0)) / t_1); elseif (B_m <= 1.25e+24) tmp = Float64(sqrt(Float64(Float64(Float64(hypot(B_m, Float64(A - C)) + A) + C) * Float64(Float64(2.0 * F) * t_2))) / fma(Float64(-B_m), B_m, Float64(Float64(4.0 * A) * C))); elseif (B_m <= 2.3e+63) tmp = Float64(Float64(sqrt(Float64(t_0 * t_2)) * sqrt(Float64(F * 2.0))) / t_1); else tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])}, Block[{t$95$2 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.2e-72], N[(N[(N[Sqrt[N[(N[(t$95$2 * 2.0), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.25e+24], N[(N[Sqrt[N[(N[(N[(N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.3e+63], N[(N[(N[Sqrt[N[(t$95$0 * t$95$2), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\\
t_1 := -\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 2.2 \cdot 10^{-72}:\\
\;\;\;\;\frac{\sqrt{\left(t\_2 \cdot 2\right) \cdot F} \cdot \sqrt{t\_0}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.25 \cdot 10^{+24}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_2\right)}}{\mathsf{fma}\left(-B\_m, B\_m, \left(4 \cdot A\right) \cdot C\right)}\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{t\_0 \cdot t\_2} \cdot \sqrt{F \cdot 2}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\end{array}
\end{array}
if B < 2.20000000000000002e-72Initial program 15.0%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.5
Applied rewrites15.5%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.5%
Applied rewrites14.3%
if 2.20000000000000002e-72 < B < 1.25000000000000011e24Initial program 22.5%
Applied rewrites36.6%
if 1.25000000000000011e24 < B < 2.29999999999999993e63Initial program 11.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f642.1
Applied rewrites2.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites2.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites11.1%
if 2.29999999999999993e63 < B Initial program 12.5%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6446.7
Applied rewrites46.7%
Applied rewrites73.6%
Applied rewrites73.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 (* C A) -4.0 (* B_m B_m)))
(t_1 (- t_0))
(t_2 (* (sqrt (* (+ (hypot C B_m) C) 2.0)) (/ (sqrt F) (- B_m))))
(t_3 (sqrt (* F 2.0))))
(if (<= B_m 2.65e-11)
(/ (sqrt (* (* 2.0 C) (* (* t_0 F) 2.0))) t_1)
(if (<= B_m 1.1e+41)
t_2
(if (<= B_m 2.3e+63)
(/
(*
(sqrt
(*
(fma (/ (* B_m B_m) A) -0.5 (* C 2.0))
(fma -4.0 (* C A) (* B_m B_m))))
t_3)
t_1)
(if (<= B_m 3.7e+253) t_2 (/ t_3 (- (sqrt B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = -t_0;
double t_2 = sqrt(((hypot(C, B_m) + C) * 2.0)) * (sqrt(F) / -B_m);
double t_3 = sqrt((F * 2.0));
double tmp;
if (B_m <= 2.65e-11) {
tmp = sqrt(((2.0 * C) * ((t_0 * F) * 2.0))) / t_1;
} else if (B_m <= 1.1e+41) {
tmp = t_2;
} else if (B_m <= 2.3e+63) {
tmp = (sqrt((fma(((B_m * B_m) / A), -0.5, (C * 2.0)) * fma(-4.0, (C * A), (B_m * B_m)))) * t_3) / t_1;
} else if (B_m <= 3.7e+253) {
tmp = t_2;
} else {
tmp = t_3 / -sqrt(B_m);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = Float64(-t_0) t_2 = Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) * Float64(sqrt(F) / Float64(-B_m))) t_3 = sqrt(Float64(F * 2.0)) tmp = 0.0 if (B_m <= 2.65e-11) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(Float64(t_0 * F) * 2.0))) / t_1); elseif (B_m <= 1.1e+41) tmp = t_2; elseif (B_m <= 2.3e+63) tmp = Float64(Float64(sqrt(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) * fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) * t_3) / t_1); elseif (B_m <= 3.7e+253) tmp = t_2; else tmp = Float64(t_3 / Float64(-sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.65e-11], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.1e+41], t$95$2, If[LessEqual[B$95$m, 2.3e+63], N[(N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 3.7e+253], t$95$2, N[(t$95$3 / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
t_2 := \sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \frac{\sqrt{F}}{-B\_m}\\
t_3 := \sqrt{F \cdot 2}\\
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-11}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{+41}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)} \cdot t\_3}{t\_1}\\
\mathbf{elif}\;B\_m \leq 3.7 \cdot 10^{+253}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_3}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if B < 2.6499999999999999e-11Initial program 14.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.7
Applied rewrites15.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.7%
Taylor expanded in A around -inf
lower-*.f6416.3
Applied rewrites16.3%
if 2.6499999999999999e-11 < B < 1.09999999999999995e41 or 2.29999999999999993e63 < B < 3.70000000000000029e253Initial program 18.5%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.5
Applied rewrites48.5%
Applied rewrites68.2%
Applied rewrites68.3%
Applied rewrites62.4%
if 1.09999999999999995e41 < B < 2.29999999999999993e63Initial program 12.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f642.3
Applied rewrites2.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites2.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites12.4%
if 3.70000000000000029e253 < B Initial program 0.0%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6463.3
Applied rewrites63.3%
Applied rewrites63.3%
Applied rewrites82.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 (fma (* C A) -4.0 (* B_m B_m))) (t_1 (- t_0)))
(if (<= B_m 2.65e-11)
(/ (sqrt (* (* 2.0 C) (* (* t_0 F) 2.0))) t_1)
(if (or (<= B_m 1.1e+41) (not (<= B_m 2.3e+63)))
(* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F))
(/
(*
(sqrt
(*
(fma (/ (* B_m B_m) A) -0.5 (* C 2.0))
(fma -4.0 (* C A) (* B_m B_m))))
(sqrt (* F 2.0)))
t_1)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double t_1 = -t_0;
double tmp;
if (B_m <= 2.65e-11) {
tmp = sqrt(((2.0 * C) * ((t_0 * F) * 2.0))) / t_1;
} else if ((B_m <= 1.1e+41) || !(B_m <= 2.3e+63)) {
tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / -B_m) * sqrt(F);
} else {
tmp = (sqrt((fma(((B_m * B_m) / A), -0.5, (C * 2.0)) * fma(-4.0, (C * A), (B_m * B_m)))) * sqrt((F * 2.0))) / t_1;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) t_1 = Float64(-t_0) tmp = 0.0 if (B_m <= 2.65e-11) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(Float64(t_0 * F) * 2.0))) / t_1); elseif ((B_m <= 1.1e+41) || !(B_m <= 2.3e+63)) tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / Float64(-B_m)) * sqrt(F)); else tmp = Float64(Float64(sqrt(Float64(fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0)) * fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) * sqrt(Float64(F * 2.0))) / t_1); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[B$95$m, 2.65e-11], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[Or[LessEqual[B$95$m, 1.1e+41], N[Not[LessEqual[B$95$m, 2.3e+63]], $MachinePrecision]], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
t_1 := -t\_0\\
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-11}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.1 \cdot 10^{+41} \lor \neg \left(B\_m \leq 2.3 \cdot 10^{+63}\right):\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)} \cdot \sqrt{F \cdot 2}}{t\_1}\\
\end{array}
\end{array}
if B < 2.6499999999999999e-11Initial program 14.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.7
Applied rewrites15.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.7%
Taylor expanded in A around -inf
lower-*.f6416.3
Applied rewrites16.3%
if 2.6499999999999999e-11 < B < 1.09999999999999995e41 or 2.29999999999999993e63 < B Initial program 15.2%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6447.1
Applied rewrites47.1%
Applied rewrites72.0%
Applied rewrites72.1%
if 1.09999999999999995e41 < B < 2.29999999999999993e63Initial program 12.5%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f642.3
Applied rewrites2.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites2.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites12.4%
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 2.3e+63)
(/
(sqrt
(*
(fma -4.0 (* C A) (* B_m B_m))
(* (* F 2.0) (fma (/ (* B_m B_m) A) -0.5 (* C 2.0)))))
(- (fma (* C A) -4.0 (* B_m B_m))))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.3e+63) {
tmp = sqrt((fma(-4.0, (C * A), (B_m * B_m)) * ((F * 2.0) * fma(((B_m * B_m) / A), -0.5, (C * 2.0))))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.3e+63) tmp = Float64(sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B_m * B_m)) * Float64(Float64(F * 2.0) * fma(Float64(Float64(B_m * B_m) / A), -0.5, Float64(C * 2.0))))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.3e+63], N[(N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot \mathsf{fma}\left(\frac{B\_m \cdot B\_m}{A}, -0.5, C \cdot 2\right)\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 2.29999999999999993e63Initial program 15.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6414.9
Applied rewrites14.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites14.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
*-commutativeN/A
lift-fma.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites14.9%
if 2.29999999999999993e63 < B Initial program 12.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.7
Applied rewrites48.7%
Applied rewrites48.8%
Applied rewrites65.5%
Final simplification25.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= B_m 2.3e+63)
(/
(sqrt (* (fma -0.5 (/ (* B_m B_m) A) (* C 2.0)) (* (* t_0 F) 2.0)))
(- t_0))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (B_m <= 2.3e+63) {
tmp = sqrt((fma(-0.5, ((B_m * B_m) / A), (C * 2.0)) * ((t_0 * F) * 2.0))) / -t_0;
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 2.3e+63) tmp = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.3e+63], N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 2.3 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 2.29999999999999993e63Initial program 15.3%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6414.9
Applied rewrites14.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites14.9%
if 2.29999999999999993e63 < B Initial program 12.5%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6448.7
Applied rewrites48.7%
Applied rewrites48.8%
Applied rewrites65.5%
Final simplification25.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma (* C A) -4.0 (* B_m B_m))))
(if (<= B_m 1000000000000.0)
(/ (sqrt (* (* 2.0 C) (* (* t_0 F) 2.0))) (- t_0))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma((C * A), -4.0, (B_m * B_m));
double tmp;
if (B_m <= 1000000000000.0) {
tmp = sqrt(((2.0 * C) * ((t_0 * F) * 2.0))) / -t_0;
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(Float64(C * A), -4.0, Float64(B_m * B_m)) tmp = 0.0 if (B_m <= 1000000000000.0) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1000000000000.0], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\
\mathbf{if}\;B\_m \leq 1000000000000:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 1e12Initial program 15.1%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.6
Applied rewrites15.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.6%
Taylor expanded in A around -inf
lower-*.f6416.2
Applied rewrites16.2%
if 1e12 < B Initial program 13.7%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6443.9
Applied rewrites43.9%
Applied rewrites44.0%
Applied rewrites57.8%
Final simplification26.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 2.65e-11)
(/
(sqrt (* (* 2.0 C) (* (* -4.0 (* (* A C) F)) 2.0)))
(- (fma (* C A) -4.0 (* B_m B_m))))
(* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.65e-11) {
tmp = sqrt(((2.0 * C) * ((-4.0 * ((A * C) * F)) * 2.0))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.65e-11) tmp = Float64(sqrt(Float64(Float64(2.0 * C) * Float64(Float64(-4.0 * Float64(Float64(A * C) * F)) * 2.0))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.65e-11], N[(N[Sqrt[N[(N[(2.0 * C), $MachinePrecision] * N[(N[(-4.0 * N[(N[(A * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-11}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot C\right) \cdot \left(\left(-4 \cdot \left(\left(A \cdot C\right) \cdot F\right)\right) \cdot 2\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 2.6499999999999999e-11Initial program 14.7%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.7
Applied rewrites15.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.7%
Taylor expanded in A around -inf
lower-*.f6416.3
Applied rewrites16.3%
Taylor expanded in A around inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6415.3
Applied rewrites15.3%
if 2.6499999999999999e-11 < B Initial program 14.8%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6443.3
Applied rewrites43.3%
Applied rewrites43.4%
Applied rewrites56.7%
Final simplification25.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.6e-112) (/ (sqrt (* -16.0 (* (* A (* C C)) F))) (- (fma (* C A) -4.0 (* B_m B_m)))) (* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.6e-112) {
tmp = sqrt((-16.0 * ((A * (C * C)) * F))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.6e-112) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * Float64(C * C)) * F))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.6e-112], N[(N[Sqrt[N[(-16.0 * N[(N[(A * N[(C * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.6 \cdot 10^{-112}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot \left(C \cdot C\right)\right) \cdot F\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 3.6000000000000001e-112Initial program 15.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.6
Applied rewrites15.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.6%
Taylor expanded in A around -inf
lower-*.f6416.2
Applied rewrites16.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.6
Applied rewrites11.6%
if 3.6000000000000001e-112 < B Initial program 13.8%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6437.0
Applied rewrites37.0%
Applied rewrites37.1%
Applied rewrites47.1%
Final simplification23.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 3.25e-112) (/ (sqrt (* -16.0 (* A (* (* C C) F)))) (- (fma (* C A) -4.0 (* B_m B_m)))) (* (sqrt (/ 2.0 B_m)) (- (sqrt F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.25e-112) {
tmp = sqrt((-16.0 * (A * ((C * C) * F)))) / -fma((C * A), -4.0, (B_m * B_m));
} else {
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.25e-112) tmp = Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m)))); else tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.25e-112], N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.25 \cdot 10^{-112}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)\\
\end{array}
\end{array}
if B < 3.24999999999999978e-112Initial program 15.2%
Taylor expanded in A around -inf
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6415.6
Applied rewrites15.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites15.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6410.7
Applied rewrites10.7%
if 3.24999999999999978e-112 < B Initial program 13.8%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6437.0
Applied rewrites37.0%
Applied rewrites37.1%
Applied rewrites47.1%
Final simplification22.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 (<= C 1.6e+159) (- (sqrt (/ (+ F F) B_m))) (* (/ 2.0 (- B_m)) (sqrt (* C F)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.6e+159) {
tmp = -sqrt(((F + F) / B_m));
} else {
tmp = (2.0 / -B_m) * sqrt((C * F));
}
return tmp;
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (c <= 1.6d+159) then
tmp = -sqrt(((f + f) / b_m))
else
tmp = (2.0d0 / -b_m) * sqrt((c * f))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.6e+159) {
tmp = -Math.sqrt(((F + F) / B_m));
} else {
tmp = (2.0 / -B_m) * Math.sqrt((C * F));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 1.6e+159: tmp = -math.sqrt(((F + F) / B_m)) else: tmp = (2.0 / -B_m) * math.sqrt((C * F)) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 1.6e+159) tmp = Float64(-sqrt(Float64(Float64(F + F) / B_m))); else tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(C * F))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 1.6e+159)
tmp = -sqrt(((F + F) / B_m));
else
tmp = (2.0 / -B_m) * sqrt((C * F));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 1.6e+159], (-N[Sqrt[N[(N[(F + F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;C \leq 1.6 \cdot 10^{+159}:\\
\;\;\;\;-\sqrt{\frac{F + F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{C \cdot F}\\
\end{array}
\end{array}
if C < 1.59999999999999992e159Initial program 16.4%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6414.4
Applied rewrites14.4%
Applied rewrites14.4%
Applied rewrites14.4%
if 1.59999999999999992e159 < C Initial program 2.0%
Taylor expanded in A around 0
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f648.5
Applied rewrites8.5%
Taylor expanded in B around 0
Applied rewrites8.8%
Final simplification13.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (* (sqrt (/ 2.0 B_m)) (- (sqrt F))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((2.0 / B_m)) * -sqrt(F);
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 / b_m)) * -sqrt(f)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((2.0 / B_m)) * -math.sqrt(F)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((2.0 / B_m)) * -sqrt(F);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{\frac{2}{B\_m}} \cdot \left(-\sqrt{F}\right)
\end{array}
Initial program 14.7%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6413.4
Applied rewrites13.4%
Applied rewrites13.4%
Applied rewrites16.2%
Final simplification16.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 (- (sqrt (/ (+ F F) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt(((F + F) / B_m));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((f + f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt(((F + F) / B_m));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt(((F + F) / B_m))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(Float64(F + F) / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt(((F + F) / B_m));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(F + F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{F + F}{B\_m}}
\end{array}
Initial program 14.7%
Taylor expanded in B around inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6413.4
Applied rewrites13.4%
Applied rewrites13.4%
Applied rewrites13.4%
herbie shell --seed 2024350
(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))))