math.cos on complex, real part

Average Error: 0.0 → 0.0

Time: 7.3s

Precision: binary64

Cost: 26304

Math

\[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

↓

\[\left(0.5 \cdot e^{im}\right) \cdot \cos re + \cos re \cdot \frac{0.5}{e^{im}} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

↓

(FPCore (re im)
 :precision binary64
 (+ (* (* 0.5 (exp im)) (cos re)) (* (cos re) (/ 0.5 (exp im)))))

C

double code(double re, double im) {
	return (0.5 * cos(re)) * (exp(-im) + exp(im));
}

↓

double code(double re, double im) {
	return ((0.5 * exp(im)) * cos(re)) + (cos(re) * (0.5 / exp(im)));
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * cos(re)) * (exp(-im) + exp(im))
end function

↓

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = ((0.5d0 * exp(im)) * cos(re)) + (cos(re) * (0.5d0 / exp(im)))
end function

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

↓

public static double code(double re, double im) {
	return ((0.5 * Math.exp(im)) * Math.cos(re)) + (Math.cos(re) * (0.5 / Math.exp(im)));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

↓

def code(re, im):
	return ((0.5 * math.exp(im)) * math.cos(re)) + (math.cos(re) * (0.5 / math.exp(im)))

Julia

function code(re, im)
	return Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im)) + exp(im)))
end

↓

function code(re, im)
	return Float64(Float64(Float64(0.5 * exp(im)) * cos(re)) + Float64(cos(re) * Float64(0.5 / exp(im))))
end

MATLAB

function tmp = code(re, im)
	tmp = (0.5 * cos(re)) * (exp(-im) + exp(im));
end

↓

function tmp = code(re, im)
	tmp = ((0.5 * exp(im)) * cos(re)) + (cos(re) * (0.5 / exp(im)));
end

Wolfram

code[re_, im_] := N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[re_, im_] := N[(N[(N[(0.5 * N[Exp[im], $MachinePrecision]), $MachinePrecision] * N[Cos[re], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[re], $MachinePrecision] * N[(0.5 / N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.0

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]

2. Simplified 0.0

   \[\leadsto \color{blue}{\cos re \cdot \mathsf{fma}\left(0.5, e^{im}, \frac{0.5}{e^{im}}\right)} \]
   Proof
   (*.f64 (cos.f64 re) (fma.f64 1/2 (exp.f64 im) (/.f64 1/2 (exp.f64 im)))): 0 points increase in error, 0 points decrease in error
   (*.f64 (cos.f64 re) (fma.f64 1/2 (exp.f64 im) (/.f64 (Rewrite<= metadata-eval (*.f64 1/2 1)) (exp.f64 im)))): 0 points increase in error, 0 points decrease in error
   (*.f64 (cos.f64 re) (fma.f64 1/2 (exp.f64 im) (Rewrite<= associate-*r/_binary64 (*.f64 1/2 (/.f64 1 (exp.f64 im)))))): 0 points increase in error, 0 points decrease in error
   (*.f64 (cos.f64 re) (fma.f64 1/2 (exp.f64 im) (*.f64 1/2 (Rewrite<= exp-neg_binary64 (exp.f64 (neg.f64 im)))))): 1 points increase in error, 1 points decrease in error
   (*.f64 (cos.f64 re) (Rewrite<= fma-def_binary64 (+.f64 (*.f64 1/2 (exp.f64 im)) (*.f64 1/2 (exp.f64 (neg.f64 im)))))): 0 points increase in error, 0 points decrease in error
   (*.f64 (cos.f64 re) (Rewrite<= distribute-lft-in_binary64 (*.f64 1/2 (+.f64 (exp.f64 im) (exp.f64 (neg.f64 im)))))): 0 points increase in error, 0 points decrease in error
   (*.f64 (cos.f64 re) (*.f64 1/2 (Rewrite<= +-commutative_binary64 (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))))): 0 points increase in error, 0 points decrease in error
   (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 (cos.f64 re) 1/2) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))): 0 points increase in error, 0 points decrease in error
   (*.f64 (Rewrite<= *-commutative_binary64 (*.f64 1/2 (cos.f64 re))) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))): 0 points increase in error, 0 points decrease in error

3. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\left(0.5 \cdot e^{im}\right) \cdot \cos re + \frac{0.5}{e^{im}} \cdot \cos re} \]

4. Final simplification 0.0

   \[\leadsto \left(0.5 \cdot e^{im}\right) \cdot \cos re + \cos re \cdot \frac{0.5}{e^{im}} \]

Alternatives

Alternative 1
Error	0.0
Cost	12992

\[\cos re \cdot \cosh im \]

Alternative 2
Error	0.9
Cost	6976

\[\left(0.5 \cdot \cos re\right) \cdot \left(2 + im \cdot im\right) \]

Alternative 3
Error	1.1
Cost	6848

\[\cos re + 0.5 \cdot \left(im \cdot im\right) \]

Alternative 4
Error	1.3
Cost	6464

\[\cos re \]

Alternative 5
Error	28.6
Cost	448

\[0.5 \cdot \left(2 + im \cdot im\right) \]

Alternative 6
Error	28.8
Cost	64

\[1 \]

Reproduce

herbie shell --seed 2022332 
(FPCore (re im)
  :name "math.cos on complex, real part"
  :precision binary64
  (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))