
(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}
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= (+ re (sqrt (+ (* re re) (* im_m im_m)))) 0.0) (* 0.5 (/ im_m (sqrt (- re)))) (* 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 / sqrt(-re));
} 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.sqrt(-re));
} 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.sqrt(-re)) 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 / sqrt(Float64(-re)))); 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 / sqrt(-re)); 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[Sqrt[(-re)], $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}{\sqrt{-re}}\\
\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 5.0%
sqr-neg5.0%
+-commutative5.0%
sqr-neg5.0%
+-commutative5.0%
distribute-rgt-in5.0%
cancel-sign-sub5.0%
distribute-rgt-out--5.0%
sub-neg5.0%
remove-double-neg5.0%
+-commutative5.0%
hypot-define13.8%
Simplified13.8%
Taylor expanded in re around -inf 48.2%
+-commutative48.2%
mul-1-neg48.2%
unsub-neg48.2%
*-commutative48.2%
Simplified48.2%
add-sqr-sqrt47.8%
pow247.8%
pow1/247.8%
metadata-eval47.8%
sqrt-pow147.9%
div-inv47.8%
associate-*l*47.8%
pow-flip47.8%
metadata-eval47.8%
metadata-eval47.8%
metadata-eval47.8%
Applied egg-rr47.8%
Taylor expanded in im around 0 48.9%
mul-1-neg48.9%
distribute-frac-neg48.9%
Simplified48.9%
pow-pow49.3%
metadata-eval49.3%
pow1/249.3%
frac-2neg49.3%
sqrt-div52.6%
remove-double-neg52.6%
unpow252.6%
sqrt-prod51.9%
add-sqr-sqrt53.9%
Applied egg-rr53.9%
if 0.0 < (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) Initial program 44.9%
sqr-neg44.9%
+-commutative44.9%
sqr-neg44.9%
+-commutative44.9%
distribute-rgt-in44.9%
cancel-sign-sub44.9%
distribute-rgt-out--44.9%
sub-neg44.9%
remove-double-neg44.9%
+-commutative44.9%
hypot-define90.3%
Simplified90.3%
Final simplification83.5%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= re -5.2e-43)
(* 0.5 (/ im_m (sqrt (- re))))
(if (or (<= re 5.4e-76) (and (not (<= re 7.2e-37)) (<= re 1.02e+60)))
(* 0.5 (sqrt (* 2.0 (+ re im_m))))
(* 0.5 (* 2.0 (sqrt re))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -5.2e-43) {
tmp = 0.5 * (im_m / sqrt(-re));
} else if ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) {
tmp = 0.5 * sqrt((2.0 * (re + im_m)));
} else {
tmp = 0.5 * (2.0 * 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 <= (-5.2d-43)) then
tmp = 0.5d0 * (im_m / sqrt(-re))
else if ((re <= 5.4d-76) .or. (.not. (re <= 7.2d-37)) .and. (re <= 1.02d+60)) then
tmp = 0.5d0 * sqrt((2.0d0 * (re + im_m)))
else
tmp = 0.5d0 * (2.0d0 * 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 <= -5.2e-43) {
tmp = 0.5 * (im_m / Math.sqrt(-re));
} else if ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) {
tmp = 0.5 * Math.sqrt((2.0 * (re + im_m)));
} else {
tmp = 0.5 * (2.0 * Math.sqrt(re));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -5.2e-43: tmp = 0.5 * (im_m / math.sqrt(-re)) elif (re <= 5.4e-76) or (not (re <= 7.2e-37) and (re <= 1.02e+60)): tmp = 0.5 * math.sqrt((2.0 * (re + im_m))) else: tmp = 0.5 * (2.0 * math.sqrt(re)) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -5.2e-43) tmp = Float64(0.5 * Float64(im_m / sqrt(Float64(-re)))); elseif ((re <= 5.4e-76) || (!(re <= 7.2e-37) && (re <= 1.02e+60))) tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im_m)))); else tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -5.2e-43) tmp = 0.5 * (im_m / sqrt(-re)); elseif ((re <= 5.4e-76) || (~((re <= 7.2e-37)) && (re <= 1.02e+60))) tmp = 0.5 * sqrt((2.0 * (re + im_m))); else tmp = 0.5 * (2.0 * sqrt(re)); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -5.2e-43], N[(0.5 * N[(im$95$m / N[Sqrt[(-re)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 5.4e-76], And[N[Not[LessEqual[re, 7.2e-37]], $MachinePrecision], LessEqual[re, 1.02e+60]]], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -5.2 \cdot 10^{-43}:\\
\;\;\;\;0.5 \cdot \frac{im\_m}{\sqrt{-re}}\\
\mathbf{elif}\;re \leq 5.4 \cdot 10^{-76} \lor \neg \left(re \leq 7.2 \cdot 10^{-37}\right) \land re \leq 1.02 \cdot 10^{+60}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\end{array}
\end{array}
if re < -5.2e-43Initial program 11.2%
sqr-neg11.2%
+-commutative11.2%
sqr-neg11.2%
+-commutative11.2%
distribute-rgt-in11.2%
cancel-sign-sub11.2%
distribute-rgt-out--11.2%
sub-neg11.2%
remove-double-neg11.2%
+-commutative11.2%
hypot-define32.7%
Simplified32.7%
Taylor expanded in re around -inf 51.1%
+-commutative51.1%
mul-1-neg51.1%
unsub-neg51.1%
*-commutative51.1%
Simplified51.1%
add-sqr-sqrt50.7%
pow250.7%
pow1/250.8%
metadata-eval50.8%
sqrt-pow150.8%
div-inv50.8%
associate-*l*50.8%
pow-flip50.8%
metadata-eval50.8%
metadata-eval50.8%
metadata-eval50.8%
Applied egg-rr50.8%
Taylor expanded in im around 0 55.0%
mul-1-neg55.0%
distribute-frac-neg55.0%
Simplified55.0%
pow-pow55.4%
metadata-eval55.4%
pow1/255.4%
frac-2neg55.4%
sqrt-div64.6%
remove-double-neg64.6%
unpow264.6%
sqrt-prod51.1%
add-sqr-sqrt56.3%
Applied egg-rr56.3%
if -5.2e-43 < re < 5.4000000000000001e-76 or 7.20000000000000014e-37 < re < 1.0200000000000001e60Initial program 50.5%
sqr-neg50.5%
+-commutative50.5%
sqr-neg50.5%
+-commutative50.5%
distribute-rgt-in50.5%
cancel-sign-sub50.5%
distribute-rgt-out--50.5%
sub-neg50.5%
remove-double-neg50.5%
+-commutative50.5%
hypot-define90.8%
Simplified90.8%
Taylor expanded in re around 0 44.9%
distribute-lft-out44.9%
*-commutative44.9%
Simplified44.9%
if 5.4000000000000001e-76 < re < 7.20000000000000014e-37 or 1.0200000000000001e60 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
Final simplification56.4%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= re -3.5e-39)
(* 0.5 (/ im_m (sqrt (- re))))
(if (or (<= re 5.2e-76) (and (not (<= re 1.26e-35)) (<= re 7.5e+54)))
(* 0.5 (sqrt (* im_m 2.0)))
(* 0.5 (* 2.0 (sqrt re))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (re <= -3.5e-39) {
tmp = 0.5 * (im_m / sqrt(-re));
} else if ((re <= 5.2e-76) || (!(re <= 1.26e-35) && (re <= 7.5e+54))) {
tmp = 0.5 * sqrt((im_m * 2.0));
} else {
tmp = 0.5 * (2.0 * 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-39)) then
tmp = 0.5d0 * (im_m / sqrt(-re))
else if ((re <= 5.2d-76) .or. (.not. (re <= 1.26d-35)) .and. (re <= 7.5d+54)) then
tmp = 0.5d0 * sqrt((im_m * 2.0d0))
else
tmp = 0.5d0 * (2.0d0 * 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-39) {
tmp = 0.5 * (im_m / Math.sqrt(-re));
} else if ((re <= 5.2e-76) || (!(re <= 1.26e-35) && (re <= 7.5e+54))) {
tmp = 0.5 * Math.sqrt((im_m * 2.0));
} else {
tmp = 0.5 * (2.0 * Math.sqrt(re));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if re <= -3.5e-39: tmp = 0.5 * (im_m / math.sqrt(-re)) elif (re <= 5.2e-76) or (not (re <= 1.26e-35) and (re <= 7.5e+54)): tmp = 0.5 * math.sqrt((im_m * 2.0)) else: tmp = 0.5 * (2.0 * math.sqrt(re)) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (re <= -3.5e-39) tmp = Float64(0.5 * Float64(im_m / sqrt(Float64(-re)))); elseif ((re <= 5.2e-76) || (!(re <= 1.26e-35) && (re <= 7.5e+54))) tmp = Float64(0.5 * sqrt(Float64(im_m * 2.0))); else tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (re <= -3.5e-39) tmp = 0.5 * (im_m / sqrt(-re)); elseif ((re <= 5.2e-76) || (~((re <= 1.26e-35)) && (re <= 7.5e+54))) tmp = 0.5 * sqrt((im_m * 2.0)); else tmp = 0.5 * (2.0 * sqrt(re)); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[re, -3.5e-39], N[(0.5 * N[(im$95$m / N[Sqrt[(-re)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 5.2e-76], And[N[Not[LessEqual[re, 1.26e-35]], $MachinePrecision], LessEqual[re, 7.5e+54]]], N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq -3.5 \cdot 10^{-39}:\\
\;\;\;\;0.5 \cdot \frac{im\_m}{\sqrt{-re}}\\
\mathbf{elif}\;re \leq 5.2 \cdot 10^{-76} \lor \neg \left(re \leq 1.26 \cdot 10^{-35}\right) \land re \leq 7.5 \cdot 10^{+54}:\\
\;\;\;\;0.5 \cdot \sqrt{im\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\end{array}
\end{array}
if re < -3.5e-39Initial program 11.2%
sqr-neg11.2%
+-commutative11.2%
sqr-neg11.2%
+-commutative11.2%
distribute-rgt-in11.2%
cancel-sign-sub11.2%
distribute-rgt-out--11.2%
sub-neg11.2%
remove-double-neg11.2%
+-commutative11.2%
hypot-define32.7%
Simplified32.7%
Taylor expanded in re around -inf 51.1%
+-commutative51.1%
mul-1-neg51.1%
unsub-neg51.1%
*-commutative51.1%
Simplified51.1%
add-sqr-sqrt50.7%
pow250.7%
pow1/250.8%
metadata-eval50.8%
sqrt-pow150.8%
div-inv50.8%
associate-*l*50.8%
pow-flip50.8%
metadata-eval50.8%
metadata-eval50.8%
metadata-eval50.8%
Applied egg-rr50.8%
Taylor expanded in im around 0 55.0%
mul-1-neg55.0%
distribute-frac-neg55.0%
Simplified55.0%
pow-pow55.4%
metadata-eval55.4%
pow1/255.4%
frac-2neg55.4%
sqrt-div64.6%
remove-double-neg64.6%
unpow264.6%
sqrt-prod51.1%
add-sqr-sqrt56.3%
Applied egg-rr56.3%
if -3.5e-39 < re < 5.1999999999999999e-76 or 1.26e-35 < re < 7.50000000000000042e54Initial program 50.5%
sqr-neg50.5%
+-commutative50.5%
sqr-neg50.5%
+-commutative50.5%
distribute-rgt-in50.5%
cancel-sign-sub50.5%
distribute-rgt-out--50.5%
sub-neg50.5%
remove-double-neg50.5%
+-commutative50.5%
hypot-define90.8%
Simplified90.8%
Taylor expanded in re around 0 43.1%
*-commutative43.1%
Simplified43.1%
if 5.1999999999999999e-76 < re < 1.26e-35 or 7.50000000000000042e54 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
Final simplification55.5%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (or (<= re 2e-76) (and (not (<= re 1.25e-36)) (<= re 1.1e+56))) (* 0.5 (sqrt (* im_m 2.0))) (* 0.5 (* 2.0 (sqrt re)))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if ((re <= 2e-76) || (!(re <= 1.25e-36) && (re <= 1.1e+56))) {
tmp = 0.5 * sqrt((im_m * 2.0));
} else {
tmp = 0.5 * (2.0 * 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-76) .or. (.not. (re <= 1.25d-36)) .and. (re <= 1.1d+56)) then
tmp = 0.5d0 * sqrt((im_m * 2.0d0))
else
tmp = 0.5d0 * (2.0d0 * 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-76) || (!(re <= 1.25e-36) && (re <= 1.1e+56))) {
tmp = 0.5 * Math.sqrt((im_m * 2.0));
} else {
tmp = 0.5 * (2.0 * Math.sqrt(re));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if (re <= 2e-76) or (not (re <= 1.25e-36) and (re <= 1.1e+56)): tmp = 0.5 * math.sqrt((im_m * 2.0)) else: tmp = 0.5 * (2.0 * math.sqrt(re)) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if ((re <= 2e-76) || (!(re <= 1.25e-36) && (re <= 1.1e+56))) tmp = Float64(0.5 * sqrt(Float64(im_m * 2.0))); else tmp = Float64(0.5 * Float64(2.0 * sqrt(re))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if ((re <= 2e-76) || (~((re <= 1.25e-36)) && (re <= 1.1e+56))) tmp = 0.5 * sqrt((im_m * 2.0)); else tmp = 0.5 * (2.0 * sqrt(re)); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[Or[LessEqual[re, 2e-76], And[N[Not[LessEqual[re, 1.25e-36]], $MachinePrecision], LessEqual[re, 1.1e+56]]], N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;re \leq 2 \cdot 10^{-76} \lor \neg \left(re \leq 1.25 \cdot 10^{-36}\right) \land re \leq 1.1 \cdot 10^{+56}:\\
\;\;\;\;0.5 \cdot \sqrt{im\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\
\end{array}
\end{array}
if re < 1.99999999999999985e-76 or 1.25000000000000001e-36 < re < 1.10000000000000008e56Initial program 36.0%
sqr-neg36.0%
+-commutative36.0%
sqr-neg36.0%
+-commutative36.0%
distribute-rgt-in36.0%
cancel-sign-sub36.0%
distribute-rgt-out--36.0%
sub-neg36.0%
remove-double-neg36.0%
+-commutative36.0%
hypot-define69.4%
Simplified69.4%
Taylor expanded in re around 0 33.4%
*-commutative33.4%
Simplified33.4%
if 1.99999999999999985e-76 < re < 1.25000000000000001e-36 or 1.10000000000000008e56 < re Initial program 42.6%
sqr-neg42.6%
+-commutative42.6%
sqr-neg42.6%
+-commutative42.6%
distribute-rgt-in42.6%
cancel-sign-sub42.6%
distribute-rgt-out--42.6%
sub-neg42.6%
remove-double-neg42.6%
+-commutative42.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in im around 0 81.7%
*-commutative81.7%
unpow281.7%
rem-square-sqrt83.2%
Simplified83.2%
Final simplification44.1%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* 0.5 (sqrt (* im_m 2.0))))
im_m = fabs(im);
double code(double re, double im_m) {
return 0.5 * sqrt((im_m * 2.0));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = 0.5d0 * sqrt((im_m * 2.0d0))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return 0.5 * Math.sqrt((im_m * 2.0));
}
im_m = math.fabs(im) def code(re, im_m): return 0.5 * math.sqrt((im_m * 2.0))
im_m = abs(im) function code(re, im_m) return Float64(0.5 * sqrt(Float64(im_m * 2.0))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = 0.5 * sqrt((im_m * 2.0)); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
0.5 \cdot \sqrt{im\_m \cdot 2}
\end{array}
Initial program 37.4%
sqr-neg37.4%
+-commutative37.4%
sqr-neg37.4%
+-commutative37.4%
distribute-rgt-in37.4%
cancel-sign-sub37.4%
distribute-rgt-out--37.4%
sub-neg37.4%
remove-double-neg37.4%
+-commutative37.4%
hypot-define76.0%
Simplified76.0%
Taylor expanded in re around 0 29.6%
*-commutative29.6%
Simplified29.6%
Final simplification29.6%
(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 2024039
(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)))))