
(FPCore (re im) :precision binary64 (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))
double code(double re, double im) {
return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 0.5d0 * sqrt((2.0d0 * (sqrt(((re * re) + (im * im))) + re)))
end function
public static double code(double re, double im) {
return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) + re)));
}
def code(re, im): return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) + re)))
function code(re, im) return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) + re)))) end
function tmp = code(re, im) tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re))); end
code[re_, im_] := N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} + re\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))
double code(double re, double im) {
return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 0.5d0 * sqrt((2.0d0 * (sqrt(((re * re) + (im * im))) + re)))
end function
public static double code(double re, double im) {
return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) + re)));
}
def code(re, im): return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) + re)))
function code(re, im) return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) + re)))) end
function tmp = code(re, im) tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re))); end
code[re_, im_] := N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} + re\right)}
\end{array}
(FPCore (re im) :precision binary64 (if (<= (sqrt (* 2.0 (+ re (sqrt (+ (* re re) (* im im)))))) 0.0) (* 0.5 (sqrt (- (* (/ (pow im 4.0) (pow re 3.0)) 0.25) (* im (/ im re))))) (* 0.5 (sqrt (* 2.0 (+ re (hypot re im)))))))
double code(double re, double im) {
double tmp;
if (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0) {
tmp = 0.5 * sqrt((((pow(im, 4.0) / pow(re, 3.0)) * 0.25) - (im * (im / re))));
} else {
tmp = 0.5 * sqrt((2.0 * (re + hypot(re, im))));
}
return tmp;
}
public static double code(double re, double im) {
double tmp;
if (Math.sqrt((2.0 * (re + Math.sqrt(((re * re) + (im * im)))))) <= 0.0) {
tmp = 0.5 * Math.sqrt((((Math.pow(im, 4.0) / Math.pow(re, 3.0)) * 0.25) - (im * (im / re))));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (re + Math.hypot(re, im))));
}
return tmp;
}
def code(re, im): tmp = 0 if math.sqrt((2.0 * (re + math.sqrt(((re * re) + (im * im)))))) <= 0.0: tmp = 0.5 * math.sqrt((((math.pow(im, 4.0) / math.pow(re, 3.0)) * 0.25) - (im * (im / re)))) else: tmp = 0.5 * math.sqrt((2.0 * (re + math.hypot(re, im)))) return tmp
function code(re, im) tmp = 0.0 if (sqrt(Float64(2.0 * Float64(re + sqrt(Float64(Float64(re * re) + Float64(im * im)))))) <= 0.0) tmp = Float64(0.5 * sqrt(Float64(Float64(Float64((im ^ 4.0) / (re ^ 3.0)) * 0.25) - Float64(im * Float64(im / re))))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + hypot(re, im))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0) tmp = 0.5 * sqrt(((((im ^ 4.0) / (re ^ 3.0)) * 0.25) - (im * (im / re)))); else tmp = 0.5 * sqrt((2.0 * (re + hypot(re, im)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[N[Sqrt[N[(2.0 * N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[(0.5 * N[Sqrt[N[(N[(N[(N[Power[im, 4.0], $MachinePrecision] / N[Power[re, 3.0], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] - N[(im * N[(im / re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{2 \cdot \left(re + \sqrt{re \cdot re + im \cdot im}\right)} \leq 0:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{{im}^{4}}{{re}^{3}} \cdot 0.25 - im \cdot \frac{im}{re}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) < 0.0Initial program 6.0%
sqr-neg6.0%
+-commutative6.0%
sqr-neg6.0%
+-commutative6.0%
distribute-rgt-in6.0%
cancel-sign-sub6.0%
distribute-rgt-out--6.0%
sub-neg6.0%
remove-double-neg6.0%
+-commutative6.0%
hypot-define6.0%
Simplified6.0%
Taylor expanded in re around -inf 57.8%
+-commutative57.8%
mul-1-neg57.8%
unsub-neg57.8%
*-commutative57.8%
Simplified57.8%
unpow257.8%
associate-/l*59.3%
Applied egg-rr59.3%
if 0.0 < (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) Initial program 43.2%
sqr-neg43.2%
+-commutative43.2%
sqr-neg43.2%
+-commutative43.2%
distribute-rgt-in43.2%
cancel-sign-sub43.2%
distribute-rgt-out--43.2%
sub-neg43.2%
remove-double-neg43.2%
+-commutative43.2%
hypot-define88.9%
Simplified88.9%
Final simplification84.3%
(FPCore (re im) :precision binary64 (if (<= (sqrt (* 2.0 (+ re (sqrt (+ (* re re) (* im im)))))) 0.0) (* 0.5 (sqrt (/ (pow im 2.0) (- re)))) (* 0.5 (sqrt (* 2.0 (+ re (hypot re im)))))))
double code(double re, double im) {
double tmp;
if (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0) {
tmp = 0.5 * sqrt((pow(im, 2.0) / -re));
} else {
tmp = 0.5 * sqrt((2.0 * (re + hypot(re, im))));
}
return tmp;
}
public static double code(double re, double im) {
double tmp;
if (Math.sqrt((2.0 * (re + Math.sqrt(((re * re) + (im * im)))))) <= 0.0) {
tmp = 0.5 * Math.sqrt((Math.pow(im, 2.0) / -re));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (re + Math.hypot(re, im))));
}
return tmp;
}
def code(re, im): tmp = 0 if math.sqrt((2.0 * (re + math.sqrt(((re * re) + (im * im)))))) <= 0.0: tmp = 0.5 * math.sqrt((math.pow(im, 2.0) / -re)) else: tmp = 0.5 * math.sqrt((2.0 * (re + math.hypot(re, im)))) return tmp
function code(re, im) tmp = 0.0 if (sqrt(Float64(2.0 * Float64(re + sqrt(Float64(Float64(re * re) + Float64(im * im)))))) <= 0.0) tmp = Float64(0.5 * sqrt(Float64((im ^ 2.0) / Float64(-re)))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + hypot(re, im))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0) tmp = 0.5 * sqrt(((im ^ 2.0) / -re)); else tmp = 0.5 * sqrt((2.0 * (re + hypot(re, im)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[N[Sqrt[N[(2.0 * N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[(0.5 * N[Sqrt[N[(N[Power[im, 2.0], $MachinePrecision] / (-re)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{2 \cdot \left(re + \sqrt{re \cdot re + im \cdot im}\right)} \leq 0:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{{im}^{2}}{-re}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) < 0.0Initial program 6.0%
sqr-neg6.0%
+-commutative6.0%
sqr-neg6.0%
+-commutative6.0%
distribute-rgt-in6.0%
cancel-sign-sub6.0%
distribute-rgt-out--6.0%
sub-neg6.0%
remove-double-neg6.0%
+-commutative6.0%
hypot-define6.0%
Simplified6.0%
Taylor expanded in re around -inf 58.2%
mul-1-neg58.2%
distribute-neg-frac258.2%
Simplified58.2%
if 0.0 < (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) Initial program 43.2%
sqr-neg43.2%
+-commutative43.2%
sqr-neg43.2%
+-commutative43.2%
distribute-rgt-in43.2%
cancel-sign-sub43.2%
distribute-rgt-out--43.2%
sub-neg43.2%
remove-double-neg43.2%
+-commutative43.2%
hypot-define88.9%
Simplified88.9%
Final simplification84.1%
(FPCore (re im)
:precision binary64
(if (<= re -1.66e-41)
(* 0.5 (sqrt (/ (pow im 2.0) (- re))))
(if (or (<= re 5.4e-76) (and (not (<= re 7.2e-37)) (<= re 1.02e+60)))
(* 0.5 (sqrt (* 2.0 (+ re im))))
(* 0.5 (* 2.0 (sqrt re))))))
double code(double re, double im) {
double tmp;
if (re <= -1.66e-41) {
tmp = 0.5 * sqrt((pow(im, 2.0) / -re));
} else if ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) {
tmp = 0.5 * sqrt((2.0 * (re + im)));
} else {
tmp = 0.5 * (2.0 * sqrt(re));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.66d-41)) then
tmp = 0.5d0 * sqrt(((im ** 2.0d0) / -re))
else if ((re <= 5.4d-76) .or. (.not. (re <= 7.2d-37)) .and. (re <= 1.02d+60)) then
tmp = 0.5d0 * sqrt((2.0d0 * (re + im)))
else
tmp = 0.5d0 * (2.0d0 * sqrt(re))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.66e-41) {
tmp = 0.5 * Math.sqrt((Math.pow(im, 2.0) / -re));
} else if ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im)));
} else {
tmp = 0.5 * (2.0 * Math.sqrt(re));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.66e-41: tmp = 0.5 * math.sqrt((math.pow(im, 2.0) / -re)) elif (re <= 5.4e-76) or (not (re <= 7.2e-37) and (re <= 1.02e+60)): tmp = 0.5 * math.sqrt((2.0 * (re + im))) else: tmp = 0.5 * (2.0 * math.sqrt(re)) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.66e-41) tmp = Float64(0.5 * sqrt(Float64((im ^ 2.0) / Float64(-re)))); elseif ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im)))); else tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.66e-41) tmp = 0.5 * sqrt(((im ^ 2.0) / -re)); elseif ((re <= 5.4e-76) || (~((re <= 7.2e-37)) && (re <= 1.02e+60))) tmp = 0.5 * sqrt((2.0 * (re + im))); else tmp = 0.5 * (2.0 * sqrt(re)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.66e-41], N[(0.5 * N[Sqrt[N[(N[Power[im, 2.0], $MachinePrecision] / (-re)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 5.4e-76], And[N[Not[LessEqual[re, 7.2e-37]], $MachinePrecision], LessEqual[re, 1.02e+60]]], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.66 \cdot 10^{-41}:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{{im}^{2}}{-re}}\\
\mathbf{elif}\;re \leq 5.4 \cdot 10^{-76} \lor \neg \left(re \leq 7.2 \cdot 10^{-37}\right) \land re \leq 1.02 \cdot 10^{+60}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\end{array}
\end{array}
if re < -1.65999999999999993e-41Initial program 11.2%
sqr-neg11.2%
+-commutative11.2%
sqr-neg11.2%
+-commutative11.2%
distribute-rgt-in11.2%
cancel-sign-sub11.2%
distribute-rgt-out--11.2%
sub-neg11.2%
remove-double-neg11.2%
+-commutative11.2%
hypot-define32.7%
Simplified32.7%
Taylor expanded in re around -inf 55.4%
mul-1-neg55.4%
distribute-neg-frac255.4%
Simplified55.4%
if -1.65999999999999993e-41 < re < 5.4000000000000001e-76 or 7.20000000000000014e-37 < re < 1.0200000000000001e60Initial program 50.5%
sqr-neg50.5%
+-commutative50.5%
sqr-neg50.5%
+-commutative50.5%
distribute-rgt-in50.5%
cancel-sign-sub50.5%
distribute-rgt-out--50.5%
sub-neg50.5%
remove-double-neg50.5%
+-commutative50.5%
hypot-define90.8%
Simplified90.8%
Taylor expanded in re around 0 44.9%
distribute-lft-out44.9%
*-commutative44.9%
Simplified44.9%
if 5.4000000000000001e-76 < re < 7.20000000000000014e-37 or 1.0200000000000001e60 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
Final simplification56.2%
(FPCore (re im)
:precision binary64
(if (<= re -8.5e+243)
(* 0.5 (sqrt (* 2.0 (- re re))))
(if (<= re 5.3e-76)
(* 0.5 (sqrt (* 2.0 im)))
(if (or (<= re 9e-44) (not (<= re 8e+54)))
(* 0.5 (* 2.0 (sqrt re)))
(* 0.5 (sqrt (* 2.0 (+ re im))))))))
double code(double re, double im) {
double tmp;
if (re <= -8.5e+243) {
tmp = 0.5 * sqrt((2.0 * (re - re)));
} else if (re <= 5.3e-76) {
tmp = 0.5 * sqrt((2.0 * im));
} else if ((re <= 9e-44) || !(re <= 8e+54)) {
tmp = 0.5 * (2.0 * sqrt(re));
} else {
tmp = 0.5 * sqrt((2.0 * (re + im)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-8.5d+243)) then
tmp = 0.5d0 * sqrt((2.0d0 * (re - re)))
else if (re <= 5.3d-76) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else if ((re <= 9d-44) .or. (.not. (re <= 8d+54))) then
tmp = 0.5d0 * (2.0d0 * sqrt(re))
else
tmp = 0.5d0 * sqrt((2.0d0 * (re + im)))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -8.5e+243) {
tmp = 0.5 * Math.sqrt((2.0 * (re - re)));
} else if (re <= 5.3e-76) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else if ((re <= 9e-44) || !(re <= 8e+54)) {
tmp = 0.5 * (2.0 * Math.sqrt(re));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (re + im)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -8.5e+243: tmp = 0.5 * math.sqrt((2.0 * (re - re))) elif re <= 5.3e-76: tmp = 0.5 * math.sqrt((2.0 * im)) elif (re <= 9e-44) or not (re <= 8e+54): tmp = 0.5 * (2.0 * math.sqrt(re)) else: tmp = 0.5 * math.sqrt((2.0 * (re + im))) return tmp
function code(re, im) tmp = 0.0 if (re <= -8.5e+243) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re - re)))); elseif (re <= 5.3e-76) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); elseif ((re <= 9e-44) || !(re <= 8e+54)) tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -8.5e+243) tmp = 0.5 * sqrt((2.0 * (re - re))); elseif (re <= 5.3e-76) tmp = 0.5 * sqrt((2.0 * im)); elseif ((re <= 9e-44) || ~((re <= 8e+54))) tmp = 0.5 * (2.0 * sqrt(re)); else tmp = 0.5 * sqrt((2.0 * (re + im))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -8.5e+243], N[(0.5 * N[Sqrt[N[(2.0 * N[(re - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 5.3e-76], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 9e-44], N[Not[LessEqual[re, 8e+54]], $MachinePrecision]], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -8.5 \cdot 10^{+243}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re - re\right)}\\
\mathbf{elif}\;re \leq 5.3 \cdot 10^{-76}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{elif}\;re \leq 9 \cdot 10^{-44} \lor \neg \left(re \leq 8 \cdot 10^{+54}\right):\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\
\end{array}
\end{array}
if re < -8.50000000000000026e243Initial program 2.1%
Taylor expanded in re around -inf 36.6%
mul-1-neg36.6%
Simplified36.6%
if -8.50000000000000026e243 < re < 5.3e-76Initial program 35.8%
sqr-neg35.8%
+-commutative35.8%
sqr-neg35.8%
+-commutative35.8%
distribute-rgt-in35.8%
cancel-sign-sub35.8%
distribute-rgt-out--35.8%
sub-neg35.8%
remove-double-neg35.8%
+-commutative35.8%
hypot-define69.4%
Simplified69.4%
Taylor expanded in re around 0 35.0%
*-commutative35.0%
Simplified35.0%
if 5.3e-76 < re < 8.9999999999999997e-44 or 8.0000000000000006e54 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
if 8.9999999999999997e-44 < re < 8.0000000000000006e54Initial program 70.0%
sqr-neg70.0%
+-commutative70.0%
sqr-neg70.0%
+-commutative70.0%
distribute-rgt-in70.0%
cancel-sign-sub70.0%
distribute-rgt-out--70.0%
sub-neg70.0%
remove-double-neg70.0%
+-commutative70.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in re around 0 50.0%
distribute-lft-out50.0%
*-commutative50.0%
Simplified50.0%
Final simplification46.4%
(FPCore (re im)
:precision binary64
(if (<= re 3.4e-76)
(* 0.5 (sqrt (* 2.0 im)))
(if (or (<= re 2.7e-37) (not (<= re 2.9e+55)))
(* 0.5 (* 2.0 (sqrt re)))
(* 0.5 (sqrt (* 2.0 (+ re im)))))))
double code(double re, double im) {
double tmp;
if (re <= 3.4e-76) {
tmp = 0.5 * sqrt((2.0 * im));
} else if ((re <= 2.7e-37) || !(re <= 2.9e+55)) {
tmp = 0.5 * (2.0 * sqrt(re));
} else {
tmp = 0.5 * sqrt((2.0 * (re + im)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= 3.4d-76) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else if ((re <= 2.7d-37) .or. (.not. (re <= 2.9d+55))) then
tmp = 0.5d0 * (2.0d0 * sqrt(re))
else
tmp = 0.5d0 * sqrt((2.0d0 * (re + im)))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 3.4e-76) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else if ((re <= 2.7e-37) || !(re <= 2.9e+55)) {
tmp = 0.5 * (2.0 * Math.sqrt(re));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (re + im)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 3.4e-76: tmp = 0.5 * math.sqrt((2.0 * im)) elif (re <= 2.7e-37) or not (re <= 2.9e+55): tmp = 0.5 * (2.0 * math.sqrt(re)) else: tmp = 0.5 * math.sqrt((2.0 * (re + im))) return tmp
function code(re, im) tmp = 0.0 if (re <= 3.4e-76) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); elseif ((re <= 2.7e-37) || !(re <= 2.9e+55)) tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 3.4e-76) tmp = 0.5 * sqrt((2.0 * im)); elseif ((re <= 2.7e-37) || ~((re <= 2.9e+55))) tmp = 0.5 * (2.0 * sqrt(re)); else tmp = 0.5 * sqrt((2.0 * (re + im))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 3.4e-76], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 2.7e-37], N[Not[LessEqual[re, 2.9e+55]], $MachinePrecision]], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 3.4 \cdot 10^{-76}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{elif}\;re \leq 2.7 \cdot 10^{-37} \lor \neg \left(re \leq 2.9 \cdot 10^{+55}\right):\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\
\end{array}
\end{array}
if re < 3.3999999999999999e-76Initial program 33.1%
sqr-neg33.1%
+-commutative33.1%
sqr-neg33.1%
+-commutative33.1%
distribute-rgt-in33.1%
cancel-sign-sub33.1%
distribute-rgt-out--33.1%
sub-neg33.1%
remove-double-neg33.1%
+-commutative33.1%
hypot-define66.8%
Simplified66.8%
Taylor expanded in re around 0 32.4%
*-commutative32.4%
Simplified32.4%
if 3.3999999999999999e-76 < re < 2.70000000000000016e-37 or 2.8999999999999999e55 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
if 2.70000000000000016e-37 < re < 2.8999999999999999e55Initial program 70.0%
sqr-neg70.0%
+-commutative70.0%
sqr-neg70.0%
+-commutative70.0%
distribute-rgt-in70.0%
cancel-sign-sub70.0%
distribute-rgt-out--70.0%
sub-neg70.0%
remove-double-neg70.0%
+-commutative70.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in re around 0 50.0%
distribute-lft-out50.0%
*-commutative50.0%
Simplified50.0%
Final simplification44.4%
(FPCore (re im) :precision binary64 (if (or (<= re 4.6e-83) (and (not (<= re 2.8e-38)) (<= re 7.5e+54))) (* 0.5 (sqrt (* 2.0 im))) (* 0.5 (* 2.0 (sqrt re)))))
double code(double re, double im) {
double tmp;
if ((re <= 4.6e-83) || (!(re <= 2.8e-38) && (re <= 7.5e+54))) {
tmp = 0.5 * sqrt((2.0 * im));
} else {
tmp = 0.5 * (2.0 * sqrt(re));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if ((re <= 4.6d-83) .or. (.not. (re <= 2.8d-38)) .and. (re <= 7.5d+54)) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else
tmp = 0.5d0 * (2.0d0 * sqrt(re))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((re <= 4.6e-83) || (!(re <= 2.8e-38) && (re <= 7.5e+54))) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else {
tmp = 0.5 * (2.0 * Math.sqrt(re));
}
return tmp;
}
def code(re, im): tmp = 0 if (re <= 4.6e-83) or (not (re <= 2.8e-38) and (re <= 7.5e+54)): tmp = 0.5 * math.sqrt((2.0 * im)) else: tmp = 0.5 * (2.0 * math.sqrt(re)) return tmp
function code(re, im) tmp = 0.0 if ((re <= 4.6e-83) || (!(re <= 2.8e-38) && (re <= 7.5e+54))) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); else tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((re <= 4.6e-83) || (~((re <= 2.8e-38)) && (re <= 7.5e+54))) tmp = 0.5 * sqrt((2.0 * im)); else tmp = 0.5 * (2.0 * sqrt(re)); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[re, 4.6e-83], And[N[Not[LessEqual[re, 2.8e-38]], $MachinePrecision], LessEqual[re, 7.5e+54]]], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 4.6 \cdot 10^{-83} \lor \neg \left(re \leq 2.8 \cdot 10^{-38}\right) \land re \leq 7.5 \cdot 10^{+54}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\end{array}
\end{array}
if re < 4.59999999999999979e-83 or 2.8e-38 < re < 7.50000000000000042e54Initial program 36.0%
sqr-neg36.0%
+-commutative36.0%
sqr-neg36.0%
+-commutative36.0%
distribute-rgt-in36.0%
cancel-sign-sub36.0%
distribute-rgt-out--36.0%
sub-neg36.0%
remove-double-neg36.0%
+-commutative36.0%
hypot-define69.4%
Simplified69.4%
Taylor expanded in re around 0 33.4%
*-commutative33.4%
Simplified33.4%
if 4.59999999999999979e-83 < re < 2.8e-38 or 7.50000000000000042e54 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
Final simplification44.1%
(FPCore (re im) :precision binary64 (* 0.5 (sqrt (* 2.0 im))))
double code(double re, double im) {
return 0.5 * sqrt((2.0 * im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 0.5d0 * sqrt((2.0d0 * im))
end function
public static double code(double re, double im) {
return 0.5 * Math.sqrt((2.0 * im));
}
def code(re, im): return 0.5 * math.sqrt((2.0 * im))
function code(re, im) return Float64(0.5 * sqrt(Float64(2.0 * im))) end
function tmp = code(re, im) tmp = 0.5 * sqrt((2.0 * im)); end
code[re_, im_] := N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \sqrt{2 \cdot im}
\end{array}
Initial program 37.4%
sqr-neg37.4%
+-commutative37.4%
sqr-neg37.4%
+-commutative37.4%
distribute-rgt-in37.4%
cancel-sign-sub37.4%
distribute-rgt-out--37.4%
sub-neg37.4%
remove-double-neg37.4%
+-commutative37.4%
hypot-define76.0%
Simplified76.0%
Taylor expanded in re around 0 29.6%
*-commutative29.6%
Simplified29.6%
Final simplification29.6%
(FPCore (re im)
:precision binary64
(let* ((t_0 (sqrt (+ (* re re) (* im im)))))
(if (< re 0.0)
(* 0.5 (* (sqrt 2.0) (sqrt (/ (* im im) (- t_0 re)))))
(* 0.5 (sqrt (* 2.0 (+ t_0 re)))))))
double code(double re, double im) {
double t_0 = sqrt(((re * re) + (im * im)));
double tmp;
if (re < 0.0) {
tmp = 0.5 * (sqrt(2.0) * sqrt(((im * im) / (t_0 - re))));
} else {
tmp = 0.5 * sqrt((2.0 * (t_0 + re)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((re * re) + (im * im)))
if (re < 0.0d0) then
tmp = 0.5d0 * (sqrt(2.0d0) * sqrt(((im * im) / (t_0 - re))))
else
tmp = 0.5d0 * sqrt((2.0d0 * (t_0 + re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = Math.sqrt(((re * re) + (im * im)));
double tmp;
if (re < 0.0) {
tmp = 0.5 * (Math.sqrt(2.0) * Math.sqrt(((im * im) / (t_0 - re))));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (t_0 + re)));
}
return tmp;
}
def code(re, im): t_0 = math.sqrt(((re * re) + (im * im))) tmp = 0 if re < 0.0: tmp = 0.5 * (math.sqrt(2.0) * math.sqrt(((im * im) / (t_0 - re)))) else: tmp = 0.5 * math.sqrt((2.0 * (t_0 + re))) return tmp
function code(re, im) t_0 = sqrt(Float64(Float64(re * re) + Float64(im * im))) tmp = 0.0 if (re < 0.0) tmp = Float64(0.5 * Float64(sqrt(2.0) * sqrt(Float64(Float64(im * im) / Float64(t_0 - re))))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(t_0 + re)))); end return tmp end
function tmp_2 = code(re, im) t_0 = sqrt(((re * re) + (im * im))); tmp = 0.0; if (re < 0.0) tmp = 0.5 * (sqrt(2.0) * sqrt(((im * im) / (t_0 - re)))); else tmp = 0.5 * sqrt((2.0 * (t_0 + re))); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[Less[re, 0.0], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(N[(im * im), $MachinePrecision] / N[(t$95$0 - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(t$95$0 + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sqrt{re \cdot re + im \cdot im}\\
\mathbf{if}\;re < 0:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \sqrt{\frac{im \cdot im}{t\_0 - re}}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(t\_0 + re\right)}\\
\end{array}
\end{array}
herbie shell --seed 2024039
(FPCore (re im)
:name "math.sqrt on complex, real part"
:precision binary64
:herbie-target
(if (< re 0.0) (* 0.5 (* (sqrt 2.0) (sqrt (/ (* im im) (- (sqrt (+ (* re re) (* im im))) re))))) (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))
(* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))