VandenBroeck and Keller, Equation (6)

Average Error: 16.4 → 0.9

Time: 12.3s

Precision: binary64

Cost: 32968

Math

\[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]

↓

\[\begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq -2 \cdot 10^{+29}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\pi \cdot \ell \leq 20000:\\ \;\;\;\;\pi \cdot \ell - \frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

FPCore

(FPCore (F l)
 :precision binary64
 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))

↓

(FPCore (F l)
 :precision binary64
 (if (<= (* PI l) -2e+29)
   (* PI l)
   (if (<= (* PI l) 20000.0)
     (- (* PI l) (/ (/ (tan (* PI l)) F) F))
     (* PI l))))

C

double code(double F, double l) {
	return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}

↓

double code(double F, double l) {
	double tmp;
	if ((((double) M_PI) * l) <= -2e+29) {
		tmp = ((double) M_PI) * l;
	} else if ((((double) M_PI) * l) <= 20000.0) {
		tmp = (((double) M_PI) * l) - ((tan((((double) M_PI) * l)) / F) / F);
	} else {
		tmp = ((double) M_PI) * l;
	}
	return tmp;
}

Java

public static double code(double F, double l) {
	return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}

↓

public static double code(double F, double l) {
	double tmp;
	if ((Math.PI * l) <= -2e+29) {
		tmp = Math.PI * l;
	} else if ((Math.PI * l) <= 20000.0) {
		tmp = (Math.PI * l) - ((Math.tan((Math.PI * l)) / F) / F);
	} else {
		tmp = Math.PI * l;
	}
	return tmp;
}

Python

def code(F, l):
	return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))

↓

def code(F, l):
	tmp = 0
	if (math.pi * l) <= -2e+29:
		tmp = math.pi * l
	elif (math.pi * l) <= 20000.0:
		tmp = (math.pi * l) - ((math.tan((math.pi * l)) / F) / F)
	else:
		tmp = math.pi * l
	return tmp

Julia

function code(F, l)
	return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l))))
end

↓

function code(F, l)
	tmp = 0.0
	if (Float64(pi * l) <= -2e+29)
		tmp = Float64(pi * l);
	elseif (Float64(pi * l) <= 20000.0)
		tmp = Float64(Float64(pi * l) - Float64(Float64(tan(Float64(pi * l)) / F) / F));
	else
		tmp = Float64(pi * l);
	end
	return tmp
end

MATLAB

function tmp = code(F, l)
	tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l)));
end

↓

function tmp_2 = code(F, l)
	tmp = 0.0;
	if ((pi * l) <= -2e+29)
		tmp = pi * l;
	elseif ((pi * l) <= 20000.0)
		tmp = (pi * l) - ((tan((pi * l)) / F) / F);
	else
		tmp = pi * l;
	end
	tmp_2 = tmp;
end

Wolfram

code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[F_, l_] := If[LessEqual[N[(Pi * l), $MachinePrecision], -2e+29], N[(Pi * l), $MachinePrecision], If[LessEqual[N[(Pi * l), $MachinePrecision], 20000.0], N[(N[(Pi * l), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < -1.99999999999999983e29 or 2e4 < (*.f64 (PI.f64) l)

   1. Initial program 23.1

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]

   2. Simplified 23.1

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
      Proof
      (-.f64 (*.f64 (PI.f64) l) (/.f64 (tan.f64 (*.f64 (PI.f64) l)) (*.f64 F F))): 0 points increase in error, 0 points decrease in error
      (-.f64 (*.f64 (PI.f64) l) (/.f64 (Rewrite<= *-lft-identity_binary64 (*.f64 1 (tan.f64 (*.f64 (PI.f64) l)))) (*.f64 F F))): 0 points increase in error, 0 points decrease in error
      (-.f64 (*.f64 (PI.f64) l) (Rewrite<= associate-*l/_binary64 (*.f64 (/.f64 1 (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l))))): 12 points increase in error, 4 points decrease in error

   3. Taylor expanded in l around inf 0.5

      \[\leadsto \color{blue}{\ell \cdot \pi} \]

   if -1.99999999999999983e29 < (*.f64 (PI.f64) l) < 2e4

   1. Initial program 9.5

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]

   2. Applied egg-rr 1.2

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{F}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 0.9

   \[\leadsto \begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq -2 \cdot 10^{+29}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\pi \cdot \ell \leq 20000:\\ \;\;\;\;\pi \cdot \ell - \frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternatives

Alternative 1
Error	1.2
Cost	26568

\[\begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq -2 \cdot 10^{+29}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\pi \cdot \ell \leq 20000:\\ \;\;\;\;\pi \cdot \ell - \pi \cdot \frac{\frac{\ell}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 2
Error	5.1
Cost	13640

\[\begin{array}{l} \mathbf{if}\;\ell \leq -9.359132116946702 \cdot 10^{+28}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 6200:\\ \;\;\;\;\pi \cdot \ell - \pi \cdot \frac{\ell}{F \cdot F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 3
Error	5.3
Cost	13512

\[\begin{array}{l} \mathbf{if}\;\ell \leq -9.359132116946702 \cdot 10^{+28}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 6200:\\ \;\;\;\;\ell \cdot \left(\pi - \frac{\frac{\pi}{F}}{F}\right)\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 4
Error	13.3
Cost	6528

\[\pi \cdot \ell \]

Alternative 5
Error	61.9
Cost	64

\[0 \]

Reproduce

herbie shell --seed 2022308 
(FPCore (F l)
  :name "VandenBroeck and Keller, Equation (6)"
  :precision binary64
  (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))