
(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 4 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}
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= (+ re (sqrt (+ (* re re) (* im_m im_m)))) 0.0) (* 0.5 (/ im_m (sqrt (- re)))) (sqrt (* 0.5 (+ re (hypot re im_m))))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if ((re + sqrt(((re * re) + (im_m * im_m)))) <= 0.0) {
tmp = 0.5 * (im_m / sqrt(-re));
} else {
tmp = sqrt((0.5 * (re + hypot(re, im_m))));
}
return tmp;
}
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if ((re + Math.sqrt(((re * re) + (im_m * im_m)))) <= 0.0) {
tmp = 0.5 * (im_m / Math.sqrt(-re));
} else {
tmp = Math.sqrt((0.5 * (re + Math.hypot(re, im_m))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if (re + math.sqrt(((re * re) + (im_m * im_m)))) <= 0.0: tmp = 0.5 * (im_m / math.sqrt(-re)) else: tmp = math.sqrt((0.5 * (re + math.hypot(re, im_m)))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (Float64(re + sqrt(Float64(Float64(re * re) + Float64(im_m * im_m)))) <= 0.0) tmp = Float64(0.5 * Float64(im_m / sqrt(Float64(-re)))); else tmp = sqrt(Float64(0.5 * Float64(re + hypot(re, im_m)))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if ((re + sqrt(((re * re) + (im_m * im_m)))) <= 0.0) tmp = 0.5 * (im_m / sqrt(-re)); else tmp = sqrt((0.5 * (re + hypot(re, im_m)))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[(0.5 * N[(im$95$m / N[Sqrt[(-re)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(0.5 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re + \sqrt{re \cdot re + im\_m \cdot im\_m} \leq 0:\\
\;\;\;\;0.5 \cdot \frac{im\_m}{\sqrt{-re}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 \cdot \left(re + \mathsf{hypot}\left(re, im\_m\right)\right)}\\
\end{array}
\end{array}
if (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) < 0.0Initial program 6.2%
sqr-neg6.2%
+-commutative6.2%
sqr-neg6.2%
+-commutative6.2%
distribute-rgt-in6.2%
cancel-sign-sub6.2%
distribute-rgt-out--6.2%
sub-neg6.2%
remove-double-neg6.2%
+-commutative6.2%
Simplified13.4%
Taylor expanded in re around -inf 51.2%
*-commutative51.2%
Simplified51.2%
add-cbrt-cube42.2%
pow1/339.8%
add-sqr-sqrt39.8%
pow139.8%
metadata-eval39.8%
pow1/239.8%
pow-prod-up39.8%
*-commutative39.8%
associate-*l*39.8%
metadata-eval39.8%
metadata-eval39.8%
metadata-eval39.8%
Applied egg-rr39.8%
unpow1/342.3%
*-commutative42.3%
associate-*r/42.3%
neg-mul-142.3%
Simplified42.3%
pow1/339.8%
pow-pow51.2%
metadata-eval51.2%
pow1/251.2%
frac-2neg51.2%
sqrt-div54.8%
remove-double-neg54.8%
unpow254.8%
sqrt-prod49.8%
add-sqr-sqrt53.8%
Applied egg-rr53.8%
if 0.0 < (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) Initial program 48.6%
sqr-neg48.6%
+-commutative48.6%
sqr-neg48.6%
+-commutative48.6%
distribute-rgt-in48.6%
cancel-sign-sub48.6%
distribute-rgt-out--48.6%
sub-neg48.6%
remove-double-neg48.6%
+-commutative48.6%
Simplified93.4%
add-sqr-sqrt92.7%
sqrt-unprod93.4%
*-commutative93.4%
*-commutative93.4%
swap-sqr93.4%
add-sqr-sqrt93.4%
*-commutative93.4%
metadata-eval93.4%
Applied egg-rr93.4%
associate-*l*93.4%
metadata-eval93.4%
Simplified93.4%
Final simplification86.6%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(let* ((t_0 (* 0.5 (/ im_m (sqrt (- re))))))
(if (<= re -2.6e+92)
t_0
(if (<= re -1.12e+79)
(sqrt (* im_m 0.5))
(if (<= re -3.1e-79)
t_0
(if (<= re 3.5e-12) (sqrt (* 0.5 (+ re im_m))) (sqrt re)))))))im_m = fabs(im);
double code(double re, double im_m) {
double t_0 = 0.5 * (im_m / sqrt(-re));
double tmp;
if (re <= -2.6e+92) {
tmp = t_0;
} else if (re <= -1.12e+79) {
tmp = sqrt((im_m * 0.5));
} else if (re <= -3.1e-79) {
tmp = t_0;
} else if (re <= 3.5e-12) {
tmp = sqrt((0.5 * (re + im_m)));
} else {
tmp = sqrt(re);
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * (im_m / sqrt(-re))
if (re <= (-2.6d+92)) then
tmp = t_0
else if (re <= (-1.12d+79)) then
tmp = sqrt((im_m * 0.5d0))
else if (re <= (-3.1d-79)) then
tmp = t_0
else if (re <= 3.5d-12) then
tmp = sqrt((0.5d0 * (re + im_m)))
else
tmp = sqrt(re)
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double t_0 = 0.5 * (im_m / Math.sqrt(-re));
double tmp;
if (re <= -2.6e+92) {
tmp = t_0;
} else if (re <= -1.12e+79) {
tmp = Math.sqrt((im_m * 0.5));
} else if (re <= -3.1e-79) {
tmp = t_0;
} else if (re <= 3.5e-12) {
tmp = Math.sqrt((0.5 * (re + im_m)));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): t_0 = 0.5 * (im_m / math.sqrt(-re)) tmp = 0 if re <= -2.6e+92: tmp = t_0 elif re <= -1.12e+79: tmp = math.sqrt((im_m * 0.5)) elif re <= -3.1e-79: tmp = t_0 elif re <= 3.5e-12: tmp = math.sqrt((0.5 * (re + im_m))) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) t_0 = Float64(0.5 * Float64(im_m / sqrt(Float64(-re)))) tmp = 0.0 if (re <= -2.6e+92) tmp = t_0; elseif (re <= -1.12e+79) tmp = sqrt(Float64(im_m * 0.5)); elseif (re <= -3.1e-79) tmp = t_0; elseif (re <= 3.5e-12) tmp = sqrt(Float64(0.5 * Float64(re + im_m))); else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) t_0 = 0.5 * (im_m / sqrt(-re)); tmp = 0.0; if (re <= -2.6e+92) tmp = t_0; elseif (re <= -1.12e+79) tmp = sqrt((im_m * 0.5)); elseif (re <= -3.1e-79) tmp = t_0; elseif (re <= 3.5e-12) tmp = sqrt((0.5 * (re + im_m))); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(0.5 * N[(im$95$m / N[Sqrt[(-re)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -2.6e+92], t$95$0, If[LessEqual[re, -1.12e+79], N[Sqrt[N[(im$95$m * 0.5), $MachinePrecision]], $MachinePrecision], If[LessEqual[re, -3.1e-79], t$95$0, If[LessEqual[re, 3.5e-12], N[Sqrt[N[(0.5 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[re], $MachinePrecision]]]]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
t_0 := 0.5 \cdot \frac{im\_m}{\sqrt{-re}}\\
\mathbf{if}\;re \leq -2.6 \cdot 10^{+92}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;re \leq -1.12 \cdot 10^{+79}:\\
\;\;\;\;\sqrt{im\_m \cdot 0.5}\\
\mathbf{elif}\;re \leq -3.1 \cdot 10^{-79}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;re \leq 3.5 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{0.5 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -2.5999999999999999e92 or -1.12e79 < re < -3.0999999999999999e-79Initial program 12.0%
sqr-neg12.0%
+-commutative12.0%
sqr-neg12.0%
+-commutative12.0%
distribute-rgt-in12.0%
cancel-sign-sub12.0%
distribute-rgt-out--12.0%
sub-neg12.0%
remove-double-neg12.0%
+-commutative12.0%
Simplified37.8%
Taylor expanded in re around -inf 46.7%
*-commutative46.7%
Simplified46.7%
add-cbrt-cube37.5%
pow1/336.1%
add-sqr-sqrt36.1%
pow136.1%
metadata-eval36.1%
pow1/236.1%
pow-prod-up36.1%
*-commutative36.1%
associate-*l*36.1%
metadata-eval36.1%
metadata-eval36.1%
metadata-eval36.1%
Applied egg-rr36.1%
unpow1/337.5%
*-commutative37.5%
associate-*r/37.5%
neg-mul-137.5%
Simplified37.5%
pow1/336.1%
pow-pow46.7%
metadata-eval46.7%
pow1/246.7%
frac-2neg46.7%
sqrt-div55.6%
remove-double-neg55.6%
unpow255.6%
sqrt-prod41.3%
add-sqr-sqrt50.0%
Applied egg-rr50.0%
if -2.5999999999999999e92 < re < -1.12e79Initial program 61.8%
sqr-neg61.8%
+-commutative61.8%
sqr-neg61.8%
+-commutative61.8%
distribute-rgt-in61.8%
cancel-sign-sub61.8%
distribute-rgt-out--61.8%
sub-neg61.8%
remove-double-neg61.8%
+-commutative61.8%
Simplified100.0%
Taylor expanded in re around 0 59.7%
*-commutative59.7%
associate-*l*59.7%
Simplified59.7%
expm1-log1p-u54.0%
expm1-udef54.0%
add-sqr-sqrt54.0%
sqrt-unprod54.0%
swap-sqr54.0%
add-sqr-sqrt54.0%
swap-sqr54.0%
rem-square-sqrt54.0%
metadata-eval54.0%
metadata-eval54.0%
Applied egg-rr54.0%
expm1-def54.0%
expm1-log1p60.0%
Simplified60.0%
if -3.0999999999999999e-79 < re < 3.5e-12Initial program 59.9%
sqr-neg59.9%
+-commutative59.9%
sqr-neg59.9%
+-commutative59.9%
distribute-rgt-in59.9%
cancel-sign-sub59.9%
distribute-rgt-out--59.9%
sub-neg59.9%
remove-double-neg59.9%
+-commutative59.9%
Simplified92.2%
add-sqr-sqrt91.5%
sqrt-unprod92.2%
*-commutative92.2%
*-commutative92.2%
swap-sqr92.2%
add-sqr-sqrt92.2%
*-commutative92.2%
metadata-eval92.2%
Applied egg-rr92.2%
associate-*l*92.2%
metadata-eval92.2%
Simplified92.2%
Taylor expanded in re around 0 38.5%
if 3.5e-12 < re Initial program 39.8%
sqr-neg39.8%
+-commutative39.8%
sqr-neg39.8%
+-commutative39.8%
distribute-rgt-in39.8%
cancel-sign-sub39.8%
distribute-rgt-out--39.8%
sub-neg39.8%
remove-double-neg39.8%
+-commutative39.8%
Simplified100.0%
Taylor expanded in im around 0 80.6%
*-commutative80.6%
unpow280.6%
rem-square-sqrt82.1%
associate-*r*82.1%
metadata-eval82.1%
*-lft-identity82.1%
Simplified82.1%
Final simplification54.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re 3.2e-49) (sqrt (* im_m 0.5)) (sqrt re)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= 3.2e-49) {
tmp = sqrt((im_m * 0.5));
} else {
tmp = sqrt(re);
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (re <= 3.2d-49) then
tmp = sqrt((im_m * 0.5d0))
else
tmp = sqrt(re)
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (re <= 3.2e-49) {
tmp = Math.sqrt((im_m * 0.5));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= 3.2e-49: tmp = math.sqrt((im_m * 0.5)) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= 3.2e-49) tmp = sqrt(Float64(im_m * 0.5)); else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= 3.2e-49) tmp = sqrt((im_m * 0.5)); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, 3.2e-49], N[Sqrt[N[(im$95$m * 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq 3.2 \cdot 10^{-49}:\\
\;\;\;\;\sqrt{im\_m \cdot 0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < 3.20000000000000002e-49Initial program 39.6%
sqr-neg39.6%
+-commutative39.6%
sqr-neg39.6%
+-commutative39.6%
distribute-rgt-in39.6%
cancel-sign-sub39.6%
distribute-rgt-out--39.6%
sub-neg39.6%
remove-double-neg39.6%
+-commutative39.6%
Simplified70.0%
Taylor expanded in re around 0 25.1%
*-commutative25.1%
associate-*l*25.1%
Simplified25.1%
expm1-log1p-u24.1%
expm1-udef16.3%
add-sqr-sqrt16.3%
sqrt-unprod16.3%
swap-sqr16.3%
add-sqr-sqrt16.3%
swap-sqr16.3%
rem-square-sqrt16.3%
metadata-eval16.3%
metadata-eval16.3%
Applied egg-rr16.3%
expm1-def24.2%
expm1-log1p25.3%
Simplified25.3%
if 3.20000000000000002e-49 < re Initial program 45.1%
sqr-neg45.1%
+-commutative45.1%
sqr-neg45.1%
+-commutative45.1%
distribute-rgt-in45.1%
cancel-sign-sub45.1%
distribute-rgt-out--45.1%
sub-neg45.1%
remove-double-neg45.1%
+-commutative45.1%
Simplified100.0%
Taylor expanded in im around 0 76.4%
*-commutative76.4%
unpow276.4%
rem-square-sqrt77.9%
associate-*r*77.9%
metadata-eval77.9%
*-lft-identity77.9%
Simplified77.9%
Final simplification42.2%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (sqrt re))
im_m = fabs(im);
double code(double re, double im_m) {
return sqrt(re);
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = sqrt(re)
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return Math.sqrt(re);
}
im_m = math.fabs(im) def code(re, im_m): return math.sqrt(re)
im_m = abs(im) function code(re, im_m) return sqrt(re) end
im_m = abs(im); function tmp = code(re, im_m) tmp = sqrt(re); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[Sqrt[re], $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\sqrt{re}
\end{array}
Initial program 41.3%
sqr-neg41.3%
+-commutative41.3%
sqr-neg41.3%
+-commutative41.3%
distribute-rgt-in41.3%
cancel-sign-sub41.3%
distribute-rgt-out--41.3%
sub-neg41.3%
remove-double-neg41.3%
+-commutative41.3%
Simplified79.6%
Taylor expanded in im around 0 28.7%
*-commutative28.7%
unpow228.7%
rem-square-sqrt29.2%
associate-*r*29.2%
metadata-eval29.2%
*-lft-identity29.2%
Simplified29.2%
Final simplification29.2%
(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 2024026
(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)))))