Falkner and Boettcher, Appendix A

Percentage Accurate: 90.5% → 98.9%

Time: 10.2s

Alternatives: 13

Speedup: 1.1×

• 22.6% of points produce a very large (infinite) output. You may want to add a precondition.

• could not determine a ground truth

  1. a = -1.9999999999999999e-154
  2. k = 0.0
  3. m = -2.00000000000000007e154

Specification

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, k, m)
	tmp = (a * (k ^ m)) / ((1.0 + (10.0 * k)) + (k * k));
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]

Initial Program: 90.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, k, m)
	tmp = (a * (k ^ m)) / ((1.0 + (10.0 * k)) + (k * k));
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]

Alternative 1: 98.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ \begin{array}{l} t_0 := a_m \cdot {k}^{m}\\ a_s \cdot \begin{array}{l} \mathbf{if}\;\frac{t_0}{\left(1 + k \cdot 10\right) + k \cdot k} \leq 5 \cdot 10^{+228}:\\ \;\;\;\;\frac{{k}^{m}}{\mathsf{hypot}\left(1, k\right)} \cdot \frac{a_m}{\mathsf{hypot}\left(1, k\right)}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (let* ((t_0 (* a_m (pow k m))))
   (*
    a_s
    (if (<= (/ t_0 (+ (+ 1.0 (* k 10.0)) (* k k))) 5e+228)
      (* (/ (pow k m) (hypot 1.0 k)) (/ a_m (hypot 1.0 k)))
      t_0))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * pow(k, m);
	double tmp;
	if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 5e+228) {
		tmp = (pow(k, m) / hypot(1.0, k)) * (a_m / hypot(1.0, k));
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * Math.pow(k, m);
	double tmp;
	if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 5e+228) {
		tmp = (Math.pow(k, m) / Math.hypot(1.0, k)) * (a_m / Math.hypot(1.0, k));
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	t_0 = a_m * math.pow(k, m)
	tmp = 0
	if (t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 5e+228:
		tmp = (math.pow(k, m) / math.hypot(1.0, k)) * (a_m / math.hypot(1.0, k))
	else:
		tmp = t_0
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	t_0 = Float64(a_m * (k ^ m))
	tmp = 0.0
	if (Float64(t_0 / Float64(Float64(1.0 + Float64(k * 10.0)) + Float64(k * k))) <= 5e+228)
		tmp = Float64(Float64((k ^ m) / hypot(1.0, k)) * Float64(a_m / hypot(1.0, k)));
	else
		tmp = t_0;
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	t_0 = a_m * (k ^ m);
	tmp = 0.0;
	if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 5e+228)
		tmp = ((k ^ m) / hypot(1.0, k)) * (a_m / hypot(1.0, k));
	else
		tmp = t_0;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(t$95$0 / N[(N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+228], N[(N[(N[Power[k, m], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + k ^ 2], $MachinePrecision]), $MachinePrecision] * N[(a$95$m / N[Sqrt[1.0 ^ 2 + k ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 97.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ \begin{array}{l} t_0 := a_m \cdot {k}^{m}\\ t_1 := \frac{t_0}{\left(1 + k \cdot 10\right) + k \cdot k}\\ a_s \cdot \begin{array}{l} \mathbf{if}\;t_1 \leq 5 \cdot 10^{+228}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (let* ((t_0 (* a_m (pow k m))) (t_1 (/ t_0 (+ (+ 1.0 (* k 10.0)) (* k k)))))
   (* a_s (if (<= t_1 5e+228) t_1 t_0))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * pow(k, m);
	double t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	double tmp;
	if (t_1 <= 5e+228) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = a_m * (k ** m)
    t_1 = t_0 / ((1.0d0 + (k * 10.0d0)) + (k * k))
    if (t_1 <= 5d+228) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * Math.pow(k, m);
	double t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	double tmp;
	if (t_1 <= 5e+228) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	t_0 = a_m * math.pow(k, m)
	t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k))
	tmp = 0
	if t_1 <= 5e+228:
		tmp = t_1
	else:
		tmp = t_0
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	t_0 = Float64(a_m * (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+228)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	t_0 = a_m * (k ^ m);
	t_1 = t_0 / ((1.0 + (k * 10.0)) + (k * k));
	tmp = 0.0;
	if (t_1 <= 5e+228)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * 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]}, N[(a$95$s * If[LessEqual[t$95$1, 5e+228], t$95$1, t$95$0]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 96.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;k \leq 0.8:\\ \;\;\;\;a_m \cdot {k}^{m}\\ \mathbf{else}:\\ \;\;\;\;\frac{{k}^{m}}{\mathsf{hypot}\left(1, k\right)} \cdot \frac{a_m}{k}\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (<= k 0.8) (* a_m (pow k m)) (* (/ (pow k m) (hypot 1.0 k)) (/ a_m k)))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.8) {
		tmp = a_m * pow(k, m);
	} else {
		tmp = (pow(k, m) / hypot(1.0, k)) * (a_m / k);
	}
	return a_s * tmp;
}

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.8) {
		tmp = a_m * Math.pow(k, m);
	} else {
		tmp = (Math.pow(k, m) / Math.hypot(1.0, k)) * (a_m / k);
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if k <= 0.8:
		tmp = a_m * math.pow(k, m)
	else:
		tmp = (math.pow(k, m) / math.hypot(1.0, k)) * (a_m / k)
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (k <= 0.8)
		tmp = Float64(a_m * (k ^ m));
	else
		tmp = Float64(Float64((k ^ m) / hypot(1.0, k)) * Float64(a_m / k));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (k <= 0.8)
		tmp = a_m * (k ^ m);
	else
		tmp = ((k ^ m) / hypot(1.0, k)) * (a_m / k);
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, 0.8], N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[k, m], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + k ^ 2], $MachinePrecision]), $MachinePrecision] * N[(a$95$m / k), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 97.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq 3.4:\\ \;\;\;\;\frac{a_m}{\frac{1 + k \cdot \left(k + 10\right)}{{k}^{m}}}\\ \mathbf{else}:\\ \;\;\;\;a_m \cdot {k}^{m}\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (<= m 3.4)
    (/ a_m (/ (+ 1.0 (* k (+ k 10.0))) (pow k m)))
    (* a_m (pow k m)))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 3.4) {
		tmp = a_m / ((1.0 + (k * (k + 10.0))) / pow(k, m));
	} else {
		tmp = a_m * pow(k, m);
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (m <= 3.4d0) then
        tmp = a_m / ((1.0d0 + (k * (k + 10.0d0))) / (k ** m))
    else
        tmp = a_m * (k ** m)
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 3.4) {
		tmp = a_m / ((1.0 + (k * (k + 10.0))) / Math.pow(k, m));
	} else {
		tmp = a_m * Math.pow(k, m);
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if m <= 3.4:
		tmp = a_m / ((1.0 + (k * (k + 10.0))) / math.pow(k, m))
	else:
		tmp = a_m * math.pow(k, m)
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (m <= 3.4)
		tmp = Float64(a_m / Float64(Float64(1.0 + Float64(k * Float64(k + 10.0))) / (k ^ m)));
	else
		tmp = Float64(a_m * (k ^ m));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (m <= 3.4)
		tmp = a_m / ((1.0 + (k * (k + 10.0))) / (k ^ m));
	else
		tmp = a_m * (k ^ m);
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 3.4], N[(a$95$m / N[(N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Power[k, m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 96.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ \begin{array}{l} t_0 := a_m \cdot {k}^{m}\\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq 2.7:\\ \;\;\;\;\frac{t_0}{1 + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (let* ((t_0 (* a_m (pow k m))))
   (* a_s (if (<= m 2.7) (/ t_0 (+ 1.0 (* k k))) t_0))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * pow(k, m);
	double tmp;
	if (m <= 2.7) {
		tmp = t_0 / (1.0 + (k * k));
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = a_m * (k ** m)
    if (m <= 2.7d0) then
        tmp = t_0 / (1.0d0 + (k * k))
    else
        tmp = t_0
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double t_0 = a_m * Math.pow(k, m);
	double tmp;
	if (m <= 2.7) {
		tmp = t_0 / (1.0 + (k * k));
	} else {
		tmp = t_0;
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	t_0 = a_m * math.pow(k, m)
	tmp = 0
	if m <= 2.7:
		tmp = t_0 / (1.0 + (k * k))
	else:
		tmp = t_0
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	t_0 = Float64(a_m * (k ^ m))
	tmp = 0.0
	if (m <= 2.7)
		tmp = Float64(t_0 / Float64(1.0 + Float64(k * k)));
	else
		tmp = t_0;
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	t_0 = a_m * (k ^ m);
	tmp = 0.0;
	if (m <= 2.7)
		tmp = t_0 / (1.0 + (k * k));
	else
		tmp = t_0;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[m, 2.7], N[(t$95$0 / N[(1.0 + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 97.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq -0.00055 \lor \neg \left(m \leq 0.19\right):\\ \;\;\;\;a_m \cdot {k}^{m}\\ \mathbf{else}:\\ \;\;\;\;a_m \cdot \frac{1}{1 + k \cdot \left(k + 10\right)}\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (or (<= m -0.00055) (not (<= m 0.19)))
    (* a_m (pow k m))
    (* a_m (/ 1.0 (+ 1.0 (* k (+ k 10.0))))))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if ((m <= -0.00055) || !(m <= 0.19)) {
		tmp = a_m * pow(k, m);
	} else {
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if ((m <= (-0.00055d0)) .or. (.not. (m <= 0.19d0))) then
        tmp = a_m * (k ** m)
    else
        tmp = a_m * (1.0d0 / (1.0d0 + (k * (k + 10.0d0))))
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if ((m <= -0.00055) || !(m <= 0.19)) {
		tmp = a_m * Math.pow(k, m);
	} else {
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if (m <= -0.00055) or not (m <= 0.19):
		tmp = a_m * math.pow(k, m)
	else:
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))))
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if ((m <= -0.00055) || !(m <= 0.19))
		tmp = Float64(a_m * (k ^ m));
	else
		tmp = Float64(a_m * Float64(1.0 / Float64(1.0 + Float64(k * Float64(k + 10.0)))));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if ((m <= -0.00055) || ~((m <= 0.19)))
		tmp = a_m * (k ^ m);
	else
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[Or[LessEqual[m, -0.00055], N[Not[LessEqual[m, 0.19]], $MachinePrecision]], N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision], N[(a$95$m * N[(1.0 / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 47.0% accurate, 8.7× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq 1.8:\\ \;\;\;\;a_m \cdot \frac{1}{1 + k \cdot \left(k + 10\right)}\\ \mathbf{else}:\\ \;\;\;\;a_m - k \cdot \left(a_m \cdot -10\right)\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (<= m 1.8)
    (* a_m (/ 1.0 (+ 1.0 (* k (+ k 10.0)))))
    (- a_m (* k (* a_m -10.0))))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.8) {
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (m <= 1.8d0) then
        tmp = a_m * (1.0d0 / (1.0d0 + (k * (k + 10.0d0))))
    else
        tmp = a_m - (k * (a_m * (-10.0d0)))
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.8) {
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if m <= 1.8:
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))))
	else:
		tmp = a_m - (k * (a_m * -10.0))
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (m <= 1.8)
		tmp = Float64(a_m * Float64(1.0 / Float64(1.0 + Float64(k * Float64(k + 10.0)))));
	else
		tmp = Float64(a_m - Float64(k * Float64(a_m * -10.0)));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (m <= 1.8)
		tmp = a_m * (1.0 / (1.0 + (k * (k + 10.0))));
	else
		tmp = a_m - (k * (a_m * -10.0));
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 1.8], N[(a$95$m * N[(1.0 / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m - N[(k * N[(a$95$m * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 33.0% accurate, 10.2× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq -0.102:\\ \;\;\;\;\frac{a_m}{k} \cdot 0.1\\ \mathbf{elif}\;m \leq 1.9:\\ \;\;\;\;\frac{a_m}{1 + k \cdot 10}\\ \mathbf{else}:\\ \;\;\;\;a_m - k \cdot \left(a_m \cdot -10\right)\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (<= m -0.102)
    (* (/ a_m k) 0.1)
    (if (<= m 1.9) (/ a_m (+ 1.0 (* k 10.0))) (- a_m (* k (* a_m -10.0)))))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= -0.102) {
		tmp = (a_m / k) * 0.1;
	} else if (m <= 1.9) {
		tmp = a_m / (1.0 + (k * 10.0));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (m <= (-0.102d0)) then
        tmp = (a_m / k) * 0.1d0
    else if (m <= 1.9d0) then
        tmp = a_m / (1.0d0 + (k * 10.0d0))
    else
        tmp = a_m - (k * (a_m * (-10.0d0)))
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= -0.102) {
		tmp = (a_m / k) * 0.1;
	} else if (m <= 1.9) {
		tmp = a_m / (1.0 + (k * 10.0));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if m <= -0.102:
		tmp = (a_m / k) * 0.1
	elif m <= 1.9:
		tmp = a_m / (1.0 + (k * 10.0))
	else:
		tmp = a_m - (k * (a_m * -10.0))
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (m <= -0.102)
		tmp = Float64(Float64(a_m / k) * 0.1);
	elseif (m <= 1.9)
		tmp = Float64(a_m / Float64(1.0 + Float64(k * 10.0)));
	else
		tmp = Float64(a_m - Float64(k * Float64(a_m * -10.0)));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (m <= -0.102)
		tmp = (a_m / k) * 0.1;
	elseif (m <= 1.9)
		tmp = a_m / (1.0 + (k * 10.0));
	else
		tmp = a_m - (k * (a_m * -10.0));
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.102], N[(N[(a$95$m / k), $MachinePrecision] * 0.1), $MachinePrecision], If[LessEqual[m, 1.9], N[(a$95$m / N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m - N[(k * N[(a$95$m * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 9: 47.0% accurate, 10.3× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq 1.75:\\ \;\;\;\;\frac{a_m}{1 + k \cdot \left(k + 10\right)}\\ \mathbf{else}:\\ \;\;\;\;a_m - k \cdot \left(a_m \cdot -10\right)\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (*
  a_s
  (if (<= m 1.75)
    (/ a_m (+ 1.0 (* k (+ k 10.0))))
    (- a_m (* k (* a_m -10.0))))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.75) {
		tmp = a_m / (1.0 + (k * (k + 10.0)));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (m <= 1.75d0) then
        tmp = a_m / (1.0d0 + (k * (k + 10.0d0)))
    else
        tmp = a_m - (k * (a_m * (-10.0d0)))
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.75) {
		tmp = a_m / (1.0 + (k * (k + 10.0)));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if m <= 1.75:
		tmp = a_m / (1.0 + (k * (k + 10.0)))
	else:
		tmp = a_m - (k * (a_m * -10.0))
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (m <= 1.75)
		tmp = Float64(a_m / Float64(1.0 + Float64(k * Float64(k + 10.0))));
	else
		tmp = Float64(a_m - Float64(k * Float64(a_m * -10.0)));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (m <= 1.75)
		tmp = a_m / (1.0 + (k * (k + 10.0)));
	else
		tmp = a_m - (k * (a_m * -10.0));
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 1.75], N[(a$95$m / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m - N[(k * N[(a$95$m * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 10: 29.0% accurate, 12.6× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;k \leq 0.075:\\ \;\;\;\;a_m + -10 \cdot \left(a_m \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{a_m}{k} \cdot 0.1\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (* a_s (if (<= k 0.075) (+ a_m (* -10.0 (* a_m k))) (* (/ a_m k) 0.1))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.075) {
		tmp = a_m + (-10.0 * (a_m * k));
	} else {
		tmp = (a_m / k) * 0.1;
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (k <= 0.075d0) then
        tmp = a_m + ((-10.0d0) * (a_m * k))
    else
        tmp = (a_m / k) * 0.1d0
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.075) {
		tmp = a_m + (-10.0 * (a_m * k));
	} else {
		tmp = (a_m / k) * 0.1;
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if k <= 0.075:
		tmp = a_m + (-10.0 * (a_m * k))
	else:
		tmp = (a_m / k) * 0.1
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (k <= 0.075)
		tmp = Float64(a_m + Float64(-10.0 * Float64(a_m * k)));
	else
		tmp = Float64(Float64(a_m / k) * 0.1);
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (k <= 0.075)
		tmp = a_m + (-10.0 * (a_m * k));
	else
		tmp = (a_m / k) * 0.1;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, 0.075], N[(a$95$m + N[(-10.0 * N[(a$95$m * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m / k), $MachinePrecision] * 0.1), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 11: 46.1% accurate, 12.6× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;m \leq 1.8:\\ \;\;\;\;\frac{a_m}{1 + k \cdot k}\\ \mathbf{else}:\\ \;\;\;\;a_m - k \cdot \left(a_m \cdot -10\right)\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (* a_s (if (<= m 1.8) (/ a_m (+ 1.0 (* k k))) (- a_m (* k (* a_m -10.0))))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.8) {
		tmp = a_m / (1.0 + (k * k));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (m <= 1.8d0) then
        tmp = a_m / (1.0d0 + (k * k))
    else
        tmp = a_m - (k * (a_m * (-10.0d0)))
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (m <= 1.8) {
		tmp = a_m / (1.0 + (k * k));
	} else {
		tmp = a_m - (k * (a_m * -10.0));
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if m <= 1.8:
		tmp = a_m / (1.0 + (k * k))
	else:
		tmp = a_m - (k * (a_m * -10.0))
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (m <= 1.8)
		tmp = Float64(a_m / Float64(1.0 + Float64(k * k)));
	else
		tmp = Float64(a_m - Float64(k * Float64(a_m * -10.0)));
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (m <= 1.8)
		tmp = a_m / (1.0 + (k * k));
	else
		tmp = a_m - (k * (a_m * -10.0));
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 1.8], N[(a$95$m / N[(1.0 + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m - N[(k * N[(a$95$m * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 12: 27.1% accurate, 16.1× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot \begin{array}{l} \mathbf{if}\;k \leq 0.1:\\ \;\;\;\;a_m\\ \mathbf{else}:\\ \;\;\;\;\frac{a_m}{k} \cdot 0.1\\ \end{array} \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m)
 :precision binary64
 (* a_s (if (<= k 0.1) a_m (* (/ a_m k) 0.1))))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.1) {
		tmp = a_m;
	} else {
		tmp = (a_m / k) * 0.1;
	}
	return a_s * tmp;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8) :: tmp
    if (k <= 0.1d0) then
        tmp = a_m
    else
        tmp = (a_m / k) * 0.1d0
    end if
    code = a_s * tmp
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	double tmp;
	if (k <= 0.1) {
		tmp = a_m;
	} else {
		tmp = (a_m / k) * 0.1;
	}
	return a_s * tmp;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	tmp = 0
	if k <= 0.1:
		tmp = a_m
	else:
		tmp = (a_m / k) * 0.1
	return a_s * tmp

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	tmp = 0.0
	if (k <= 0.1)
		tmp = a_m;
	else
		tmp = Float64(Float64(a_m / k) * 0.1);
	end
	return Float64(a_s * tmp)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp_2 = code(a_s, a_m, k, m)
	tmp = 0.0;
	if (k <= 0.1)
		tmp = a_m;
	else
		tmp = (a_m / k) * 0.1;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, 0.1], a$95$m, N[(N[(a$95$m / k), $MachinePrecision] * 0.1), $MachinePrecision]]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 13: 20.4% accurate, 114.0× speedup

Math

\[\begin{array}{l} a_m = \left|a\right| \\ a_s = \mathsf{copysign}\left(1, a\right) \\ a_s \cdot a_m \end{array} \]

FPCore

a_m = (fabs.f64 a)
a_s = (copysign.f64 1 a)
(FPCore (a_s a_m k m) :precision binary64 (* a_s a_m))

C

a_m = fabs(a);
a_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
	return a_s * a_m;
}

Fortran

a_m = abs(a)
a_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
    real(8), intent (in) :: a_s
    real(8), intent (in) :: a_m
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    code = a_s * a_m
end function

Java

a_m = Math.abs(a);
a_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
	return a_s * a_m;
}

Python

a_m = math.fabs(a)
a_s = math.copysign(1.0, a)
def code(a_s, a_m, k, m):
	return a_s * a_m

Julia

a_m = abs(a)
a_s = copysign(1.0, a)
function code(a_s, a_m, k, m)
	return Float64(a_s * a_m)
end

MATLAB

a_m = abs(a);
a_s = sign(a) * abs(1.0);
function tmp = code(a_s, a_m, k, m)
	tmp = a_s * a_m;
end

Wolfram

a_m = N[Abs[a], $MachinePrecision]
a_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * a$95$m), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Reproduce

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