Falkner and Boettcher, Appendix A

Average Error: 1.9 → 0.1

Time: 14.5s

Precision: binary64

Cost: 13508

Math

\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]

↓

\[\begin{array}{l} \mathbf{if}\;k \leq 2 \cdot 10^{+144}:\\ \;\;\;\;\frac{a \cdot {k}^{m}}{\left(1 + k \cdot 10\right) + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{m \cdot \log k}}{k} \cdot \frac{a}{k}\\ \end{array} \]

FPCore

(FPCore (a k m)
 :precision binary64
 (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))

↓

(FPCore (a k m)
 :precision binary64
 (if (<= k 2e+144)
   (/ (* a (pow k m)) (+ (+ 1.0 (* k 10.0)) (* k k)))
   (* (/ (exp (* m (log k))) k) (/ a k))))

C

double code(double a, double k, double m) {
	return (a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}

↓

double code(double a, double k, double m) {
	double tmp;
	if (k <= 2e+144) {
		tmp = (a * pow(k, m)) / ((1.0 + (k * 10.0)) + (k * k));
	} else {
		tmp = (exp((m * log(k))) / k) * (a / k);
	}
	return tmp;
}

Fortran

real(8) function code(a, k, m)
    real(8), intent (in) :: a
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    code = (a * (k ** m)) / ((1.0d0 + (10.0d0 * k)) + (k * k))
end function

↓

real(8) function code(a, k, m)
    real(8), intent (in) :: a
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (k <= 2d+144) then
        tmp = (a * (k ** m)) / ((1.0d0 + (k * 10.0d0)) + (k * k))
    else
        tmp = (exp((m * log(k))) / k) * (a / k)
    end if
    code = tmp
end function

Java

public static double code(double a, double k, double m) {
	return (a * Math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}

↓

public static double code(double a, double k, double m) {
	double tmp;
	if (k <= 2e+144) {
		tmp = (a * Math.pow(k, m)) / ((1.0 + (k * 10.0)) + (k * k));
	} else {
		tmp = (Math.exp((m * Math.log(k))) / k) * (a / k);
	}
	return tmp;
}

Python

def code(a, k, m):
	return (a * math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k))

↓

def code(a, k, m):
	tmp = 0
	if k <= 2e+144:
		tmp = (a * math.pow(k, m)) / ((1.0 + (k * 10.0)) + (k * k))
	else:
		tmp = (math.exp((m * math.log(k))) / k) * (a / k)
	return tmp

Julia

function code(a, k, m)
	return Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(10.0 * k)) + Float64(k * k)))
end

↓

function code(a, k, m)
	tmp = 0.0
	if (k <= 2e+144)
		tmp = Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(k * 10.0)) + Float64(k * k)));
	else
		tmp = Float64(Float64(exp(Float64(m * log(k))) / k) * Float64(a / k));
	end
	return tmp
end

MATLAB

function tmp = code(a, k, m)
	tmp = (a * (k ^ m)) / ((1.0 + (10.0 * k)) + (k * k));
end

↓

function tmp_2 = code(a, k, m)
	tmp = 0.0;
	if (k <= 2e+144)
		tmp = (a * (k ^ m)) / ((1.0 + (k * 10.0)) + (k * k));
	else
		tmp = (exp((m * log(k))) / k) * (a / k);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, k_, m_] := N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + N[(10.0 * k), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[a_, k_, m_] := If[LessEqual[k, 2e+144], N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Exp[N[(m * N[Log[k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision] * N[(a / k), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if k < 2.00000000000000005e144

   1. Initial program 0.1

      \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]

   if 2.00000000000000005e144 < k

   1. Initial program 8.9

      \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \]

   2. Taylor expanded in k around inf 8.9

      \[\leadsto \color{blue}{\frac{a \cdot e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)}}{{k}^{2}}} \]

   3. Simplified 0.1

      \[\leadsto \color{blue}{\frac{e^{\left(-\log k\right) \cdot \left(-m\right)}}{k} \cdot \frac{a}{k}} \]
      Proof

      [Start] 8.9	\[ \frac{a \cdot e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)}}{{k}^{2}} \]
      *-commutative [=>] 8.9	\[ \frac{\color{blue}{e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)} \cdot a}}{{k}^{2}} \]
      unpow2 [=>] 8.9	\[ \frac{e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)} \cdot a}{\color{blue}{k \cdot k}} \]
      times-frac [=>] 0.1	\[ \color{blue}{\frac{e^{-1 \cdot \left(\log \left(\frac{1}{k}\right) \cdot m\right)}}{k} \cdot \frac{a}{k}} \]
      mul-1-neg [=>] 0.1	\[ \frac{e^{\color{blue}{-\log \left(\frac{1}{k}\right) \cdot m}}}{k} \cdot \frac{a}{k} \]
      distribute-rgt-neg-in [=>] 0.1	\[ \frac{e^{\color{blue}{\log \left(\frac{1}{k}\right) \cdot \left(-m\right)}}}{k} \cdot \frac{a}{k} \]
      log-rec [=>] 0.1	\[ \frac{e^{\color{blue}{\left(-\log k\right)} \cdot \left(-m\right)}}{k} \cdot \frac{a}{k} \]

3. Recombined 2 regimes into one program.

4. Final simplification 0.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;k \leq 2 \cdot 10^{+144}:\\ \;\;\;\;\frac{a \cdot {k}^{m}}{\left(1 + k \cdot 10\right) + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{m \cdot \log k}}{k} \cdot \frac{a}{k}\\ \end{array} \]

