
(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 9 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 (+ (* re re) (* im im))) re) 0.0) (* (pow re -0.5) (* im 0.5)) (* (* 0.5 (sqrt (- (hypot re im) re))) (sqrt 2.0))))
double code(double re, double im) {
double tmp;
if ((sqrt(((re * re) + (im * im))) - re) <= 0.0) {
tmp = pow(re, -0.5) * (im * 0.5);
} else {
tmp = (0.5 * sqrt((hypot(re, im) - re))) * sqrt(2.0);
}
return tmp;
}
public static double code(double re, double im) {
double tmp;
if ((Math.sqrt(((re * re) + (im * im))) - re) <= 0.0) {
tmp = Math.pow(re, -0.5) * (im * 0.5);
} else {
tmp = (0.5 * Math.sqrt((Math.hypot(re, im) - re))) * Math.sqrt(2.0);
}
return tmp;
}
def code(re, im): tmp = 0 if (math.sqrt(((re * re) + (im * im))) - re) <= 0.0: tmp = math.pow(re, -0.5) * (im * 0.5) else: tmp = (0.5 * math.sqrt((math.hypot(re, im) - re))) * math.sqrt(2.0) return tmp
function code(re, im) tmp = 0.0 if (Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re) <= 0.0) tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); else tmp = Float64(Float64(0.5 * sqrt(Float64(hypot(re, im) - re))) * sqrt(2.0)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((sqrt(((re * re) + (im * im))) - re) <= 0.0) tmp = (re ^ -0.5) * (im * 0.5); else tmp = (0.5 * sqrt((hypot(re, im) - re))) * sqrt(2.0); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision], 0.0], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[Sqrt[N[(N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision] - re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{re \cdot re + im \cdot im} - re \leq 0:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{\mathsf{hypot}\left(re, im\right) - re}\right) \cdot \sqrt{2}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) < 0.0Initial program 7.5%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6415.0%
Applied egg-rr15.0%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6493.2%
Simplified93.2%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6493.3%
Applied egg-rr93.3%
if 0.0 < (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) Initial program 45.0%
*-commutativeN/A
pow1/2N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6492.1%
Applied egg-rr92.1%
Final simplification92.2%
(FPCore (re im) :precision binary64 (if (<= (- (sqrt (+ (* re re) (* im im))) re) 0.0) (* (pow re -0.5) (* im 0.5)) (* 0.5 (sqrt (* (- (hypot re im) re) 2.0)))))
double code(double re, double im) {
double tmp;
if ((sqrt(((re * re) + (im * im))) - re) <= 0.0) {
tmp = pow(re, -0.5) * (im * 0.5);
} else {
tmp = 0.5 * sqrt(((hypot(re, im) - re) * 2.0));
}
return tmp;
}
public static double code(double re, double im) {
double tmp;
if ((Math.sqrt(((re * re) + (im * im))) - re) <= 0.0) {
tmp = Math.pow(re, -0.5) * (im * 0.5);
} else {
tmp = 0.5 * Math.sqrt(((Math.hypot(re, im) - re) * 2.0));
}
return tmp;
}
def code(re, im): tmp = 0 if (math.sqrt(((re * re) + (im * im))) - re) <= 0.0: tmp = math.pow(re, -0.5) * (im * 0.5) else: tmp = 0.5 * math.sqrt(((math.hypot(re, im) - re) * 2.0)) return tmp
function code(re, im) tmp = 0.0 if (Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re) <= 0.0) tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); else tmp = Float64(0.5 * sqrt(Float64(Float64(hypot(re, im) - re) * 2.0))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((sqrt(((re * re) + (im * im))) - re) <= 0.0) tmp = (re ^ -0.5) * (im * 0.5); else tmp = 0.5 * sqrt(((hypot(re, im) - re) * 2.0)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision], 0.0], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision] - re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{re \cdot re + im \cdot im} - re \leq 0:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{\left(\mathsf{hypot}\left(re, im\right) - re\right) \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) < 0.0Initial program 7.5%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6415.0%
Applied egg-rr15.0%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6493.2%
Simplified93.2%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6493.3%
Applied egg-rr93.3%
if 0.0 < (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) Initial program 45.0%
*-commutativeN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6491.9%
Applied egg-rr91.9%
Final simplification92.1%
(FPCore (re im)
:precision binary64
(if (<= re -1.08e+90)
(* (sqrt 2.0) (* 0.5 (sqrt (* re -2.0))))
(if (<= re 1.05e-22)
(* 0.5 (sqrt (* 2.0 (- im re))))
(* (pow re -0.5) (* im 0.5)))))
double code(double re, double im) {
double tmp;
if (re <= -1.08e+90) {
tmp = sqrt(2.0) * (0.5 * sqrt((re * -2.0)));
} else if (re <= 1.05e-22) {
tmp = 0.5 * sqrt((2.0 * (im - re)));
} else {
tmp = pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.08d+90)) then
tmp = sqrt(2.0d0) * (0.5d0 * sqrt((re * (-2.0d0))))
else if (re <= 1.05d-22) then
tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
else
tmp = (re ** (-0.5d0)) * (im * 0.5d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.08e+90) {
tmp = Math.sqrt(2.0) * (0.5 * Math.sqrt((re * -2.0)));
} else if (re <= 1.05e-22) {
tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
} else {
tmp = Math.pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.08e+90: tmp = math.sqrt(2.0) * (0.5 * math.sqrt((re * -2.0))) elif re <= 1.05e-22: tmp = 0.5 * math.sqrt((2.0 * (im - re))) else: tmp = math.pow(re, -0.5) * (im * 0.5) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.08e+90) tmp = Float64(sqrt(2.0) * Float64(0.5 * sqrt(Float64(re * -2.0)))); elseif (re <= 1.05e-22) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re)))); else tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.08e+90) tmp = sqrt(2.0) * (0.5 * sqrt((re * -2.0))); elseif (re <= 1.05e-22) tmp = 0.5 * sqrt((2.0 * (im - re))); else tmp = (re ^ -0.5) * (im * 0.5); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.08e+90], N[(N[Sqrt[2.0], $MachinePrecision] * N[(0.5 * N[Sqrt[N[(re * -2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.05e-22], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.08 \cdot 10^{+90}:\\
\;\;\;\;\sqrt{2} \cdot \left(0.5 \cdot \sqrt{re \cdot -2}\right)\\
\mathbf{elif}\;re \leq 1.05 \cdot 10^{-22}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\
\mathbf{else}:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -1.08e90Initial program 22.6%
*-commutativeN/A
pow1/2N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6499.2%
Applied egg-rr99.2%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6485.8%
Simplified85.8%
if -1.08e90 < re < 1.05000000000000004e-22Initial program 56.4%
Taylor expanded in re around 0
Simplified82.7%
if 1.05000000000000004e-22 < re Initial program 11.8%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6432.2%
Applied egg-rr32.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6475.6%
Simplified75.6%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6475.7%
Applied egg-rr75.7%
Final simplification81.6%
(FPCore (re im)
:precision binary64
(if (<= re -1e+25)
(* 0.5 (sqrt (* re -4.0)))
(if (<= re 3.15e-23)
(* 0.5 (sqrt (* im (+ 2.0 (/ (* re -2.0) im)))))
(* (pow re -0.5) (* im 0.5)))))
double code(double re, double im) {
double tmp;
if (re <= -1e+25) {
tmp = 0.5 * sqrt((re * -4.0));
} else if (re <= 3.15e-23) {
tmp = 0.5 * sqrt((im * (2.0 + ((re * -2.0) / im))));
} else {
tmp = pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1d+25)) then
tmp = 0.5d0 * sqrt((re * (-4.0d0)))
else if (re <= 3.15d-23) then
tmp = 0.5d0 * sqrt((im * (2.0d0 + ((re * (-2.0d0)) / im))))
else
tmp = (re ** (-0.5d0)) * (im * 0.5d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1e+25) {
tmp = 0.5 * Math.sqrt((re * -4.0));
} else if (re <= 3.15e-23) {
tmp = 0.5 * Math.sqrt((im * (2.0 + ((re * -2.0) / im))));
} else {
tmp = Math.pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1e+25: tmp = 0.5 * math.sqrt((re * -4.0)) elif re <= 3.15e-23: tmp = 0.5 * math.sqrt((im * (2.0 + ((re * -2.0) / im)))) else: tmp = math.pow(re, -0.5) * (im * 0.5) return tmp
function code(re, im) tmp = 0.0 if (re <= -1e+25) tmp = Float64(0.5 * sqrt(Float64(re * -4.0))); elseif (re <= 3.15e-23) tmp = Float64(0.5 * sqrt(Float64(im * Float64(2.0 + Float64(Float64(re * -2.0) / im))))); else tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1e+25) tmp = 0.5 * sqrt((re * -4.0)); elseif (re <= 3.15e-23) tmp = 0.5 * sqrt((im * (2.0 + ((re * -2.0) / im)))); else tmp = (re ^ -0.5) * (im * 0.5); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1e+25], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.15e-23], N[(0.5 * N[Sqrt[N[(im * N[(2.0 + N[(N[(re * -2.0), $MachinePrecision] / im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1 \cdot 10^{+25}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
\mathbf{elif}\;re \leq 3.15 \cdot 10^{-23}:\\
\;\;\;\;0.5 \cdot \sqrt{im \cdot \left(2 + \frac{re \cdot -2}{im}\right)}\\
\mathbf{else}:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -1.00000000000000009e25Initial program 31.4%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6478.5%
Simplified78.5%
if -1.00000000000000009e25 < re < 3.15000000000000012e-23Initial program 55.8%
Taylor expanded in im around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
/-lowering-/.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
*-commutativeN/A
*-lowering-*.f6485.2%
Simplified85.2%
if 3.15000000000000012e-23 < re Initial program 11.8%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6432.2%
Applied egg-rr32.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6475.6%
Simplified75.6%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6475.7%
Applied egg-rr75.7%
Final simplification81.4%
(FPCore (re im)
:precision binary64
(if (<= re -2.45e+90)
(* 0.5 (sqrt (* re -4.0)))
(if (<= re 9.5e-23)
(* 0.5 (sqrt (* 2.0 (- im re))))
(* (pow re -0.5) (* im 0.5)))))
double code(double re, double im) {
double tmp;
if (re <= -2.45e+90) {
tmp = 0.5 * sqrt((re * -4.0));
} else if (re <= 9.5e-23) {
tmp = 0.5 * sqrt((2.0 * (im - re)));
} else {
tmp = pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-2.45d+90)) then
tmp = 0.5d0 * sqrt((re * (-4.0d0)))
else if (re <= 9.5d-23) then
tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
else
tmp = (re ** (-0.5d0)) * (im * 0.5d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -2.45e+90) {
tmp = 0.5 * Math.sqrt((re * -4.0));
} else if (re <= 9.5e-23) {
tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
} else {
tmp = Math.pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -2.45e+90: tmp = 0.5 * math.sqrt((re * -4.0)) elif re <= 9.5e-23: tmp = 0.5 * math.sqrt((2.0 * (im - re))) else: tmp = math.pow(re, -0.5) * (im * 0.5) return tmp
function code(re, im) tmp = 0.0 if (re <= -2.45e+90) tmp = Float64(0.5 * sqrt(Float64(re * -4.0))); elseif (re <= 9.5e-23) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re)))); else tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -2.45e+90) tmp = 0.5 * sqrt((re * -4.0)); elseif (re <= 9.5e-23) tmp = 0.5 * sqrt((2.0 * (im - re))); else tmp = (re ^ -0.5) * (im * 0.5); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -2.45e+90], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 9.5e-23], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2.45 \cdot 10^{+90}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
\mathbf{elif}\;re \leq 9.5 \cdot 10^{-23}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\
\mathbf{else}:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -2.4500000000000001e90Initial program 22.6%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6484.5%
Simplified84.5%
if -2.4500000000000001e90 < re < 9.50000000000000058e-23Initial program 56.4%
Taylor expanded in re around 0
Simplified82.7%
if 9.50000000000000058e-23 < re Initial program 11.8%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6432.2%
Applied egg-rr32.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6475.6%
Simplified75.6%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6475.7%
Applied egg-rr75.7%
Final simplification81.4%
(FPCore (re im)
:precision binary64
(if (<= re -2.5e+25)
(* 0.5 (sqrt (* re -4.0)))
(if (<= re 4.9e-23)
(* 0.5 (sqrt (* im 2.0)))
(* (pow re -0.5) (* im 0.5)))))
double code(double re, double im) {
double tmp;
if (re <= -2.5e+25) {
tmp = 0.5 * sqrt((re * -4.0));
} else if (re <= 4.9e-23) {
tmp = 0.5 * sqrt((im * 2.0));
} else {
tmp = pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-2.5d+25)) then
tmp = 0.5d0 * sqrt((re * (-4.0d0)))
else if (re <= 4.9d-23) then
tmp = 0.5d0 * sqrt((im * 2.0d0))
else
tmp = (re ** (-0.5d0)) * (im * 0.5d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -2.5e+25) {
tmp = 0.5 * Math.sqrt((re * -4.0));
} else if (re <= 4.9e-23) {
tmp = 0.5 * Math.sqrt((im * 2.0));
} else {
tmp = Math.pow(re, -0.5) * (im * 0.5);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -2.5e+25: tmp = 0.5 * math.sqrt((re * -4.0)) elif re <= 4.9e-23: tmp = 0.5 * math.sqrt((im * 2.0)) else: tmp = math.pow(re, -0.5) * (im * 0.5) return tmp
function code(re, im) tmp = 0.0 if (re <= -2.5e+25) tmp = Float64(0.5 * sqrt(Float64(re * -4.0))); elseif (re <= 4.9e-23) tmp = Float64(0.5 * sqrt(Float64(im * 2.0))); else tmp = Float64((re ^ -0.5) * Float64(im * 0.5)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -2.5e+25) tmp = 0.5 * sqrt((re * -4.0)); elseif (re <= 4.9e-23) tmp = 0.5 * sqrt((im * 2.0)); else tmp = (re ^ -0.5) * (im * 0.5); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -2.5e+25], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 4.9e-23], N[(0.5 * N[Sqrt[N[(im * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[re, -0.5], $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2.5 \cdot 10^{+25}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
\mathbf{elif}\;re \leq 4.9 \cdot 10^{-23}:\\
\;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;{re}^{-0.5} \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -2.50000000000000012e25Initial program 31.4%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6478.5%
Simplified78.5%
if -2.50000000000000012e25 < re < 4.8999999999999998e-23Initial program 55.8%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6484.4%
Simplified84.4%
if 4.8999999999999998e-23 < re Initial program 11.8%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6432.2%
Applied egg-rr32.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6475.6%
Simplified75.6%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f6475.7%
Applied egg-rr75.7%
Final simplification81.0%
(FPCore (re im) :precision binary64 (if (<= re -2.8e+24) (* 0.5 (sqrt (* re -4.0))) (if (<= re 9.2e-23) (* 0.5 (sqrt (* im 2.0))) (/ (* im 0.5) (sqrt re)))))
double code(double re, double im) {
double tmp;
if (re <= -2.8e+24) {
tmp = 0.5 * sqrt((re * -4.0));
} else if (re <= 9.2e-23) {
tmp = 0.5 * sqrt((im * 2.0));
} else {
tmp = (im * 0.5) / 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 <= (-2.8d+24)) then
tmp = 0.5d0 * sqrt((re * (-4.0d0)))
else if (re <= 9.2d-23) then
tmp = 0.5d0 * sqrt((im * 2.0d0))
else
tmp = (im * 0.5d0) / sqrt(re)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -2.8e+24) {
tmp = 0.5 * Math.sqrt((re * -4.0));
} else if (re <= 9.2e-23) {
tmp = 0.5 * Math.sqrt((im * 2.0));
} else {
tmp = (im * 0.5) / Math.sqrt(re);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -2.8e+24: tmp = 0.5 * math.sqrt((re * -4.0)) elif re <= 9.2e-23: tmp = 0.5 * math.sqrt((im * 2.0)) else: tmp = (im * 0.5) / math.sqrt(re) return tmp
function code(re, im) tmp = 0.0 if (re <= -2.8e+24) tmp = Float64(0.5 * sqrt(Float64(re * -4.0))); elseif (re <= 9.2e-23) tmp = Float64(0.5 * sqrt(Float64(im * 2.0))); else tmp = Float64(Float64(im * 0.5) / sqrt(re)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -2.8e+24) tmp = 0.5 * sqrt((re * -4.0)); elseif (re <= 9.2e-23) tmp = 0.5 * sqrt((im * 2.0)); else tmp = (im * 0.5) / sqrt(re); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -2.8e+24], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 9.2e-23], N[(0.5 * N[Sqrt[N[(im * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2.8 \cdot 10^{+24}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
\mathbf{elif}\;re \leq 9.2 \cdot 10^{-23}:\\
\;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\
\end{array}
\end{array}
if re < -2.8000000000000002e24Initial program 31.4%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6478.5%
Simplified78.5%
if -2.8000000000000002e24 < re < 9.2000000000000004e-23Initial program 55.8%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6484.4%
Simplified84.4%
if 9.2000000000000004e-23 < re Initial program 11.8%
pow1/2N/A
pow-to-expN/A
exp-lowering-exp.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
accelerator-lowering-hypot.f6432.2%
Applied egg-rr32.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6475.6%
Simplified75.6%
associate-*r*N/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6475.7%
Applied egg-rr75.7%
Final simplification81.0%
(FPCore (re im) :precision binary64 (if (<= re -1.15e+23) (* 0.5 (sqrt (* re -4.0))) (* 0.5 (sqrt (* im 2.0)))))
double code(double re, double im) {
double tmp;
if (re <= -1.15e+23) {
tmp = 0.5 * sqrt((re * -4.0));
} else {
tmp = 0.5 * sqrt((im * 2.0));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.15d+23)) then
tmp = 0.5d0 * sqrt((re * (-4.0d0)))
else
tmp = 0.5d0 * sqrt((im * 2.0d0))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.15e+23) {
tmp = 0.5 * Math.sqrt((re * -4.0));
} else {
tmp = 0.5 * Math.sqrt((im * 2.0));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.15e+23: tmp = 0.5 * math.sqrt((re * -4.0)) else: tmp = 0.5 * math.sqrt((im * 2.0)) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.15e+23) tmp = Float64(0.5 * sqrt(Float64(re * -4.0))); else tmp = Float64(0.5 * sqrt(Float64(im * 2.0))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.15e+23) tmp = 0.5 * sqrt((re * -4.0)); else tmp = 0.5 * sqrt((im * 2.0)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.15e+23], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(im * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.15 \cdot 10^{+23}:\\
\;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\
\end{array}
\end{array}
if re < -1.15e23Initial program 31.4%
Taylor expanded in re around -inf
*-commutativeN/A
*-lowering-*.f6478.5%
Simplified78.5%
if -1.15e23 < re Initial program 42.3%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6466.9%
Simplified66.9%
(FPCore (re im) :precision binary64 (* 0.5 (sqrt (* im 2.0))))
double code(double re, double im) {
return 0.5 * sqrt((im * 2.0));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 0.5d0 * sqrt((im * 2.0d0))
end function
public static double code(double re, double im) {
return 0.5 * Math.sqrt((im * 2.0));
}
def code(re, im): return 0.5 * math.sqrt((im * 2.0))
function code(re, im) return Float64(0.5 * sqrt(Float64(im * 2.0))) end
function tmp = code(re, im) tmp = 0.5 * sqrt((im * 2.0)); end
code[re_, im_] := N[(0.5 * N[Sqrt[N[(im * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \sqrt{im \cdot 2}
\end{array}
Initial program 39.7%
Taylor expanded in re around 0
*-commutativeN/A
*-lowering-*.f6457.1%
Simplified57.1%
herbie shell --seed 2024192
(FPCore (re im)
:name "math.sqrt on complex, imaginary part, im greater than 0 branch"
:precision binary64
:pre (> im 0.0)
(* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))