Maksimov and Kolovsky, Equation (4)

Average Error: 17.5 → 0.1

Time: 11.8s

Precision: binary64

Cost: 13504

Math

\[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

↓

\[2 \cdot \left(\left(\cos \left(0.5 \cdot K\right) \cdot \sinh \ell\right) \cdot J\right) + U \]

FPCore

(FPCore (J l K U)
 :precision binary64
 (+ (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0))) U))

↓

(FPCore (J l K U)
 :precision binary64
 (+ (* 2.0 (* (* (cos (* 0.5 K)) (sinh l)) J)) U))

C

double code(double J, double l, double K, double U) {
	return ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
}

↓

double code(double J, double l, double K, double U) {
	return (2.0 * ((cos((0.5 * K)) * sinh(l)) * J)) + U;
}

Fortran

real(8) function code(j, l, k, u)
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = ((j * (exp(l) - exp(-l))) * cos((k / 2.0d0))) + u
end function

↓

real(8) function code(j, l, k, u)
    real(8), intent (in) :: j
    real(8), intent (in) :: l
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    code = (2.0d0 * ((cos((0.5d0 * k)) * sinh(l)) * j)) + u
end function

Java

public static double code(double J, double l, double K, double U) {
	return ((J * (Math.exp(l) - Math.exp(-l))) * Math.cos((K / 2.0))) + U;
}

↓

public static double code(double J, double l, double K, double U) {
	return (2.0 * ((Math.cos((0.5 * K)) * Math.sinh(l)) * J)) + U;
}

Python

def code(J, l, K, U):
	return ((J * (math.exp(l) - math.exp(-l))) * math.cos((K / 2.0))) + U

↓

def code(J, l, K, U):
	return (2.0 * ((math.cos((0.5 * K)) * math.sinh(l)) * J)) + U

Julia

function code(J, l, K, U)
	return Float64(Float64(Float64(J * Float64(exp(l) - exp(Float64(-l)))) * cos(Float64(K / 2.0))) + U)
end

↓

function code(J, l, K, U)
	return Float64(Float64(2.0 * Float64(Float64(cos(Float64(0.5 * K)) * sinh(l)) * J)) + U)
end

MATLAB

function tmp = code(J, l, K, U)
	tmp = ((J * (exp(l) - exp(-l))) * cos((K / 2.0))) + U;
end

↓

function tmp = code(J, l, K, U)
	tmp = (2.0 * ((cos((0.5 * K)) * sinh(l)) * J)) + U;
end

Wolfram

