math.exp on complex, imaginary part

Average Accuracy: 75.1% → 75.1%

Time: 9.2s

Precision: binary64

Cost: 12992

Math

\[e^{re} \cdot \sin im \]

↓

\[e^{re} \cdot \sin im \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

↓

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

↓

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

↓

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

↓

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

↓

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

↓

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

↓

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

↓

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 76.5%

   \[e^{re} \cdot \sin im \]

2. Final simplification 76.5%

   \[\leadsto e^{re} \cdot \sin im \]

Alternatives

Alternative 1
Accuracy	75.3%
Cost	6852

\[\begin{array}{l} \mathbf{if}\;re \leq -0.0011:\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im \cdot \left(re + 1\right)\\ \end{array} \]

Alternative 2
Accuracy	74.3%
Cost	6724

\[\begin{array}{l} \mathbf{if}\;re \leq -0.00092:\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im\\ \end{array} \]

Alternative 3
Accuracy	74.2%
Cost	6596

\[\begin{array}{l} \mathbf{if}\;re \leq -140:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\sin im\\ \end{array} \]

Alternative 4
Accuracy	50.0%
Cost	452

\[\begin{array}{l} \mathbf{if}\;re \leq -8 \cdot 10^{-9}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(re + 1\right)\\ \end{array} \]

Alternative 5
Accuracy	50.0%
Cost	452

\[\begin{array}{l} \mathbf{if}\;re \leq -8 \cdot 10^{-9}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;im + re \cdot im\\ \end{array} \]

Alternative 6
Accuracy	49.8%
Cost	196

\[\begin{array}{l} \mathbf{if}\;re \leq -8 \cdot 10^{-9}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;im\\ \end{array} \]

Alternative 7
Accuracy	26.1%
Cost	64

\[im \]

Reproduce

herbie shell --seed 2023157 -o generate:proofs
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))