
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* (sin re) (fma 0.5 (exp im_m) (/ 0.5 (exp im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
return sin(re) * fma(0.5, exp(im_m), (0.5 / exp(im_m)));
}
im_m = abs(im) function code(re, im_m) return Float64(sin(re) * fma(0.5, exp(im_m), Float64(0.5 / exp(im_m)))) end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(N[Sin[re], $MachinePrecision] * N[(0.5 * N[Exp[im$95$m], $MachinePrecision] + N[(0.5 / N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\sin re \cdot \mathsf{fma}\left(0.5, e^{im\_m}, \frac{0.5}{e^{im\_m}}\right)
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Final simplification100.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* (* (sin re) 0.5) (+ (exp im_m) (exp (- im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
return (sin(re) * 0.5) * (exp(im_m) + exp(-im_m));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = (sin(re) * 0.5d0) * (exp(im_m) + exp(-im_m))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return (Math.sin(re) * 0.5) * (Math.exp(im_m) + Math.exp(-im_m));
}
im_m = math.fabs(im) def code(re, im_m): return (math.sin(re) * 0.5) * (math.exp(im_m) + math.exp(-im_m))
im_m = abs(im) function code(re, im_m) return Float64(Float64(sin(re) * 0.5) * Float64(exp(im_m) + exp(Float64(-im_m)))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = (sin(re) * 0.5) * (exp(im_m) + exp(-im_m)); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[im$95$m], $MachinePrecision] + N[Exp[(-im$95$m)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\left(\sin re \cdot 0.5\right) \cdot \left(e^{im\_m} + e^{-im\_m}\right)
\end{array}
Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Final simplification100.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 1.35) (* (* (sin re) 0.5) (fma im_m im_m 2.0)) (* 0.5 (* (sin re) (exp im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 1.35) {
tmp = (sin(re) * 0.5) * fma(im_m, im_m, 2.0);
} else {
tmp = 0.5 * (sin(re) * exp(im_m));
}
return tmp;
}
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 1.35) tmp = Float64(Float64(sin(re) * 0.5) * fma(im_m, im_m, 2.0)); else tmp = Float64(0.5 * Float64(sin(re) * exp(im_m))); end return tmp end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 1.35], N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(im$95$m * im$95$m + 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Sin[re], $MachinePrecision] * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 1.35:\\
\;\;\;\;\left(\sin re \cdot 0.5\right) \cdot \mathsf{fma}\left(im\_m, im\_m, 2\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(\sin re \cdot e^{im\_m}\right)\\
\end{array}
\end{array}
if im < 1.3500000000000001Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Taylor expanded in im around 0 84.9%
+-commutative84.9%
unpow284.9%
fma-define84.9%
Simplified84.9%
if 1.3500000000000001 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Applied egg-rr99.3%
Taylor expanded in re around inf 99.3%
Final simplification88.5%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 0.68) (sin re) (* 0.5 (* (sin re) (exp im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 0.68) {
tmp = sin(re);
} else {
tmp = 0.5 * (sin(re) * exp(im_m));
}
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 (im_m <= 0.68d0) then
tmp = sin(re)
else
tmp = 0.5d0 * (sin(re) * exp(im_m))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 0.68) {
tmp = Math.sin(re);
} else {
tmp = 0.5 * (Math.sin(re) * Math.exp(im_m));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 0.68: tmp = math.sin(re) else: tmp = 0.5 * (math.sin(re) * math.exp(im_m)) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 0.68) tmp = sin(re); else tmp = Float64(0.5 * Float64(sin(re) * exp(im_m))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 0.68) tmp = sin(re); else tmp = 0.5 * (sin(re) * exp(im_m)); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 0.68], N[Sin[re], $MachinePrecision], N[(0.5 * N[(N[Sin[re], $MachinePrecision] * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 0.68:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(\sin re \cdot e^{im\_m}\right)\\
\end{array}
\end{array}
if im < 0.680000000000000049Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 68.6%
if 0.680000000000000049 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Applied egg-rr99.3%
Taylor expanded in re around inf 99.3%
Final simplification76.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 215.0) (sin re) (* (exp im_m) (* re 0.5))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 215.0) {
tmp = sin(re);
} else {
tmp = exp(im_m) * (re * 0.5);
}
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 (im_m <= 215.0d0) then
tmp = sin(re)
else
tmp = exp(im_m) * (re * 0.5d0)
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 215.0) {
tmp = Math.sin(re);
} else {
tmp = Math.exp(im_m) * (re * 0.5);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 215.0: tmp = math.sin(re) else: tmp = math.exp(im_m) * (re * 0.5) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 215.0) tmp = sin(re); else tmp = Float64(exp(im_m) * Float64(re * 0.5)); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 215.0) tmp = sin(re); else tmp = exp(im_m) * (re * 0.5); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 215.0], N[Sin[re], $MachinePrecision], N[(N[Exp[im$95$m], $MachinePrecision] * N[(re * 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 215:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;e^{im\_m} \cdot \left(re \cdot 0.5\right)\\
\end{array}
\end{array}
if im < 215Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 68.0%
if 215 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Applied egg-rr100.0%
Taylor expanded in re around 0 74.2%
associate-*r*74.2%
Simplified74.2%
Final simplification69.5%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 1300.0) (sin re) (* -0.16666666666666666 (pow re 3.0))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 1300.0) {
tmp = sin(re);
} else {
tmp = -0.16666666666666666 * pow(re, 3.0);
}
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 (im_m <= 1300.0d0) then
tmp = sin(re)
else
tmp = (-0.16666666666666666d0) * (re ** 3.0d0)
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 1300.0) {
tmp = Math.sin(re);
} else {
tmp = -0.16666666666666666 * Math.pow(re, 3.0);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 1300.0: tmp = math.sin(re) else: tmp = -0.16666666666666666 * math.pow(re, 3.0) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 1300.0) tmp = sin(re); else tmp = Float64(-0.16666666666666666 * (re ^ 3.0)); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 1300.0) tmp = sin(re); else tmp = -0.16666666666666666 * (re ^ 3.0); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 1300.0], N[Sin[re], $MachinePrecision], N[(-0.16666666666666666 * N[Power[re, 3.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 1300:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;-0.16666666666666666 \cdot {re}^{3}\\
\end{array}
\end{array}
if im < 1300Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 67.6%
if 1300 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 2.7%
Taylor expanded in re around 0 16.6%
Taylor expanded in re around inf 16.1%
Final simplification55.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 820.0) (sin re) (pow (* re -2.0) -2.0)))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 820.0) {
tmp = sin(re);
} else {
tmp = pow((re * -2.0), -2.0);
}
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 (im_m <= 820.0d0) then
tmp = sin(re)
else
tmp = (re * (-2.0d0)) ** (-2.0d0)
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 820.0) {
tmp = Math.sin(re);
} else {
tmp = Math.pow((re * -2.0), -2.0);
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 820.0: tmp = math.sin(re) else: tmp = math.pow((re * -2.0), -2.0) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 820.0) tmp = sin(re); else tmp = Float64(re * -2.0) ^ -2.0; end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 820.0) tmp = sin(re); else tmp = (re * -2.0) ^ -2.0; end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 820.0], N[Sin[re], $MachinePrecision], N[Power[N[(re * -2.0), $MachinePrecision], -2.0], $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 820:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;{\left(re \cdot -2\right)}^{-2}\\
\end{array}
\end{array}
if im < 820Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 68.0%
if 820 < im Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Taylor expanded in re around 0 74.2%
Applied egg-rr11.1%
Final simplification54.2%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (sin re))
im_m = fabs(im);
double code(double re, double im_m) {
return sin(re);
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = sin(re)
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return Math.sin(re);
}
im_m = math.fabs(im) def code(re, im_m): return math.sin(re)
im_m = abs(im) function code(re, im_m) return sin(re) end
im_m = abs(im); function tmp = code(re, im_m) tmp = sin(re); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[Sin[re], $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\sin re
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 52.2%
Final simplification52.2%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 2.0)
im_m = fabs(im);
double code(double re, double im_m) {
return 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 = 2.0d0
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return 2.0;
}
im_m = math.fabs(im) def code(re, im_m): return 2.0
im_m = abs(im) function code(re, im_m) return 2.0 end
im_m = abs(im); function tmp = code(re, im_m) tmp = 2.0; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := 2.0
\begin{array}{l}
im_m = \left|im\right|
\\
2
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Applied egg-rr4.4%
sub-neg4.4%
metadata-eval4.4%
+-commutative4.4%
log1p-undefine4.4%
rem-exp-log4.4%
associate-+r+4.4%
metadata-eval4.4%
Simplified4.4%
Taylor expanded in re around 0 4.3%
Final simplification4.3%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 re)
im_m = fabs(im);
double code(double re, double im_m) {
return re;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = re
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return re;
}
im_m = math.fabs(im) def code(re, im_m): return re
im_m = abs(im) function code(re, im_m) return re end
im_m = abs(im); function tmp = code(re, im_m) tmp = re; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := re
\begin{array}{l}
im_m = \left|im\right|
\\
re
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 52.2%
Taylor expanded in re around 0 30.4%
Final simplification30.4%
herbie shell --seed 2024078
(FPCore (re im)
:name "math.sin on complex, real part"
:precision binary64
(* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))