
(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 5 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 (/ (* im (- im)) re))) (sqrt (* 0.5 (+ 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(((im * -im) / re));
} else {
tmp = sqrt((0.5 * (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(((im * -im) / re));
} else {
tmp = Math.sqrt((0.5 * (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(((im * -im) / re)) else: tmp = math.sqrt((0.5 * (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(im * Float64(-im)) / re))); else tmp = sqrt(Float64(0.5 * 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 * -im) / re)); else tmp = sqrt((0.5 * (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[(im * (-im)), $MachinePrecision] / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(0.5 * N[(re + N[Sqrt[re ^ 2 + im ^ 2], $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 \cdot \left(-im\right)}{re}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 \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 14.9%
sqr-neg14.9%
+-commutative14.9%
sqr-neg14.9%
distribute-rgt-in14.9%
cancel-sign-sub14.9%
distribute-rgt-out--14.9%
sub-neg14.9%
remove-double-neg14.9%
hypot-def14.9%
Simplified14.9%
Taylor expanded in re around -inf 52.6%
associate-*r/52.6%
unpow252.6%
associate-*r*52.6%
mul-1-neg52.6%
Simplified52.6%
if 0.0 < (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) Initial program 50.3%
sqr-neg50.3%
+-commutative50.3%
sqr-neg50.3%
distribute-rgt-in50.3%
cancel-sign-sub50.3%
distribute-rgt-out--50.3%
sub-neg50.3%
remove-double-neg50.3%
hypot-def89.0%
Simplified89.0%
add-sqr-sqrt88.5%
sqrt-unprod89.0%
*-commutative89.0%
*-commutative89.0%
swap-sqr89.0%
add-sqr-sqrt89.0%
*-commutative89.0%
metadata-eval89.0%
Applied egg-rr89.0%
associate-*l*89.5%
metadata-eval89.5%
Simplified89.5%
Final simplification85.4%
(FPCore (re im)
:precision binary64
(if (<= re -7e+70)
(* 0.5 (sqrt (/ (* im (- im)) re)))
(if (<= re 2e-86)
(* 0.5 (sqrt (* 2.0 im)))
(if (<= re 2.35e-66)
(sqrt re)
(if (<= re 4.2e+26) (* 0.5 (sqrt (* 2.0 (+ re im)))) (sqrt re))))))
double code(double re, double im) {
double tmp;
if (re <= -7e+70) {
tmp = 0.5 * sqrt(((im * -im) / re));
} else if (re <= 2e-86) {
tmp = 0.5 * sqrt((2.0 * im));
} else if (re <= 2.35e-66) {
tmp = sqrt(re);
} else if (re <= 4.2e+26) {
tmp = 0.5 * sqrt((2.0 * (re + im)));
} else {
tmp = 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 <= (-7d+70)) then
tmp = 0.5d0 * sqrt(((im * -im) / re))
else if (re <= 2d-86) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else if (re <= 2.35d-66) then
tmp = sqrt(re)
else if (re <= 4.2d+26) then
tmp = 0.5d0 * sqrt((2.0d0 * (re + im)))
else
tmp = sqrt(re)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -7e+70) {
tmp = 0.5 * Math.sqrt(((im * -im) / re));
} else if (re <= 2e-86) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else if (re <= 2.35e-66) {
tmp = Math.sqrt(re);
} else if (re <= 4.2e+26) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im)));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -7e+70: tmp = 0.5 * math.sqrt(((im * -im) / re)) elif re <= 2e-86: tmp = 0.5 * math.sqrt((2.0 * im)) elif re <= 2.35e-66: tmp = math.sqrt(re) elif re <= 4.2e+26: tmp = 0.5 * math.sqrt((2.0 * (re + im))) else: tmp = math.sqrt(re) return tmp
function code(re, im) tmp = 0.0 if (re <= -7e+70) tmp = Float64(0.5 * sqrt(Float64(Float64(im * Float64(-im)) / re))); elseif (re <= 2e-86) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); elseif (re <= 2.35e-66) tmp = sqrt(re); elseif (re <= 4.2e+26) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im)))); else tmp = sqrt(re); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -7e+70) tmp = 0.5 * sqrt(((im * -im) / re)); elseif (re <= 2e-86) tmp = 0.5 * sqrt((2.0 * im)); elseif (re <= 2.35e-66) tmp = sqrt(re); elseif (re <= 4.2e+26) tmp = 0.5 * sqrt((2.0 * (re + im))); else tmp = sqrt(re); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -7e+70], N[(0.5 * N[Sqrt[N[(N[(im * (-im)), $MachinePrecision] / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 2e-86], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 2.35e-66], N[Sqrt[re], $MachinePrecision], If[LessEqual[re, 4.2e+26], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -7 \cdot 10^{+70}:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{im \cdot \left(-im\right)}{re}}\\
\mathbf{elif}\;re \leq 2 \cdot 10^{-86}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{elif}\;re \leq 2.35 \cdot 10^{-66}:\\
\;\;\;\;\sqrt{re}\\
\mathbf{elif}\;re \leq 4.2 \cdot 10^{+26}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -7.00000000000000005e70Initial program 12.6%
sqr-neg12.6%
+-commutative12.6%
sqr-neg12.6%
distribute-rgt-in12.6%
cancel-sign-sub12.6%
distribute-rgt-out--12.6%
sub-neg12.6%
remove-double-neg12.6%
hypot-def43.9%
Simplified43.9%
Taylor expanded in re around -inf 47.8%
associate-*r/47.8%
unpow247.8%
associate-*r*47.8%
mul-1-neg47.8%
Simplified47.8%
if -7.00000000000000005e70 < re < 2.00000000000000017e-86Initial program 53.7%
sqr-neg53.7%
+-commutative53.7%
sqr-neg53.7%
distribute-rgt-in53.7%
cancel-sign-sub53.7%
distribute-rgt-out--53.7%
sub-neg53.7%
remove-double-neg53.7%
hypot-def81.3%
Simplified81.3%
Taylor expanded in re around 0 41.5%
*-commutative41.5%
Simplified41.5%
if 2.00000000000000017e-86 < re < 2.35e-66 or 4.2000000000000002e26 < re Initial program 49.0%
sqr-neg49.0%
+-commutative49.0%
sqr-neg49.0%
distribute-rgt-in49.0%
cancel-sign-sub49.0%
distribute-rgt-out--49.0%
sub-neg49.0%
remove-double-neg49.0%
hypot-def98.5%
Simplified98.5%
Taylor expanded in im around 0 83.3%
*-commutative83.3%
unpow283.3%
rem-square-sqrt84.9%
associate-*r*84.9%
metadata-eval84.9%
*-lft-identity84.9%
Simplified84.9%
if 2.35e-66 < re < 4.2000000000000002e26Initial program 63.2%
sqr-neg63.2%
+-commutative63.2%
sqr-neg63.2%
distribute-rgt-in63.2%
cancel-sign-sub63.2%
distribute-rgt-out--63.2%
sub-neg63.2%
remove-double-neg63.2%
hypot-def100.0%
Simplified100.0%
Taylor expanded in re around 0 39.3%
distribute-lft-out39.3%
*-commutative39.3%
Simplified39.3%
Final simplification52.9%
(FPCore (re im)
:precision binary64
(if (<= re 6.6e-87)
(* 0.5 (sqrt (* 2.0 im)))
(if (<= re 2.5e-64)
(sqrt re)
(if (<= re 3.2e+27) (* 0.5 (sqrt (* 2.0 (+ re im)))) (sqrt re)))))
double code(double re, double im) {
double tmp;
if (re <= 6.6e-87) {
tmp = 0.5 * sqrt((2.0 * im));
} else if (re <= 2.5e-64) {
tmp = sqrt(re);
} else if (re <= 3.2e+27) {
tmp = 0.5 * sqrt((2.0 * (re + im)));
} else {
tmp = 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 <= 6.6d-87) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else if (re <= 2.5d-64) then
tmp = sqrt(re)
else if (re <= 3.2d+27) then
tmp = 0.5d0 * sqrt((2.0d0 * (re + im)))
else
tmp = sqrt(re)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 6.6e-87) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else if (re <= 2.5e-64) {
tmp = Math.sqrt(re);
} else if (re <= 3.2e+27) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im)));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 6.6e-87: tmp = 0.5 * math.sqrt((2.0 * im)) elif re <= 2.5e-64: tmp = math.sqrt(re) elif re <= 3.2e+27: tmp = 0.5 * math.sqrt((2.0 * (re + im))) else: tmp = math.sqrt(re) return tmp
function code(re, im) tmp = 0.0 if (re <= 6.6e-87) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); elseif (re <= 2.5e-64) tmp = sqrt(re); elseif (re <= 3.2e+27) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im)))); else tmp = sqrt(re); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 6.6e-87) tmp = 0.5 * sqrt((2.0 * im)); elseif (re <= 2.5e-64) tmp = sqrt(re); elseif (re <= 3.2e+27) tmp = 0.5 * sqrt((2.0 * (re + im))); else tmp = sqrt(re); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 6.6e-87], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 2.5e-64], N[Sqrt[re], $MachinePrecision], If[LessEqual[re, 3.2e+27], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 6.6 \cdot 10^{-87}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{elif}\;re \leq 2.5 \cdot 10^{-64}:\\
\;\;\;\;\sqrt{re}\\
\mathbf{elif}\;re \leq 3.2 \cdot 10^{+27}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < 6.6000000000000001e-87Initial program 42.9%
sqr-neg42.9%
+-commutative42.9%
sqr-neg42.9%
distribute-rgt-in42.9%
cancel-sign-sub42.9%
distribute-rgt-out--42.9%
sub-neg42.9%
remove-double-neg42.9%
hypot-def71.5%
Simplified71.5%
Taylor expanded in re around 0 32.5%
*-commutative32.5%
Simplified32.5%
if 6.6000000000000001e-87 < re < 2.50000000000000017e-64 or 3.20000000000000015e27 < re Initial program 49.0%
sqr-neg49.0%
+-commutative49.0%
sqr-neg49.0%
distribute-rgt-in49.0%
cancel-sign-sub49.0%
distribute-rgt-out--49.0%
sub-neg49.0%
remove-double-neg49.0%
hypot-def98.5%
Simplified98.5%
Taylor expanded in im around 0 83.3%
*-commutative83.3%
unpow283.3%
rem-square-sqrt84.9%
associate-*r*84.9%
metadata-eval84.9%
*-lft-identity84.9%
Simplified84.9%
if 2.50000000000000017e-64 < re < 3.20000000000000015e27Initial program 63.2%
sqr-neg63.2%
+-commutative63.2%
sqr-neg63.2%
distribute-rgt-in63.2%
cancel-sign-sub63.2%
distribute-rgt-out--63.2%
sub-neg63.2%
remove-double-neg63.2%
hypot-def100.0%
Simplified100.0%
Taylor expanded in re around 0 39.3%
distribute-lft-out39.3%
*-commutative39.3%
Simplified39.3%
Final simplification45.9%
(FPCore (re im) :precision binary64 (if (or (<= re 3e-86) (and (not (<= re 40000000.0)) (<= re 2.3e+26))) (* 0.5 (sqrt (* 2.0 im))) (sqrt re)))
double code(double re, double im) {
double tmp;
if ((re <= 3e-86) || (!(re <= 40000000.0) && (re <= 2.3e+26))) {
tmp = 0.5 * sqrt((2.0 * im));
} else {
tmp = 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 <= 3d-86) .or. (.not. (re <= 40000000.0d0)) .and. (re <= 2.3d+26)) then
tmp = 0.5d0 * sqrt((2.0d0 * im))
else
tmp = sqrt(re)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((re <= 3e-86) || (!(re <= 40000000.0) && (re <= 2.3e+26))) {
tmp = 0.5 * Math.sqrt((2.0 * im));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
def code(re, im): tmp = 0 if (re <= 3e-86) or (not (re <= 40000000.0) and (re <= 2.3e+26)): tmp = 0.5 * math.sqrt((2.0 * im)) else: tmp = math.sqrt(re) return tmp
function code(re, im) tmp = 0.0 if ((re <= 3e-86) || (!(re <= 40000000.0) && (re <= 2.3e+26))) tmp = Float64(0.5 * sqrt(Float64(2.0 * im))); else tmp = sqrt(re); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((re <= 3e-86) || (~((re <= 40000000.0)) && (re <= 2.3e+26))) tmp = 0.5 * sqrt((2.0 * im)); else tmp = sqrt(re); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[re, 3e-86], And[N[Not[LessEqual[re, 40000000.0]], $MachinePrecision], LessEqual[re, 2.3e+26]]], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 3 \cdot 10^{-86} \lor \neg \left(re \leq 40000000\right) \land re \leq 2.3 \cdot 10^{+26}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < 3.0000000000000001e-86 or 4e7 < re < 2.3000000000000001e26Initial program 43.8%
sqr-neg43.8%
+-commutative43.8%
sqr-neg43.8%
distribute-rgt-in43.8%
cancel-sign-sub43.8%
distribute-rgt-out--43.8%
sub-neg43.8%
remove-double-neg43.8%
hypot-def73.3%
Simplified73.3%
Taylor expanded in re around 0 32.3%
*-commutative32.3%
Simplified32.3%
if 3.0000000000000001e-86 < re < 4e7 or 2.3000000000000001e26 < re Initial program 52.7%
sqr-neg52.7%
+-commutative52.7%
sqr-neg52.7%
distribute-rgt-in52.7%
cancel-sign-sub52.7%
distribute-rgt-out--52.7%
sub-neg52.7%
remove-double-neg52.7%
hypot-def98.8%
Simplified98.8%
Taylor expanded in im around 0 77.8%
*-commutative77.8%
unpow277.8%
rem-square-sqrt79.3%
associate-*r*79.3%
metadata-eval79.3%
*-lft-identity79.3%
Simplified79.3%
Final simplification46.4%
(FPCore (re im) :precision binary64 (sqrt re))
double code(double re, double im) {
return sqrt(re);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = sqrt(re)
end function
public static double code(double re, double im) {
return Math.sqrt(re);
}
def code(re, im): return math.sqrt(re)
function code(re, im) return sqrt(re) end
function tmp = code(re, im) tmp = sqrt(re); end
code[re_, im_] := N[Sqrt[re], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{re}
\end{array}
Initial program 46.5%
sqr-neg46.5%
+-commutative46.5%
sqr-neg46.5%
distribute-rgt-in46.5%
cancel-sign-sub46.5%
distribute-rgt-out--46.5%
sub-neg46.5%
remove-double-neg46.5%
hypot-def80.9%
Simplified80.9%
Taylor expanded in im around 0 29.4%
*-commutative29.4%
unpow229.4%
rem-square-sqrt30.0%
associate-*r*30.0%
metadata-eval30.0%
*-lft-identity30.0%
Simplified30.0%
Final simplification30.0%
(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 2023293
(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)))))