
(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}
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 (pow (- 0.0 re) 0.5))) (* 0.5 (sqrt (* 2.0 (+ 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 / pow((0.0 - re), 0.5));
} else {
tmp = 0.5 * sqrt((2.0 * (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.pow((0.0 - re), 0.5));
} else {
tmp = 0.5 * Math.sqrt((2.0 * (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.pow((0.0 - re), 0.5)) else: tmp = 0.5 * math.sqrt((2.0 * (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 / (Float64(0.0 - re) ^ 0.5))); else tmp = Float64(0.5 * sqrt(Float64(2.0 * 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 / ((0.0 - re) ^ 0.5)); else tmp = 0.5 * sqrt((2.0 * (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[Power[N[(0.0 - re), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $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}{{\left(0 - re\right)}^{0.5}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \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 9.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6420.0%
Simplified20.0%
Taylor expanded in re around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6458.8%
Simplified58.8%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6470.3%
Applied egg-rr70.3%
*-commutativeN/A
sub0-negN/A
associate-*l/N/A
distribute-frac-negN/A
sub0-negN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr59.5%
if 0.0 < (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) Initial program 46.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6489.3%
Simplified89.3%
Final simplification85.4%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= re -1.3e-88)
(* 0.5 (/ im_m (pow (- 0.0 re) 0.5)))
(if (<= re 1.8e+19)
(* 0.5 (sqrt (* 2.0 (+ re im_m))))
(* 0.5 (sqrt (+ (* re 4.0) (* im_m (/ im_m re))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -1.3e-88) {
tmp = 0.5 * (im_m / pow((0.0 - re), 0.5));
} else if (re <= 1.8e+19) {
tmp = 0.5 * sqrt((2.0 * (re + im_m)));
} else {
tmp = 0.5 * sqrt(((re * 4.0) + (im_m * (im_m / 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 <= (-1.3d-88)) then
tmp = 0.5d0 * (im_m / ((0.0d0 - re) ** 0.5d0))
else if (re <= 1.8d+19) then
tmp = 0.5d0 * sqrt((2.0d0 * (re + im_m)))
else
tmp = 0.5d0 * sqrt(((re * 4.0d0) + (im_m * (im_m / 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 <= -1.3e-88) {
tmp = 0.5 * (im_m / Math.pow((0.0 - re), 0.5));
} else if (re <= 1.8e+19) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im_m)));
} else {
tmp = 0.5 * Math.sqrt(((re * 4.0) + (im_m * (im_m / re))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -1.3e-88: tmp = 0.5 * (im_m / math.pow((0.0 - re), 0.5)) elif re <= 1.8e+19: tmp = 0.5 * math.sqrt((2.0 * (re + im_m))) else: tmp = 0.5 * math.sqrt(((re * 4.0) + (im_m * (im_m / re)))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -1.3e-88) tmp = Float64(0.5 * Float64(im_m / (Float64(0.0 - re) ^ 0.5))); elseif (re <= 1.8e+19) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im_m)))); else tmp = Float64(0.5 * sqrt(Float64(Float64(re * 4.0) + Float64(im_m * Float64(im_m / re))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -1.3e-88) tmp = 0.5 * (im_m / ((0.0 - re) ^ 0.5)); elseif (re <= 1.8e+19) tmp = 0.5 * sqrt((2.0 * (re + im_m))); else tmp = 0.5 * sqrt(((re * 4.0) + (im_m * (im_m / re)))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -1.3e-88], N[(0.5 * N[(im$95$m / N[Power[N[(0.0 - re), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.8e+19], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(re * 4.0), $MachinePrecision] + N[(im$95$m * N[(im$95$m / re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.3 \cdot 10^{-88}:\\
\;\;\;\;0.5 \cdot \frac{im\_m}{{\left(0 - re\right)}^{0.5}}\\
\mathbf{elif}\;re \leq 1.8 \cdot 10^{+19}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot 4 + im\_m \cdot \frac{im\_m}{re}}\\
\end{array}
\end{array}
if re < -1.30000000000000007e-88Initial program 18.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6443.0%
Simplified43.0%
Taylor expanded in re around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6449.5%
Simplified49.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6455.7%
Applied egg-rr55.7%
*-commutativeN/A
sub0-negN/A
associate-*l/N/A
distribute-frac-negN/A
sub0-negN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr37.0%
if -1.30000000000000007e-88 < re < 1.8e19Initial program 64.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6495.0%
Simplified95.0%
Taylor expanded in re around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6450.8%
Simplified50.8%
if 1.8e19 < re Initial program 31.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in im around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6473.3%
Simplified73.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6477.6%
Applied egg-rr77.6%
Final simplification53.8%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -1.95e-88) (* 0.5 (/ im_m (pow (- 0.0 re) 0.5))) (if (<= re 3.8e+30) (* 0.5 (sqrt (* 2.0 (+ re im_m)))) (sqrt re))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -1.95e-88) {
tmp = 0.5 * (im_m / pow((0.0 - re), 0.5));
} else if (re <= 3.8e+30) {
tmp = 0.5 * sqrt((2.0 * (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) :: tmp
if (re <= (-1.95d-88)) then
tmp = 0.5d0 * (im_m / ((0.0d0 - re) ** 0.5d0))
else if (re <= 3.8d+30) then
tmp = 0.5d0 * sqrt((2.0d0 * (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 tmp;
if (re <= -1.95e-88) {
tmp = 0.5 * (im_m / Math.pow((0.0 - re), 0.5));
} else if (re <= 3.8e+30) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im_m)));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -1.95e-88: tmp = 0.5 * (im_m / math.pow((0.0 - re), 0.5)) elif re <= 3.8e+30: tmp = 0.5 * math.sqrt((2.0 * (re + im_m))) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -1.95e-88) tmp = Float64(0.5 * Float64(im_m / (Float64(0.0 - re) ^ 0.5))); elseif (re <= 3.8e+30) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im_m)))); else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -1.95e-88) tmp = 0.5 * (im_m / ((0.0 - re) ^ 0.5)); elseif (re <= 3.8e+30) tmp = 0.5 * sqrt((2.0 * (re + im_m))); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -1.95e-88], N[(0.5 * N[(im$95$m / N[Power[N[(0.0 - re), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.8e+30], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.95 \cdot 10^{-88}:\\
\;\;\;\;0.5 \cdot \frac{im\_m}{{\left(0 - re\right)}^{0.5}}\\
\mathbf{elif}\;re \leq 3.8 \cdot 10^{+30}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -1.94999999999999996e-88Initial program 18.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6443.0%
Simplified43.0%
Taylor expanded in re around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6449.5%
Simplified49.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6455.7%
Applied egg-rr55.7%
*-commutativeN/A
sub0-negN/A
associate-*l/N/A
distribute-frac-negN/A
sub0-negN/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr37.0%
if -1.94999999999999996e-88 < re < 3.8000000000000001e30Initial program 64.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6495.1%
Simplified95.1%
Taylor expanded in re around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6449.8%
Simplified49.8%
if 3.8000000000000001e30 < re Initial program 30.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6478.7%
Simplified78.7%
*-lft-identityN/A
sqrt-lowering-sqrt.f6478.7%
Applied egg-rr78.7%
Final simplification53.4%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -3.3e+75) (* 0.5 (sqrt (/ (- 0.0 im_m) (/ re im_m)))) (if (<= re 2.6e+31) (* 0.5 (sqrt (* 2.0 (+ re im_m)))) (sqrt re))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -3.3e+75) {
tmp = 0.5 * sqrt(((0.0 - im_m) / (re / im_m)));
} else if (re <= 2.6e+31) {
tmp = 0.5 * sqrt((2.0 * (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) :: tmp
if (re <= (-3.3d+75)) then
tmp = 0.5d0 * sqrt(((0.0d0 - im_m) / (re / im_m)))
else if (re <= 2.6d+31) then
tmp = 0.5d0 * sqrt((2.0d0 * (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 tmp;
if (re <= -3.3e+75) {
tmp = 0.5 * Math.sqrt(((0.0 - im_m) / (re / im_m)));
} else if (re <= 2.6e+31) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im_m)));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -3.3e+75: tmp = 0.5 * math.sqrt(((0.0 - im_m) / (re / im_m))) elif re <= 2.6e+31: tmp = 0.5 * math.sqrt((2.0 * (re + im_m))) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -3.3e+75) tmp = Float64(0.5 * sqrt(Float64(Float64(0.0 - im_m) / Float64(re / im_m)))); elseif (re <= 2.6e+31) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im_m)))); 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.3e+75) tmp = 0.5 * sqrt(((0.0 - im_m) / (re / im_m))); elseif (re <= 2.6e+31) tmp = 0.5 * sqrt((2.0 * (re + im_m))); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -3.3e+75], N[(0.5 * N[Sqrt[N[(N[(0.0 - im$95$m), $MachinePrecision] / N[(re / im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 2.6e+31], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -3.3 \cdot 10^{+75}:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{0 - im\_m}{\frac{re}{im\_m}}}\\
\mathbf{elif}\;re \leq 2.6 \cdot 10^{+31}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -3.29999999999999998e75Initial program 8.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6435.5%
Simplified35.5%
Taylor expanded in re around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6456.7%
Simplified56.7%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6465.7%
Applied egg-rr65.7%
sub0-negN/A
neg-lowering-neg.f64N/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6465.8%
Applied egg-rr65.8%
if -3.29999999999999998e75 < re < 2.6e31Initial program 56.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6484.5%
Simplified84.5%
Taylor expanded in re around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6443.0%
Simplified43.0%
if 2.6e31 < re Initial program 30.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6478.7%
Simplified78.7%
*-lft-identityN/A
sqrt-lowering-sqrt.f6478.7%
Applied egg-rr78.7%
Final simplification56.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re 2.7e+17) (* 0.5 (sqrt (* im_m 2.0))) (sqrt re)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= 2.7e+17) {
tmp = 0.5 * sqrt((im_m * 2.0));
} 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 <= 2.7d+17) then
tmp = 0.5d0 * sqrt((im_m * 2.0d0))
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 <= 2.7e+17) {
tmp = 0.5 * Math.sqrt((im_m * 2.0));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= 2.7e+17: tmp = 0.5 * math.sqrt((im_m * 2.0)) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= 2.7e+17) tmp = Float64(0.5 * sqrt(Float64(im_m * 2.0))); else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= 2.7e+17) tmp = 0.5 * sqrt((im_m * 2.0)); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, 2.7e+17], N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq 2.7 \cdot 10^{+17}:\\
\;\;\;\;0.5 \cdot \sqrt{im\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < 2.7e17Initial program 44.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6472.6%
Simplified72.6%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6434.4%
Simplified34.4%
if 2.7e17 < re Initial program 31.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6477.3%
Simplified77.3%
*-lft-identityN/A
sqrt-lowering-sqrt.f6477.3%
Applied egg-rr77.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -2e-310) (pow (* re re) 0.25) (sqrt re)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -2e-310) {
tmp = pow((re * re), 0.25);
} 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 <= (-2d-310)) then
tmp = (re * re) ** 0.25d0
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 <= -2e-310) {
tmp = Math.pow((re * re), 0.25);
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -2e-310: tmp = math.pow((re * re), 0.25) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -2e-310) tmp = Float64(re * re) ^ 0.25; else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -2e-310) tmp = (re * re) ^ 0.25; else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -2e-310], N[Power[N[(re * re), $MachinePrecision], 0.25], $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2 \cdot 10^{-310}:\\
\;\;\;\;{\left(re \cdot re\right)}^{0.25}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -1.999999999999994e-310Initial program 33.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6459.9%
Simplified59.9%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f640.0%
Simplified0.0%
*-lft-identityN/A
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
metadata-eval4.7%
Applied egg-rr4.7%
if -1.999999999999994e-310 < re Initial program 49.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6451.8%
Simplified51.8%
*-lft-identityN/A
sqrt-lowering-sqrt.f6451.8%
Applied egg-rr51.8%
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%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6480.1%
Simplified80.1%
Taylor expanded in re around inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
metadata-evalN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6426.1%
Simplified26.1%
*-lft-identityN/A
sqrt-lowering-sqrt.f6426.1%
Applied egg-rr26.1%
(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 2024145
(FPCore (re im)
:name "math.sqrt on complex, real part"
:precision binary64
:alt
(! :herbie-platform default (if (< re 0) (* 1/2 (* (sqrt 2) (sqrt (/ (* im im) (- (modulus re im) re))))) (* 1/2 (sqrt (* 2 (+ (modulus re im) re))))))
(* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))