Average Error: 57.9 → 0.8
Time: 12.4s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double re, double im) {
	return ((double) (((double) (0.5 * ((double) cos(re)))) * ((double) (((double) exp(((double) (0.0 - im)))) - ((double) exp(im))))));
}

↓
double code(double re, double im) {
	return ((double) (((double) (0.5 * ((double) cos(re)))) * ((double) (((double) (((double) pow(im, 3.0)) * -0.3333333333333333)) + ((double) (((double) (im * -2.0)) + ((double) (((double) pow(im, 5.0)) * -0.016666666666666666))))))));
}

Error
Bits error versus re
Bits error versus im
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original57.9
Target0.3
Herbie0.8
\[\]
Derivation
  1. Initial program 57.9
    \[\]
  2. Taylor expanded around 0 0.8
    \[\leadsto \]
  3. Simplified0.8
    \[\leadsto \]
  4. Final simplification0.8
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (re im)
  :name "math.sin on complex, imaginary part"
  :precision binary64

  :herbie-target
  (if (< (fabs im) 1.0) (neg (* (cos re) (+ (+ im (* (* (* 0.16666666666666666 im) im) im)) (* (* (* (* (* 0.008333333333333333 im) im) im) im) im)))) (* (* 0.5 (cos re)) (- (exp (- 0.0 im)) (exp im))))

  (* (* 0.5 (cos re)) (- (exp (- 0.0 im)) (exp im))))