Alternatives

Alternative 1
Error	0.1
Cost	7428

\[\begin{array}{l} \mathbf{if}\;k \leq 10^{+145}:\\ \;\;\;\;\frac{a \cdot {k}^{m}}{\left(1 + k \cdot 10\right) + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k + 10}\\ \end{array} \]

Alternative 2
Error	0.1
Cost	7300

\[\begin{array}{l} \mathbf{if}\;k \leq 1.96 \cdot 10^{+99}:\\ \;\;\;\;\frac{{k}^{m}}{\frac{1 + k \cdot \left(k + 10\right)}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k + 10}\\ \end{array} \]

Alternative 3
Error	2.1
Cost	7176

\[\begin{array}{l} t_0 := a \cdot {k}^{m}\\ \mathbf{if}\;k \leq 1.35 \cdot 10^{-12}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq 2.9 \cdot 10^{+169}:\\ \;\;\;\;\frac{t_0}{k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 4
Error	1.0
Cost	7172

\[\begin{array}{l} \mathbf{if}\;k \leq 1.35 \cdot 10^{-12}:\\ \;\;\;\;\left(a \cdot {k}^{m}\right) \cdot \left(1 + k \cdot -10\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{{k}^{m}}{k \cdot \frac{k}{a}}\\ \end{array} \]

Alternative 5
Error	0.5
Cost	7172

\[\begin{array}{l} \mathbf{if}\;k \leq 3.8 \cdot 10^{-7}:\\ \;\;\;\;\left(a \cdot {k}^{m}\right) \cdot \left(1 + k \cdot -10\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{k} \cdot \frac{{k}^{m}}{k + 10}\\ \end{array} \]

Alternative 6
Error	1.0
Cost	7044

\[\begin{array}{l} \mathbf{if}\;k \leq 1.35 \cdot 10^{-12}:\\ \;\;\;\;a \cdot {k}^{m}\\ \mathbf{else}:\\ \;\;\;\;\frac{{k}^{m}}{k \cdot \frac{k}{a}}\\ \end{array} \]

Alternative 7
Error	4.9
Cost	6788

\[\begin{array}{l} \mathbf{if}\;k \leq 60:\\ \;\;\;\;a \cdot {k}^{m}\\ \mathbf{elif}\;k \leq 1.5 \cdot 10^{+81}:\\ \;\;\;\;\frac{a}{1 + \frac{\left(k \cdot k\right) \cdot \left(k \cdot k\right) + \left(k \cdot 10\right) \cdot \left(k \cdot -10\right)}{k \cdot k + k \cdot -10}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{k \cdot \frac{k}{a}}\\ \end{array} \]

Alternative 8
Error	16.1
Cost	1096

\[\begin{array}{l} \mathbf{if}\;m \leq -0.39:\\ \;\;\;\;\left(1 + \frac{a}{k \cdot k}\right) + -1\\ \mathbf{elif}\;m \leq 0.62:\\ \;\;\;\;\frac{a}{1 + \left(1 + \left(k \cdot \left(k + 10\right) + -1\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]

Alternative 9
Error	21.5
Cost	844

\[\begin{array}{l} t_0 := -10 \cdot \left(k \cdot a\right)\\ \mathbf{if}\;k \leq -0.46:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -1 \cdot 10^{-310}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq 0.098:\\ \;\;\;\;a + t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 10
Error	21.6
Cost	844

\[\begin{array}{l} t_0 := -10 \cdot \left(k \cdot a\right)\\ \mathbf{if}\;k \leq -0.46:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -1 \cdot 10^{-310}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq 0.098:\\ \;\;\;\;a + t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{k \cdot \frac{k}{a}}\\ \end{array} \]

Alternative 11
Error	16.1
Cost	840

\[\begin{array}{l} \mathbf{if}\;m \leq -0.8:\\ \;\;\;\;\left(1 + \frac{a}{k \cdot k}\right) + -1\\ \mathbf{elif}\;m \leq 3.7:\\ \;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]

Alternative 12
Error	22.4
Cost	716

\[\begin{array}{l} t_0 := \frac{a}{k \cdot k}\\ \mathbf{if}\;k \leq -0.46:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq -1 \cdot 10^{-310}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \mathbf{elif}\;k \leq 1:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 13
Error	21.7
Cost	716

\[\begin{array}{l} \mathbf{if}\;k \leq -0.46:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -1 \cdot 10^{-310}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \mathbf{elif}\;k \leq 1:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 14
Error	16.7
Cost	712

\[\begin{array}{l} \mathbf{if}\;m \leq -2.2:\\ \;\;\;\;\left(1 + \frac{a}{k \cdot k}\right) + -1\\ \mathbf{elif}\;m \leq 0.6:\\ \;\;\;\;\frac{a}{1 + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]

Alternative 15
Error	20.4
Cost	580

\[\begin{array}{l} \mathbf{if}\;m \leq 1.4:\\ \;\;\;\;\frac{a}{1 + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]

Alternative 16
Error	43.0
Cost	452

\[\begin{array}{l} \mathbf{if}\;m \leq 0.29:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(k \cdot a\right)\\ \end{array} \]

Alternative 17
Error	46.7
Cost	64

\[a \]

Reproduce

herbie shell --seed 2022354 
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  :precision binary64
  (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))