
(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 17 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}
(FPCore (re im) :precision binary64 (* (cosh im) (sin re)))
double code(double re, double im) {
return cosh(im) * sin(re);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = cosh(im) * sin(re)
end function
public static double code(double re, double im) {
return Math.cosh(im) * Math.sin(re);
}
def code(re, im): return math.cosh(im) * math.sin(re)
function code(re, im) return Float64(cosh(im) * sin(re)) end
function tmp = code(re, im) tmp = cosh(im) * sin(re); end
code[re_, im_] := N[(N[Cosh[im], $MachinePrecision] * N[Sin[re], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cosh im \cdot \sin re
\end{array}
Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* (sin re) 0.5) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(* (cosh im) (fma re (* (* re re) -0.16666666666666666) re))
(if (<= t_0 1.0)
(*
(sin re)
(fma (* im im) (fma (* im im) 0.041666666666666664 0.5) 1.0))
(* (cosh im) re)))))
double code(double re, double im) {
double t_0 = (sin(re) * 0.5) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = cosh(im) * fma(re, ((re * re) * -0.16666666666666666), re);
} else if (t_0 <= 1.0) {
tmp = sin(re) * fma((im * im), fma((im * im), 0.041666666666666664, 0.5), 1.0);
} else {
tmp = cosh(im) * re;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(cosh(im) * fma(re, Float64(Float64(re * re) * -0.16666666666666666), re)); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * fma(Float64(im * im), fma(Float64(im * im), 0.041666666666666664, 0.5), 1.0)); else tmp = Float64(cosh(im) * re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Cosh[im], $MachinePrecision] * N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Cosh[im], $MachinePrecision] * re), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\cosh im \cdot \mathsf{fma}\left(re, \left(re \cdot re\right) \cdot -0.16666666666666666, re\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\cosh im \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.0
Simplified73.0%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft1-inN/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
Simplified99.1%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified80.6%
*-lft-identityN/A
cosh-lowering-cosh.f6480.6
Applied egg-rr80.6%
Final simplification87.1%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* (sin re) 0.5) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(* (cosh im) (fma re (* (* re re) -0.16666666666666666) re))
(if (<= t_0 1.0) (* (sin re) (fma 0.5 (* im im) 1.0)) (* (cosh im) re)))))
double code(double re, double im) {
double t_0 = (sin(re) * 0.5) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = cosh(im) * fma(re, ((re * re) * -0.16666666666666666), re);
} else if (t_0 <= 1.0) {
tmp = sin(re) * fma(0.5, (im * im), 1.0);
} else {
tmp = cosh(im) * re;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(cosh(im) * fma(re, Float64(Float64(re * re) * -0.16666666666666666), re)); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * fma(0.5, Float64(im * im), 1.0)); else tmp = Float64(cosh(im) * re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Cosh[im], $MachinePrecision] * N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * N[(0.5 * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Cosh[im], $MachinePrecision] * re), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\cosh im \cdot \mathsf{fma}\left(re, \left(re \cdot re\right) \cdot -0.16666666666666666, re\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot \mathsf{fma}\left(0.5, im \cdot im, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\cosh im \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.0
Simplified73.0%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6498.7
Simplified98.7%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified80.6%
*-lft-identityN/A
cosh-lowering-cosh.f6480.6
Applied egg-rr80.6%
Final simplification86.9%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* (sin re) 0.5) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(*
(fma
(fma
re
(* re (fma (* re re) -0.0001984126984126984 0.008333333333333333))
-0.16666666666666666)
(* re (* re re))
re)
(fma
(fma
(* im im)
(fma im (* im 0.001388888888888889) 0.041666666666666664)
0.5)
(* im im)
1.0))
(if (<= t_0 1.0) (* (sin re) (fma 0.5 (* im im) 1.0)) (* (cosh im) re)))))
double code(double re, double im) {
double t_0 = (sin(re) * 0.5) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = fma(fma(re, (re * fma((re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), (re * (re * re)), re) * fma(fma((im * im), fma(im, (im * 0.001388888888888889), 0.041666666666666664), 0.5), (im * im), 1.0);
} else if (t_0 <= 1.0) {
tmp = sin(re) * fma(0.5, (im * im), 1.0);
} else {
tmp = cosh(im) * re;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(fma(fma(re, Float64(re * fma(Float64(re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), Float64(re * Float64(re * re)), re) * fma(fma(Float64(im * im), fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664), 0.5), Float64(im * im), 1.0)); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * fma(0.5, Float64(im * im), 1.0)); else tmp = Float64(cosh(im) * re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * N[(re * N[(N[(re * re), $MachinePrecision] * -0.0001984126984126984 + 0.008333333333333333), $MachinePrecision]), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * N[(0.5 * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Cosh[im], $MachinePrecision] * re), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(re, re \cdot \mathsf{fma}\left(re \cdot re, -0.0001984126984126984, 0.008333333333333333\right), -0.16666666666666666\right), re \cdot \left(re \cdot re\right), re\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right), 0.5\right), im \cdot im, 1\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot \mathsf{fma}\left(0.5, im \cdot im, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\cosh im \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Simplified88.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*l*N/A
pow-plusN/A
metadata-evalN/A
cube-unmultN/A
unpow2N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
Simplified63.8%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-+l+N/A
distribute-rgt-inN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr63.8%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6498.7
Simplified98.7%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified80.6%
*-lft-identityN/A
cosh-lowering-cosh.f6480.6
Applied egg-rr80.6%
Final simplification84.3%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* (sin re) 0.5) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(*
(fma
(fma
re
(* re (fma (* re re) -0.0001984126984126984 0.008333333333333333))
-0.16666666666666666)
(* re (* re re))
re)
(fma
(fma
(* im im)
(fma im (* im 0.001388888888888889) 0.041666666666666664)
0.5)
(* im im)
1.0))
(if (<= t_0 1.0) (sin re) (* (cosh im) re)))))
double code(double re, double im) {
double t_0 = (sin(re) * 0.5) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = fma(fma(re, (re * fma((re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), (re * (re * re)), re) * fma(fma((im * im), fma(im, (im * 0.001388888888888889), 0.041666666666666664), 0.5), (im * im), 1.0);
} else if (t_0 <= 1.0) {
tmp = sin(re);
} else {
tmp = cosh(im) * re;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(fma(fma(re, Float64(re * fma(Float64(re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), Float64(re * Float64(re * re)), re) * fma(fma(Float64(im * im), fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664), 0.5), Float64(im * im), 1.0)); elseif (t_0 <= 1.0) tmp = sin(re); else tmp = Float64(cosh(im) * re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * N[(re * N[(N[(re * re), $MachinePrecision] * -0.0001984126984126984 + 0.008333333333333333), $MachinePrecision]), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[re], $MachinePrecision], N[(N[Cosh[im], $MachinePrecision] * re), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(re, re \cdot \mathsf{fma}\left(re \cdot re, -0.0001984126984126984, 0.008333333333333333\right), -0.16666666666666666\right), re \cdot \left(re \cdot re\right), re\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right), 0.5\right), im \cdot im, 1\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;\cosh im \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Simplified88.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*l*N/A
pow-plusN/A
metadata-evalN/A
cube-unmultN/A
unpow2N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
Simplified63.8%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-+l+N/A
distribute-rgt-inN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr63.8%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6497.6
Simplified97.6%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified80.6%
*-lft-identityN/A
cosh-lowering-cosh.f6480.6
Applied egg-rr80.6%
Final simplification83.7%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))))
(t_1 (fma im (* im 0.001388888888888889) 0.041666666666666664)))
(if (<= t_0 (- INFINITY))
(*
(fma
(fma
re
(* re (fma (* re re) -0.0001984126984126984 0.008333333333333333))
-0.16666666666666666)
(* re (* re re))
re)
(fma (fma (* im im) t_1 0.5) (* im im) 1.0))
(if (<= t_0 1.0)
(sin re)
(*
(fma
(* re re)
(* re (fma (* re re) 0.008333333333333333 -0.16666666666666666))
re)
(fma t_1 (* im (* im (* im im))) (fma 0.5 (* im im) 1.0)))))))
double code(double re, double im) {
double t_0 = (sin(re) * 0.5) * (exp(-im) + exp(im));
double t_1 = fma(im, (im * 0.001388888888888889), 0.041666666666666664);
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = fma(fma(re, (re * fma((re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), (re * (re * re)), re) * fma(fma((im * im), t_1, 0.5), (im * im), 1.0);
} else if (t_0 <= 1.0) {
tmp = sin(re);
} else {
tmp = fma((re * re), (re * fma((re * re), 0.008333333333333333, -0.16666666666666666)), re) * fma(t_1, (im * (im * (im * im))), fma(0.5, (im * im), 1.0));
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) t_1 = fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(fma(fma(re, Float64(re * fma(Float64(re * re), -0.0001984126984126984, 0.008333333333333333)), -0.16666666666666666), Float64(re * Float64(re * re)), re) * fma(fma(Float64(im * im), t_1, 0.5), Float64(im * im), 1.0)); elseif (t_0 <= 1.0) tmp = sin(re); else tmp = Float64(fma(Float64(re * re), Float64(re * fma(Float64(re * re), 0.008333333333333333, -0.16666666666666666)), re) * fma(t_1, Float64(im * Float64(im * Float64(im * im))), fma(0.5, Float64(im * im), 1.0))); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(re * N[(re * N[(N[(re * re), $MachinePrecision] * -0.0001984126984126984 + 0.008333333333333333), $MachinePrecision]), $MachinePrecision] + -0.16666666666666666), $MachinePrecision] * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision] * N[(N[(N[(im * im), $MachinePrecision] * t$95$1 + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[Sin[re], $MachinePrecision], N[(N[(N[(re * re), $MachinePrecision] * N[(re * N[(N[(re * re), $MachinePrecision] * 0.008333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision] * N[(t$95$1 * N[(im * N[(im * N[(im * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right)\\
t_1 := \mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(re, re \cdot \mathsf{fma}\left(re \cdot re, -0.0001984126984126984, 0.008333333333333333\right), -0.16666666666666666\right), re \cdot \left(re \cdot re\right), re\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, t\_1, 0.5\right), im \cdot im, 1\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(re \cdot re, re \cdot \mathsf{fma}\left(re \cdot re, 0.008333333333333333, -0.16666666666666666\right), re\right) \cdot \mathsf{fma}\left(t\_1, im \cdot \left(im \cdot \left(im \cdot im\right)\right), \mathsf{fma}\left(0.5, im \cdot im, 1\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Simplified88.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*l*N/A
pow-plusN/A
metadata-evalN/A
cube-unmultN/A
unpow2N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
Simplified63.8%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-+l+N/A
distribute-rgt-inN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr63.8%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6497.6
Simplified97.6%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Simplified87.6%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6472.9
Simplified72.9%
Final simplification81.8%
(FPCore (re im)
:precision binary64
(if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) 1.0)
(*
(sin re)
(fma
(* im im)
(fma
(* im im)
(fma (* im im) 0.001388888888888889 0.041666666666666664)
0.5)
1.0))
(* (cosh im) re)))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= 1.0) {
tmp = sin(re) * fma((im * im), fma((im * im), fma((im * im), 0.001388888888888889, 0.041666666666666664), 0.5), 1.0);
} else {
tmp = cosh(im) * re;
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= 1.0) tmp = Float64(sin(re) * fma(Float64(im * im), fma(Float64(im * im), fma(Float64(im * im), 0.001388888888888889, 0.041666666666666664), 0.5), 1.0)); else tmp = Float64(cosh(im) * re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.001388888888888889 + 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Cosh[im], $MachinePrecision] * re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq 1:\\
\;\;\;\;\sin re \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, 0.001388888888888889, 0.041666666666666664\right), 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\cosh im \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in im around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6495.1
Simplified95.1%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified80.6%
*-lft-identityN/A
cosh-lowering-cosh.f6480.6
Applied egg-rr80.6%
Final simplification91.6%
(FPCore (re im)
:precision binary64
(if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002)
(*
(* re (* re re))
(fma (* im im) -0.08333333333333333 -0.16666666666666666))
(*
re
(fma
im
(*
im
(fma
(* im im)
(fma im (* im 0.001388888888888889) 0.041666666666666664)
0.5))
1.0))))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = (re * (re * re)) * fma((im * im), -0.08333333333333333, -0.16666666666666666);
} else {
tmp = re * fma(im, (im * fma((im * im), fma(im, (im * 0.001388888888888889), 0.041666666666666664), 0.5)), 1.0);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(Float64(re * Float64(re * re)) * fma(Float64(im * im), -0.08333333333333333, -0.16666666666666666)); else tmp = Float64(re * fma(im, Float64(im * fma(Float64(im * im), fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664), 0.5)), 1.0)); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.08333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(re * N[(im * N[(im * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;\left(re \cdot \left(re \cdot re\right)\right) \cdot \mathsf{fma}\left(im \cdot im, -0.08333333333333333, -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;re \cdot \mathsf{fma}\left(im, im \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right), 0.5\right), 1\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6472.4
Simplified72.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.4
Simplified33.4%
Taylor expanded in re around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-eval11.9
Simplified11.9%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Simplified94.3%
Taylor expanded in re around 0
Simplified71.7%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr71.7%
Final simplification47.4%
(FPCore (re im)
:precision binary64
(if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002)
(*
(* re (* re re))
(fma (* im im) -0.08333333333333333 -0.16666666666666666))
(*
re
(fma
im
(* im (fma im (* im (* (* im im) 0.001388888888888889)) 0.5))
1.0))))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = (re * (re * re)) * fma((im * im), -0.08333333333333333, -0.16666666666666666);
} else {
tmp = re * fma(im, (im * fma(im, (im * ((im * im) * 0.001388888888888889)), 0.5)), 1.0);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(Float64(re * Float64(re * re)) * fma(Float64(im * im), -0.08333333333333333, -0.16666666666666666)); else tmp = Float64(re * fma(im, Float64(im * fma(im, Float64(im * Float64(Float64(im * im) * 0.001388888888888889)), 0.5)), 1.0)); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.08333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(re * N[(im * N[(im * N[(im * N[(im * N[(N[(im * im), $MachinePrecision] * 0.001388888888888889), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;\left(re \cdot \left(re \cdot re\right)\right) \cdot \mathsf{fma}\left(im \cdot im, -0.08333333333333333, -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;re \cdot \mathsf{fma}\left(im, im \cdot \mathsf{fma}\left(im, im \cdot \left(\left(im \cdot im\right) \cdot 0.001388888888888889\right), 0.5\right), 1\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6472.4
Simplified72.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.4
Simplified33.4%
Taylor expanded in re around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-eval11.9
Simplified11.9%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Simplified94.3%
Taylor expanded in re around 0
Simplified71.7%
Taylor expanded in im around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6471.7
Simplified71.7%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified71.7%
Final simplification47.4%
(FPCore (re im)
:precision binary64
(if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002)
(*
(* re (* re re))
(fma (* im im) -0.08333333333333333 -0.16666666666666666))
(* re (fma im (* im (fma im (* im 0.041666666666666664) 0.5)) 1.0))))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = (re * (re * re)) * fma((im * im), -0.08333333333333333, -0.16666666666666666);
} else {
tmp = re * fma(im, (im * fma(im, (im * 0.041666666666666664), 0.5)), 1.0);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(Float64(re * Float64(re * re)) * fma(Float64(im * im), -0.08333333333333333, -0.16666666666666666)); else tmp = Float64(re * fma(im, Float64(im * fma(im, Float64(im * 0.041666666666666664), 0.5)), 1.0)); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.08333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(re * N[(im * N[(im * N[(im * N[(im * 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;\left(re \cdot \left(re \cdot re\right)\right) \cdot \mathsf{fma}\left(im \cdot im, -0.08333333333333333, -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;re \cdot \mathsf{fma}\left(im, im \cdot \mathsf{fma}\left(im, im \cdot 0.041666666666666664, 0.5\right), 1\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6472.4
Simplified72.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.4
Simplified33.4%
Taylor expanded in re around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-eval11.9
Simplified11.9%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Simplified94.3%
Taylor expanded in re around 0
Simplified71.7%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6470.5
Simplified70.5%
Final simplification46.7%
(FPCore (re im)
:precision binary64
(if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002)
(*
(* re (* re re))
(fma (* im im) -0.08333333333333333 -0.16666666666666666))
(fma (* 0.5 (* im im)) re re)))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = (re * (re * re)) * fma((im * im), -0.08333333333333333, -0.16666666666666666);
} else {
tmp = fma((0.5 * (im * im)), re, re);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(Float64(re * Float64(re * re)) * fma(Float64(im * im), -0.08333333333333333, -0.16666666666666666)); else tmp = fma(Float64(0.5 * Float64(im * im)), re, re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.08333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(im * im), $MachinePrecision]), $MachinePrecision] * re + re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;\left(re \cdot \left(re \cdot re\right)\right) \cdot \mathsf{fma}\left(im \cdot im, -0.08333333333333333, -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(0.5 \cdot \left(im \cdot im\right), re, re\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6472.4
Simplified72.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.4
Simplified33.4%
Taylor expanded in re around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-eval11.9
Simplified11.9%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6481.4
Simplified81.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.6
Simplified63.6%
Final simplification42.6%
(FPCore (re im) :precision binary64 (if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002) (* re (* (* re re) -0.16666666666666666)) (fma (* 0.5 (* im im)) re re)))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = re * ((re * re) * -0.16666666666666666);
} else {
tmp = fma((0.5 * (im * im)), re, re);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(re * Float64(Float64(re * re) * -0.16666666666666666)); else tmp = fma(Float64(0.5 * Float64(im * im)), re, re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(im * im), $MachinePrecision]), $MachinePrecision] * re + re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;re \cdot \left(\left(re \cdot re\right) \cdot -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(0.5 \cdot \left(im \cdot im\right), re, re\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6430.4
Simplified30.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.8
Simplified8.8%
Taylor expanded in re around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.5
Simplified8.5%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
distribute-rgt1-inN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6481.4
Simplified81.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.6
Simplified63.6%
Final simplification41.2%
(FPCore (re im) :precision binary64 (if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002) (* re (* (* re re) -0.16666666666666666)) (fma im (* im (* re 0.5)) re)))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = re * ((re * re) * -0.16666666666666666);
} else {
tmp = fma(im, (im * (re * 0.5)), re);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(re * Float64(Float64(re * re) * -0.16666666666666666)); else tmp = fma(im, Float64(im * Float64(re * 0.5)), re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(im * N[(im * N[(re * 0.5), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;re \cdot \left(\left(re \cdot re\right) \cdot -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(im, im \cdot \left(re \cdot 0.5\right), re\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6430.4
Simplified30.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.8
Simplified8.8%
Taylor expanded in re around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.5
Simplified8.5%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
+-commutativeN/A
sub0-negN/A
cosh-undefN/A
associate-*r*N/A
metadata-evalN/A
exp-0N/A
*-lowering-*.f64N/A
exp-0N/A
cosh-lowering-cosh.f64N/A
sin-lowering-sin.f64100.0
Applied egg-rr100.0%
Taylor expanded in re around 0
Simplified75.5%
Taylor expanded in im around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.9
Simplified56.9%
Final simplification37.2%
(FPCore (re im) :precision binary64 (if (<= (* (* (sin re) 0.5) (+ (exp (- im)) (exp im))) -0.002) (* re (* (* re re) -0.16666666666666666)) re))
double code(double re, double im) {
double tmp;
if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) {
tmp = re * ((re * re) * -0.16666666666666666);
} else {
tmp = re;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (((sin(re) * 0.5d0) * (exp(-im) + exp(im))) <= (-0.002d0)) then
tmp = re * ((re * re) * (-0.16666666666666666d0))
else
tmp = re
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (((Math.sin(re) * 0.5) * (Math.exp(-im) + Math.exp(im))) <= -0.002) {
tmp = re * ((re * re) * -0.16666666666666666);
} else {
tmp = re;
}
return tmp;
}
def code(re, im): tmp = 0 if ((math.sin(re) * 0.5) * (math.exp(-im) + math.exp(im))) <= -0.002: tmp = re * ((re * re) * -0.16666666666666666) else: tmp = re return tmp
function code(re, im) tmp = 0.0 if (Float64(Float64(sin(re) * 0.5) * Float64(exp(Float64(-im)) + exp(im))) <= -0.002) tmp = Float64(re * Float64(Float64(re * re) * -0.16666666666666666)); else tmp = re; end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (((sin(re) * 0.5) * (exp(-im) + exp(im))) <= -0.002) tmp = re * ((re * re) * -0.16666666666666666); else tmp = re; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.002], N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision], re]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\sin re \cdot 0.5\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.002:\\
\;\;\;\;re \cdot \left(\left(re \cdot re\right) \cdot -0.16666666666666666\right)\\
\mathbf{else}:\\
\;\;\;\;re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6430.4
Simplified30.4%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.8
Simplified8.8%
Taylor expanded in re around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.5
Simplified8.5%
if -2e-3 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6458.7
Simplified58.7%
Taylor expanded in re around 0
Simplified42.9%
Final simplification29.0%
(FPCore (re im)
:precision binary64
(if (<= (sin re) -0.002)
(*
(fma re (* (* re re) -0.16666666666666666) re)
(fma (* im im) (fma (* im im) 0.041666666666666664 0.5) 1.0))
(*
(fma
(* re re)
(* re (fma (* re re) 0.008333333333333333 -0.16666666666666666))
re)
(fma
(fma im (* im 0.001388888888888889) 0.041666666666666664)
(* im (* im (* im im)))
(fma 0.5 (* im im) 1.0)))))
double code(double re, double im) {
double tmp;
if (sin(re) <= -0.002) {
tmp = fma(re, ((re * re) * -0.16666666666666666), re) * fma((im * im), fma((im * im), 0.041666666666666664, 0.5), 1.0);
} else {
tmp = fma((re * re), (re * fma((re * re), 0.008333333333333333, -0.16666666666666666)), re) * fma(fma(im, (im * 0.001388888888888889), 0.041666666666666664), (im * (im * (im * im))), fma(0.5, (im * im), 1.0));
}
return tmp;
}
function code(re, im) tmp = 0.0 if (sin(re) <= -0.002) tmp = Float64(fma(re, Float64(Float64(re * re) * -0.16666666666666666), re) * fma(Float64(im * im), fma(Float64(im * im), 0.041666666666666664, 0.5), 1.0)); else tmp = Float64(fma(Float64(re * re), Float64(re * fma(Float64(re * re), 0.008333333333333333, -0.16666666666666666)), re) * fma(fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664), Float64(im * Float64(im * Float64(im * im))), fma(0.5, Float64(im * im), 1.0))); end return tmp end
code[re_, im_] := If[LessEqual[N[Sin[re], $MachinePrecision], -0.002], N[(N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + re), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(re * re), $MachinePrecision] * N[(re * N[(N[(re * re), $MachinePrecision] * 0.008333333333333333 + -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision] * N[(N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(im * N[(im * N[(im * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sin re \leq -0.002:\\
\;\;\;\;\mathsf{fma}\left(re, \left(re \cdot re\right) \cdot -0.16666666666666666, re\right) \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(re \cdot re, re \cdot \mathsf{fma}\left(re \cdot re, 0.008333333333333333, -0.16666666666666666\right), re\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right), im \cdot \left(im \cdot \left(im \cdot im\right)\right), \mathsf{fma}\left(0.5, im \cdot im, 1\right)\right)\\
\end{array}
\end{array}
if (sin.f64 re) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft1-inN/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
Simplified92.6%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6422.2
Simplified22.2%
if -2e-3 < (sin.f64 re) Initial program 100.0%
Taylor expanded in im around 0
Simplified92.0%
Taylor expanded in re around 0
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6474.1
Simplified74.1%
Final simplification61.3%
(FPCore (re im)
:precision binary64
(if (<= (sin re) -0.002)
(*
(fma re (* (* re re) -0.16666666666666666) re)
(fma (* im im) (fma (* im im) 0.041666666666666664 0.5) 1.0))
(*
re
(fma
im
(*
im
(fma
(* im im)
(fma im (* im 0.001388888888888889) 0.041666666666666664)
0.5))
1.0))))
double code(double re, double im) {
double tmp;
if (sin(re) <= -0.002) {
tmp = fma(re, ((re * re) * -0.16666666666666666), re) * fma((im * im), fma((im * im), 0.041666666666666664, 0.5), 1.0);
} else {
tmp = re * fma(im, (im * fma((im * im), fma(im, (im * 0.001388888888888889), 0.041666666666666664), 0.5)), 1.0);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (sin(re) <= -0.002) tmp = Float64(fma(re, Float64(Float64(re * re) * -0.16666666666666666), re) * fma(Float64(im * im), fma(Float64(im * im), 0.041666666666666664, 0.5), 1.0)); else tmp = Float64(re * fma(im, Float64(im * fma(Float64(im * im), fma(im, Float64(im * 0.001388888888888889), 0.041666666666666664), 0.5)), 1.0)); end return tmp end
code[re_, im_] := If[LessEqual[N[Sin[re], $MachinePrecision], -0.002], N[(N[(re * N[(N[(re * re), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] + re), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(im * N[(im * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * 0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\sin re \leq -0.002:\\
\;\;\;\;\mathsf{fma}\left(re, \left(re \cdot re\right) \cdot -0.16666666666666666, re\right) \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;re \cdot \mathsf{fma}\left(im, im \cdot \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot 0.001388888888888889, 0.041666666666666664\right), 0.5\right), 1\right)\\
\end{array}
\end{array}
if (sin.f64 re) < -2e-3Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
distribute-lft-inN/A
associate-+l+N/A
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
distribute-lft1-inN/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
Simplified92.6%
Taylor expanded in re around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6422.2
Simplified22.2%
if -2e-3 < (sin.f64 re) Initial program 100.0%
Taylor expanded in im around 0
Simplified92.0%
Taylor expanded in re around 0
Simplified74.2%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr74.2%
Final simplification61.4%
(FPCore (re im) :precision binary64 re)
double code(double re, double im) {
return re;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = re
end function
public static double code(double re, double im) {
return re;
}
def code(re, im): return re
function code(re, im) return re end
function tmp = code(re, im) tmp = re; end
code[re_, im_] := re
\begin{array}{l}
\\
re
\end{array}
Initial program 100.0%
Taylor expanded in im around 0
sin-lowering-sin.f6447.2
Simplified47.2%
Taylor expanded in re around 0
Simplified26.6%
herbie shell --seed 2024201
(FPCore (re im)
:name "math.sin on complex, real part"
:precision binary64
(* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))