Falkner and Boettcher, Appendix A

Average Error: 2.2 → 0.3

Time: 12.1s

Precision: binary64

Cost: 22024

Math

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

↓

\[\begin{array}{l} t_0 := a \cdot {k}^{m}\\ t_1 := \frac{t_0}{\left(1 + k \cdot 10\right) + k \cdot k}\\ \mathbf{if}\;t_1 \leq -5 \cdot 10^{-303}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_1 \leq 0:\\ \;\;\;\;\frac{1}{k \cdot \frac{k}{t_0}}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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
 (let* ((t_0 (* a (pow k m))) (t_1 (/ t_0 (+ (+ 1.0 (* k 10.0)) (* k k)))))
   (if (<= t_1 -5e-303) t_1 (if (<= t_1 0.0) (/ 1.0 (* k (/ k t_0))) t_1))))

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 t_0 = a * pow(k, m);
	double t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	double tmp;
	if (t_1 <= -5e-303) {
		tmp = t_1;
	} else if (t_1 <= 0.0) {
		tmp = 1.0 / (k * (k / t_0));
	} else {
		tmp = t_1;
	}
	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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = a * (k ** m)
    t_1 = t_0 / ((1.0d0 + (k * 10.0d0)) + (k * k))
    if (t_1 <= (-5d-303)) then
        tmp = t_1
    else if (t_1 <= 0.0d0) then
        tmp = 1.0d0 / (k * (k / t_0))
    else
        tmp = t_1
    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 t_0 = a * Math.pow(k, m);
	double t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	double tmp;
	if (t_1 <= -5e-303) {
		tmp = t_1;
	} else if (t_1 <= 0.0) {
		tmp = 1.0 / (k * (k / t_0));
	} else {
		tmp = t_1;
	}
	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):
	t_0 = a * math.pow(k, m)
	t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k))
	tmp = 0
	if t_1 <= -5e-303:
		tmp = t_1
	elif t_1 <= 0.0:
		tmp = 1.0 / (k * (k / t_0))
	else:
		tmp = t_1
	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)
	t_0 = Float64(a * (k ^ m))
	t_1 = Float64(t_0 / Float64(Float64(1.0 + Float64(k * 10.0)) + Float64(k * k)))
	tmp = 0.0
	if (t_1 <= -5e-303)
		tmp = t_1;
	elseif (t_1 <= 0.0)
		tmp = Float64(1.0 / Float64(k * Float64(k / t_0)));
	else
		tmp = t_1;
	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)
	t_0 = a * (k ^ m);
	t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	tmp = 0.0;
	if (t_1 <= -5e-303)
		tmp = t_1;
	elseif (t_1 <= 0.0)
		tmp = 1.0 / (k * (k / t_0));
	else
		tmp = t_1;
	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_] := Block[{t$95$0 = N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 / N[(N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-303], t$95$1, If[LessEqual[t$95$1, 0.0], N[(1.0 / N[(k * N[(k / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))) < -4.9999999999999998e-303 or -0.0 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k)))

   1. Initial program 0.3

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

   if -4.9999999999999998e-303 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))) < -0.0

   1. Initial program 3.2

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

   2. Simplified 3.2

      \[\leadsto \color{blue}{a \cdot \frac{{k}^{m}}{\mathsf{fma}\left(k, k + 10, 1\right)}} \]
      Proof
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (+.f64 k 10) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (fma.f64 k (Rewrite<= +-commutative_binary64 (+.f64 10 k)) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= fma-def_binary64 (+.f64 (*.f64 k (+.f64 10 k)) 1)))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (+.f64 (Rewrite<= distribute-rgt-out_binary64 (+.f64 (*.f64 10 k) (*.f64 k k))) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= +-commutative_binary64 (+.f64 1 (+.f64 (*.f64 10 k) (*.f64 k k)))))): 0 points increase in error, 0 points decrease in error
      (*.f64 a (/.f64 (pow.f64 k m) (Rewrite<= associate-+l+_binary64 (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k))))): 0 points increase in error, 1 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 1 (*.f64 10 k)) (*.f64 k k)))): 3 points increase in error, 7 points decrease in error

   3. Applied egg-rr 3.3

      \[\leadsto \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(k, k + 10, 1\right)}{a \cdot {k}^{m}}}} \]

   4. Taylor expanded in k around inf 32.8

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

   5. Simplified 0.3

      \[\leadsto \frac{1}{\color{blue}{\frac{k}{{k}^{m} \cdot a} \cdot k}} \]
      Proof
      (*.f64 (/.f64 k (*.f64 (pow.f64 k m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (Rewrite<= rem-exp-log_binary64 (exp.f64 (log.f64 k))) m) a)) k): 1 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (Rewrite<= remove-double-neg_binary64 (neg.f64 (neg.f64 (log.f64 k))))) m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (neg.f64 (Rewrite<= log-rec_binary64 (log.f64 (/.f64 1 k))))) m) a)) k): 1 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (pow.f64 (exp.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (log.f64 (/.f64 1 k))))) m) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (Rewrite<= exp-prod_binary64 (exp.f64 (*.f64 (*.f64 -1 (log.f64 (/.f64 1 k))) m))) a)) k): 1 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (*.f64 (exp.f64 (Rewrite<= associate-*r*_binary64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))) a)) k): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 k (Rewrite=> *-commutative_binary64 (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))))) k): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-/r/_binary64 (/.f64 k (/.f64 (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))) k))): 12 points increase in error, 14 points decrease in error
      (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 k k) (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m)))))): 16 points increase in error, 11 points decrease in error
      (/.f64 (Rewrite<= unpow2_binary64 (pow.f64 k 2)) (*.f64 a (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m))))): 0 points increase in error, 0 points decrease in error
      (/.f64 (pow.f64 k 2) (Rewrite<= *-commutative_binary64 (*.f64 (exp.f64 (*.f64 -1 (*.f64 (log.f64 (/.f64 1 k)) m))) a))): 0 points increase in error, 0 points decrease in error