code[J_, l_, K_, U_] := N[(N[(N[(J * N[(N[Exp[l], $MachinePrecision] - N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]

↓

code[J_, l_, K_, U_] := N[(N[(2.0 * N[(N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * N[Sinh[l], $MachinePrecision]), $MachinePrecision] * J), $MachinePrecision]), $MachinePrecision] + U), $MachinePrecision]

Derivation

1. Initial program 17.5

   \[\left(J \cdot \left(e^{\ell} - e^{-\ell}\right)\right) \cdot \cos \left(\frac{K}{2}\right) + U \]

2. Applied egg-rr 0.1

   \[\leadsto \color{blue}{{\left(J \cdot \left(\left(2 \cdot \sinh \ell\right) \cdot \cos \left(K \cdot 0.5\right)\right)\right)}^{1}} + U \]

3. Simplified 0.1

   \[\leadsto \color{blue}{2 \cdot \left(\left(\cos \left(0.5 \cdot K\right) \cdot \sinh \ell\right) \cdot J\right)} + U \]
   Proof
   (*.f64 2 (*.f64 (*.f64 (cos.f64 (*.f64 1/2 K)) (sinh.f64 l)) J)): 0 points increase in error, 0 points decrease in error
   (*.f64 2 (*.f64 (Rewrite<= *-commutative_binary64 (*.f64 (sinh.f64 l) (cos.f64 (*.f64 1/2 K)))) J)): 0 points increase in error, 0 points decrease in error
   (*.f64 2 (*.f64 (*.f64 (sinh.f64 l) (cos.f64 (Rewrite=> *-commutative_binary64 (*.f64 K 1/2)))) J)): 0 points increase in error, 0 points decrease in error
   (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 2 (*.f64 (sinh.f64 l) (cos.f64 (*.f64 K 1/2)))) J)): 1 points increase in error, 0 points decrease in error
   (*.f64 (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 2 (sinh.f64 l)) (cos.f64 (*.f64 K 1/2)))) J): 0 points increase in error, 0 points decrease in error
   (Rewrite<= *-commutative_binary64 (*.f64 J (*.f64 (*.f64 2 (sinh.f64 l)) (cos.f64 (*.f64 K 1/2))))): 0 points increase in error, 0 points decrease in error
   (Rewrite<= unpow1_binary64 (pow.f64 (*.f64 J (*.f64 (*.f64 2 (sinh.f64 l)) (cos.f64 (*.f64 K 1/2)))) 1)): 0 points increase in error, 0 points decrease in error

4. Final simplification 0.1

   \[\leadsto 2 \cdot \left(\left(\cos \left(0.5 \cdot K\right) \cdot \sinh \ell\right) \cdot J\right) + U \]

Alternatives

Alternative 1
Error	0.7
Cost	13376

\[\mathsf{fma}\left(J \cdot \left(\ell + \ell\right), \cos \left(\frac{K}{2}\right), U\right) \]

Alternative 2
Error	9.6
Cost	7240

\[\begin{array}{l} t_0 := 2 \cdot \left(J \cdot \left(\cos \left(0.5 \cdot K\right) \cdot \ell\right)\right)\\ \mathbf{if}\;J \leq -9.5 \cdot 10^{+149}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;J \leq 1.9 \cdot 10^{+212}:\\ \;\;\;\;U + J \cdot \left(2 \cdot \sinh \ell\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	9.6
Cost	7240

\[\begin{array}{l} t_0 := \cos \left(0.5 \cdot K\right)\\ \mathbf{if}\;J \leq -1.7 \cdot 10^{+147}:\\ \;\;\;\;2 \cdot \left(\ell \cdot \left(t_0 \cdot J\right)\right)\\ \mathbf{elif}\;J \leq 4.3 \cdot 10^{+212}:\\ \;\;\;\;U + J \cdot \left(2 \cdot \sinh \ell\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(J \cdot \left(t_0 \cdot \ell\right)\right)\\ \end{array} \]

Alternative 4
Error	9.5
Cost	7240

\[\begin{array}{l} t_0 := \left(\ell \cdot J\right) \cdot \left(2 \cdot \cos \left(0.5 \cdot K\right)\right)\\ \mathbf{if}\;J \leq -2.2 \cdot 10^{+150}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;J \leq 2.2 \cdot 10^{+209}:\\ \;\;\;\;U + J \cdot \left(2 \cdot \sinh \ell\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 5
Error	0.7
Cost	7104

\[U + 2 \cdot \left(J \cdot \left(\cos \left(0.5 \cdot K\right) \cdot \ell\right)\right) \]

Alternative 6
Error	0.7
Cost	7104

\[U + \left(J \cdot \left(\ell + \ell\right)\right) \cdot \cos \left(\frac{K}{2}\right) \]

Alternative 7
Error	8.7
Cost	6848

\[U + J \cdot \left(2 \cdot \sinh \ell\right) \]

Alternative 8
Error	9.0
Cost	6720

\[\mathsf{fma}\left(\ell + \ell, J, U\right) \]

Alternative 9
Error	20.2
Cost	584

\[\begin{array}{l} t_0 := J \cdot \left(\ell + \ell\right)\\ \mathbf{if}\;J \leq -3 \cdot 10^{+85}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;J \leq 1.85 \cdot 10^{+201}:\\ \;\;\;\;U\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 10
Error	9.0
Cost	448

\[U + J \cdot \left(\ell + \ell\right) \]

Alternative 11
Error	18.9
Cost	64

\[U \]

Reproduce

herbie shell --seed 2022328 
(FPCore (J l K U)
  :name "Maksimov and Kolovsky, Equation (4)"
  :precision binary64
  (+ (* (* J (- (exp l) (exp (- l)))) (cos (/ K 2.0))) U))