
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
double code(double re, double im) {
return exp(re) * cos(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * cos(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.cos(im);
}
def code(re, im): return math.exp(re) * math.cos(im)
function code(re, im) return Float64(exp(re) * cos(im)) end
function tmp = code(re, im) tmp = exp(re) * cos(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \cos im
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
double code(double re, double im) {
return exp(re) * cos(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * cos(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.cos(im);
}
def code(re, im): return math.exp(re) * math.cos(im)
function code(re, im) return Float64(exp(re) * cos(im)) end
function tmp = code(re, im) tmp = exp(re) * cos(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \cos im
\end{array}
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
double code(double re, double im) {
return exp(re) * cos(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * cos(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.cos(im);
}
def code(re, im): return math.exp(re) * math.cos(im)
function code(re, im) return Float64(exp(re) * cos(im)) end
function tmp = code(re, im) tmp = exp(re) * cos(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \cos im
\end{array}
Initial program 100.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (exp re) (cos im))))
(if (<= t_0 -5e+184)
(*
(* im im)
(fma re (fma re (fma re -0.08333333333333333 -0.25) -0.5) -0.5))
(if (<= t_0 -0.01)
(*
(cos im)
(fma
(fma re re -1.0)
(/ 1.0 (+ re -1.0))
(* re (* re (fma re 0.16666666666666666 0.5)))))
(if (<= t_0 0.0)
(exp re)
(if (<= t_0 20.0)
(*
(cos im)
(fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0))
(exp re)))))))
double code(double re, double im) {
double t_0 = exp(re) * cos(im);
double tmp;
if (t_0 <= -5e+184) {
tmp = (im * im) * fma(re, fma(re, fma(re, -0.08333333333333333, -0.25), -0.5), -0.5);
} else if (t_0 <= -0.01) {
tmp = cos(im) * fma(fma(re, re, -1.0), (1.0 / (re + -1.0)), (re * (re * fma(re, 0.16666666666666666, 0.5))));
} else if (t_0 <= 0.0) {
tmp = exp(re);
} else if (t_0 <= 20.0) {
tmp = cos(im) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
} else {
tmp = exp(re);
}
return tmp;
}
function code(re, im) t_0 = Float64(exp(re) * cos(im)) tmp = 0.0 if (t_0 <= -5e+184) tmp = Float64(Float64(im * im) * fma(re, fma(re, fma(re, -0.08333333333333333, -0.25), -0.5), -0.5)); elseif (t_0 <= -0.01) tmp = Float64(cos(im) * fma(fma(re, re, -1.0), Float64(1.0 / Float64(re + -1.0)), Float64(re * Float64(re * fma(re, 0.16666666666666666, 0.5))))); elseif (t_0 <= 0.0) tmp = exp(re); elseif (t_0 <= 20.0) tmp = Float64(cos(im) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0)); else tmp = exp(re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+184], N[(N[(im * im), $MachinePrecision] * N[(re * N[(re * N[(re * -0.08333333333333333 + -0.25), $MachinePrecision] + -0.5), $MachinePrecision] + -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.01], N[(N[Cos[im], $MachinePrecision] * N[(N[(re * re + -1.0), $MachinePrecision] * N[(1.0 / N[(re + -1.0), $MachinePrecision]), $MachinePrecision] + N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 20.0], N[(N[Cos[im], $MachinePrecision] * N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Exp[re], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{re} \cdot \cos im\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{+184}:\\
\;\;\;\;\left(im \cdot im\right) \cdot \mathsf{fma}\left(re, \mathsf{fma}\left(re, \mathsf{fma}\left(re, -0.08333333333333333, -0.25\right), -0.5\right), -0.5\right)\\
\mathbf{elif}\;t\_0 \leq -0.01:\\
\;\;\;\;\cos im \cdot \mathsf{fma}\left(\mathsf{fma}\left(re, re, -1\right), \frac{1}{re + -1}, re \cdot \left(re \cdot \mathsf{fma}\left(re, 0.16666666666666666, 0.5\right)\right)\right)\\
\mathbf{elif}\;t\_0 \leq 0:\\
\;\;\;\;e^{re}\\
\mathbf{elif}\;t\_0 \leq 20:\\
\;\;\;\;\cos im \cdot \mathsf{fma}\left(re, \mathsf{fma}\left(re, \mathsf{fma}\left(re, 0.16666666666666666, 0.5\right), 1\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;e^{re}\\
\end{array}
\end{array}
if (*.f64 (exp.f64 re) (cos.f64 im)) < -4.9999999999999999e184Initial program 100.0%
Taylor expanded in im around 0
associate-*r*N/A
*-lft-identityN/A
distribute-rgt-inN/A
lower-*.f64N/A
lower-exp.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64100.0
Simplified100.0%
Taylor expanded in im around inf
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-exp.f64100.0
Simplified100.0%
Taylor expanded in re around 0
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6492.6
Simplified92.6%
if -4.9999999999999999e184 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0100000000000000002Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6499.4
Simplified99.4%
lift-fma.f64N/A
lift-fma.f64N/A
*-rgt-identityN/A
*-rgt-identityN/A
+-commutativeN/A
*-commutativeN/A
lift-fma.f64N/A
distribute-rgt1-inN/A
associate-+r+N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
Applied egg-rr99.4%
if -0.0100000000000000002 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0 or 20 < (*.f64 (exp.f64 re) (cos.f64 im)) Initial program 100.0%
Taylor expanded in im around 0
lower-exp.f6499.6
Simplified99.6%
if -0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 20Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6499.3
Simplified99.3%
Final simplification99.0%
herbie shell --seed 2024218
(FPCore (re im)
:name "math.exp on complex, real part"
:precision binary64
(* (exp re) (cos im)))