
(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 6 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 (<= (sqrt (* 2.0 (+ 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 (sqrt((2.0 * (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 (Math.sqrt((2.0 * (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 math.sqrt((2.0 * (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 (sqrt(Float64(2.0 * 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 (sqrt((2.0 * (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[Sqrt[N[(2.0 * N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $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}\;\sqrt{2 \cdot \left(re + \sqrt{re \cdot re + im\_m \cdot im\_m}\right)} \leq 0:\\
\;\;\;\;0.5 \cdot \left(im\_m \cdot {\left(0 - re\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\_m\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 #s(literal 2 binary64) (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) < 0.0Initial program 9.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f649.8%
Simplified9.8%
Taylor expanded in re around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
unpow2N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6450.9%
Simplified50.9%
Taylor expanded in im around 0
unpow2N/A
*-lowering-*.f6453.4%
Simplified53.4%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
sqrt-prodN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
--lowering--.f6452.7%
Applied egg-rr52.7%
neg-sub0N/A
neg-lowering-neg.f6452.7%
Applied egg-rr52.7%
if 0.0 < (sqrt.f64 (*.f64 #s(literal 2 binary64) (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) Initial program 44.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6488.3%
Simplified88.3%
Final simplification82.9%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -4.8e-32) (/ (* im_m 0.5) (pow (- 0.0 re) 0.5)) (if (<= re 3.9e-22) (* 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 <= -4.8e-32) {
tmp = (im_m * 0.5) / pow((0.0 - re), 0.5);
} else if (re <= 3.9e-22) {
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 <= (-4.8d-32)) then
tmp = (im_m * 0.5d0) / ((0.0d0 - re) ** 0.5d0)
else if (re <= 3.9d-22) 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 <= -4.8e-32) {
tmp = (im_m * 0.5) / Math.pow((0.0 - re), 0.5);
} else if (re <= 3.9e-22) {
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 <= -4.8e-32: tmp = (im_m * 0.5) / math.pow((0.0 - re), 0.5) elif re <= 3.9e-22: 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 <= -4.8e-32) tmp = Float64(Float64(im_m * 0.5) / (Float64(0.0 - re) ^ 0.5)); elseif (re <= 3.9e-22) 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 <= -4.8e-32) tmp = (im_m * 0.5) / ((0.0 - re) ^ 0.5); elseif (re <= 3.9e-22) 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, -4.8e-32], N[(N[(im$95$m * 0.5), $MachinePrecision] / N[Power[N[(0.0 - re), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.9e-22], 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 -4.8 \cdot 10^{-32}:\\
\;\;\;\;\frac{im\_m \cdot 0.5}{{\left(0 - re\right)}^{0.5}}\\
\mathbf{elif}\;re \leq 3.9 \cdot 10^{-22}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -4.8000000000000003e-32Initial program 12.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6430.6%
Simplified30.6%
Taylor expanded in re around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
unpow2N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6436.1%
Simplified36.1%
Taylor expanded in im around 0
unpow2N/A
*-lowering-*.f6444.2%
Simplified44.2%
*-commutativeN/A
sqrt-divN/A
pow1/2N/A
associate-*l/N/A
/-lowering-/.f64N/A
pow1/2N/A
sqrt-prodN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
--lowering--.f6441.0%
Applied egg-rr41.0%
neg-sub0N/A
neg-lowering-neg.f6441.0%
Applied egg-rr41.0%
if -4.8000000000000003e-32 < re < 3.89999999999999998e-22Initial program 55.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6490.0%
Simplified90.0%
Taylor expanded in re around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6444.6%
Simplified44.6%
if 3.89999999999999998e-22 < re Initial program 40.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.f6476.6%
Simplified76.6%
*-lft-identityN/A
sqrt-lowering-sqrt.f6476.6%
Applied egg-rr76.6%
Final simplification53.5%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -1.2e-29) (* 0.5 (* im_m (pow (- 0.0 re) -0.5))) (if (<= re 3.6e-22) (* 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.2e-29) {
tmp = 0.5 * (im_m * pow((0.0 - re), -0.5));
} else if (re <= 3.6e-22) {
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.2d-29)) then
tmp = 0.5d0 * (im_m * ((0.0d0 - re) ** (-0.5d0)))
else if (re <= 3.6d-22) 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.2e-29) {
tmp = 0.5 * (im_m * Math.pow((0.0 - re), -0.5));
} else if (re <= 3.6e-22) {
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.2e-29: tmp = 0.5 * (im_m * math.pow((0.0 - re), -0.5)) elif re <= 3.6e-22: 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.2e-29) tmp = Float64(0.5 * Float64(im_m * (Float64(0.0 - re) ^ -0.5))); elseif (re <= 3.6e-22) 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.2e-29) tmp = 0.5 * (im_m * ((0.0 - re) ^ -0.5)); elseif (re <= 3.6e-22) 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.2e-29], N[(0.5 * N[(im$95$m * N[Power[N[(0.0 - re), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.6e-22], 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.2 \cdot 10^{-29}:\\
\;\;\;\;0.5 \cdot \left(im\_m \cdot {\left(0 - re\right)}^{-0.5}\right)\\
\mathbf{elif}\;re \leq 3.6 \cdot 10^{-22}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -1.19999999999999996e-29Initial program 12.7%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6430.6%
Simplified30.6%
Taylor expanded in re around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
unpow2N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6436.1%
Simplified36.1%
Taylor expanded in im around 0
unpow2N/A
*-lowering-*.f6444.2%
Simplified44.2%
clear-numN/A
associate-/r/N/A
sqrt-prodN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
sqrt-prodN/A
rem-square-sqrtN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
--lowering--.f6440.9%
Applied egg-rr40.9%
neg-sub0N/A
neg-lowering-neg.f6440.9%
Applied egg-rr40.9%
if -1.19999999999999996e-29 < re < 3.5999999999999998e-22Initial program 55.4%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6490.0%
Simplified90.0%
Taylor expanded in re around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6444.6%
Simplified44.6%
if 3.5999999999999998e-22 < re Initial program 40.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.f6476.6%
Simplified76.6%
*-lft-identityN/A
sqrt-lowering-sqrt.f6476.6%
Applied egg-rr76.6%
Final simplification53.4%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re 3.5e-22) (* 0.5 (sqrt (* 2.0 im_m))) (sqrt re)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= 3.5e-22) {
tmp = 0.5 * sqrt((2.0 * 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.5d-22) then
tmp = 0.5d0 * sqrt((2.0d0 * 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.5e-22) {
tmp = 0.5 * Math.sqrt((2.0 * im_m));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= 3.5e-22: tmp = 0.5 * math.sqrt((2.0 * im_m)) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= 3.5e-22) tmp = Float64(0.5 * sqrt(Float64(2.0 * 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.5e-22) tmp = 0.5 * sqrt((2.0 * 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.5e-22], N[(0.5 * N[Sqrt[N[(2.0 * im$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq 3.5 \cdot 10^{-22}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot im\_m}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < 3.50000000000000005e-22Initial program 38.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6465.8%
Simplified65.8%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6432.8%
Simplified32.8%
if 3.50000000000000005e-22 < re Initial program 40.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.f6476.6%
Simplified76.6%
*-lft-identityN/A
sqrt-lowering-sqrt.f6476.6%
Applied egg-rr76.6%
Final simplification46.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= re -5e-310) (sqrt (- 0.0 re)) (sqrt re)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -5e-310) {
tmp = sqrt((0.0 - re));
} 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 <= (-5d-310)) then
tmp = sqrt((0.0d0 - re))
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 <= -5e-310) {
tmp = Math.sqrt((0.0 - re));
} else {
tmp = Math.sqrt(re);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -5e-310: tmp = math.sqrt((0.0 - re)) else: tmp = math.sqrt(re) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -5e-310) tmp = sqrt(Float64(0.0 - re)); else tmp = sqrt(re); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -5e-310) tmp = sqrt((0.0 - re)); else tmp = sqrt(re); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -5e-310], N[Sqrt[N[(0.0 - re), $MachinePrecision]], $MachinePrecision], N[Sqrt[re], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{0 - re}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{re}\\
\end{array}
\end{array}
if re < -4.999999999999985e-310Initial program 28.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6450.8%
Simplified50.8%
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
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-upN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
metadata-eval4.7%
Applied egg-rr4.7%
sqr-negN/A
pow-prod-downN/A
pow-prod-upN/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f645.9%
Applied egg-rr5.9%
if -4.999999999999985e-310 < re Initial program 48.3%
*-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.f6454.2%
Simplified54.2%
*-lft-identityN/A
sqrt-lowering-sqrt.f6454.2%
Applied egg-rr54.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 38.8%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f6476.4%
Simplified76.4%
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.f6428.2%
Simplified28.2%
*-lft-identityN/A
sqrt-lowering-sqrt.f6428.2%
Applied egg-rr28.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 2024155
(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)))))