3. Recombined 2 regimes into one program.

4. Final simplification 0.3

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

Alternatives

Alternative 1
Error	0.9
Cost	7172

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

Alternative 2
Error	0.6
Cost	7172

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

Alternative 3
Error	2.7
Cost	7044

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

Alternative 4
Error	2.7
Cost	6920

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

Alternative 5
Error	21.6
Cost	844

\[\begin{array}{l} t_0 := -10 \cdot \left(a \cdot k\right)\\ \mathbf{if}\;k \leq -9 \cdot 10^{+49}:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -2.85 \cdot 10^{-307}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq 0.0014:\\ \;\;\;\;a + t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 6
Error	21.5
Cost	844

\[\begin{array}{l} \mathbf{if}\;k \leq -9 \cdot 10^{+49}:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -2.85 \cdot 10^{-307}:\\ \;\;\;\;-10 \cdot \left(a \cdot k\right)\\ \mathbf{elif}\;k \leq 430:\\ \;\;\;\;\frac{a}{1 + k \cdot 10}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 7
Error	15.4
Cost	840

\[\begin{array}{l} \mathbf{if}\;m \leq -1.12 \cdot 10^{+18}:\\ \;\;\;\;a \cdot \left(\left(1 + \frac{0.1}{k}\right) + -1\right)\\ \mathbf{elif}\;m \leq 1.6 \cdot 10^{-6}:\\ \;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(a \cdot k\right)\\ \end{array} \]

Alternative 8
Error	22.7
Cost	716

\[\begin{array}{l} t_0 := \frac{a}{k \cdot k}\\ \mathbf{if}\;k \leq -9 \cdot 10^{+49}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;k \leq -2.85 \cdot 10^{-307}:\\ \;\;\;\;-10 \cdot \left(a \cdot k\right)\\ \mathbf{elif}\;k \leq 430:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 9
Error	21.7
Cost	716

\[\begin{array}{l} \mathbf{if}\;k \leq -9 \cdot 10^{+49}:\\ \;\;\;\;\frac{a}{k \cdot k}\\ \mathbf{elif}\;k \leq -2.85 \cdot 10^{-307}:\\ \;\;\;\;-10 \cdot \left(a \cdot k\right)\\ \mathbf{elif}\;k \leq 430:\\ \;\;\;\;a\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{k}}{k}\\ \end{array} \]

Alternative 10
Error	16.2
Cost	712

\[\begin{array}{l} \mathbf{if}\;m \leq -1.12 \cdot 10^{+18}:\\ \;\;\;\;a \cdot \left(\left(1 + \frac{0.1}{k}\right) + -1\right)\\ \mathbf{elif}\;m \leq 1.6 \cdot 10^{-6}:\\ \;\;\;\;\frac{a}{1 + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;-10 \cdot \left(a \cdot k\right)\\ \end{array} \]

Alternative 11
Error	20.9
Cost	580

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

Alternative 12
Error	43.2
Cost	452

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

Alternative 13
Error	46.9
Cost	64

\[a \]

Reproduce

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