VandenBroeck and Keller, Equation (6)

Average Error: 16.0 → 0.5

Time: 13.1s

Precision: binary64

Cost: 33096

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 -5 \cdot 10^{+17}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\pi \cdot \ell \leq 100000000000:\\ \;\;\;\;\pi \cdot \ell - \frac{\frac{1}{F} \cdot \tan \left(\pi \cdot \ell\right)}{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) -5e+17)
   (* PI l)
   (if (<= (* PI l) 100000000000.0)
     (- (* PI l) (/ (* (/ 1.0 F) (tan (* PI l))) 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) <= -5e+17) {
		tmp = ((double) M_PI) * l;
	} else if ((((double) M_PI) * l) <= 100000000000.0) {
		tmp = (((double) M_PI) * l) - (((1.0 / F) * tan((((double) M_PI) * l))) / 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) <= -5e+17) {
		tmp = Math.PI * l;
	} else if ((Math.PI * l) <= 100000000000.0) {
		tmp = (Math.PI * l) - (((1.0 / F) * Math.tan((Math.PI * l))) / 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) <= -5e+17:
		tmp = math.pi * l
	elif (math.pi * l) <= 100000000000.0:
		tmp = (math.pi * l) - (((1.0 / F) * math.tan((math.pi * l))) / 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) <= -5e+17)
		tmp = Float64(pi * l);
	elseif (Float64(pi * l) <= 100000000000.0)
		tmp = Float64(Float64(pi * l) - Float64(Float64(Float64(1.0 / F) * tan(Float64(pi * l))) / 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) <= -5e+17)
		tmp = pi * l;
	elseif ((pi * l) <= 100000000000.0)
		tmp = (pi * l) - (((1.0 / F) * tan((pi * l))) / 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], -5e+17], N[(Pi * l), $MachinePrecision], If[LessEqual[N[(Pi * l), $MachinePrecision], 100000000000.0], N[(N[(Pi * l), $MachinePrecision] - N[(N[(N[(1.0 / F), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < -5e17 or 1e11 < (*.f64 (PI.f64) l)

   1. Initial program 22.8

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

   2. Simplified 22.8

      \[\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))))): 4 points increase in error, 5 points decrease in error

   3. Taylor expanded in l around 0 31.9

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\ell \cdot \pi}{{F}^{2}}} \]

   4. Simplified 31.9

      \[\leadsto \pi \cdot \ell - \color{blue}{\pi \cdot \frac{\ell}{F \cdot F}} \]
      Proof
      (*.f64 (PI.f64) (/.f64 l (*.f64 F F))): 0 points increase in error, 0 points decrease in error
      (*.f64 (PI.f64) (/.f64 l (Rewrite<= unpow2_binary64 (pow.f64 F 2)))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= *-commutative_binary64 (*.f64 (/.f64 l (pow.f64 F 2)) (PI.f64))): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*l/_binary64 (/.f64 (*.f64 l (PI.f64)) (pow.f64 F 2))): 19 points increase in error, 11 points decrease in error

   5. Taylor expanded in F around inf 0.3

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

   if -5e17 < (*.f64 (PI.f64) l) < 1e11

   1. Initial program 9.0

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

   2. Applied egg-rr 0.6

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

4. Final simplification 0.5

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

Alternatives

Alternative 1
Error	0.5
Cost	32968

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

Alternative 2
Error	0.7
Cost	13640

\[\begin{array}{l} \mathbf{if}\;\ell \leq -26000000:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 23450291177.17826:\\ \;\;\;\;\pi \cdot \ell - \pi \cdot \frac{\frac{\ell}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 3
Error	0.7
Cost	13640

\[\begin{array}{l} \mathbf{if}\;\ell \leq -26000000:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 23450291177.17826:\\ \;\;\;\;\pi \cdot \ell - \frac{\pi \cdot \frac{\ell}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 4
Error	0.7
Cost	13640

\[\begin{array}{l} \mathbf{if}\;\ell \leq -26000000:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 23450291177.17826:\\ \;\;\;\;\pi \cdot \ell - \frac{\ell \cdot \frac{\pi}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 5
Error	13.2
Cost	7376

\[\begin{array}{l} t_0 := \ell \cdot \frac{-\pi}{F \cdot F}\\ \mathbf{if}\;F \leq -2.0704543399882898 \cdot 10^{-10}:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;F \leq -8.394681472051628 \cdot 10^{-98}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;F \leq 1.555976709130236 \cdot 10^{-105}:\\ \;\;\;\;\left(\pi \cdot \ell + 1\right) + -1\\ \mathbf{elif}\;F \leq 9.827482609149869 \cdot 10^{-45}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 6
Error	4.6
Cost	7176

\[\begin{array}{l} \mathbf{if}\;\ell \leq -26000000:\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{elif}\;\ell \leq 23450291177.17826:\\ \;\;\;\;\pi \cdot \left(\ell - \frac{\ell}{F \cdot F}\right)\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]

Alternative 7
Error	13.4
Cost	6528

\[\pi \cdot \ell \]

Reproduce

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