Toniolo and Linder, Equation (7)

Percentage Accurate: 34.1% → 82.8%

Time: 18.6s

Alternatives: 9

Speedup: 225.0×

• Could not converge on a ground truth

  1. reg0 = (bf "6.387677497496301976771757981912850069688e255")
  2. reg1 = (bf #e1.692458665497233686925764358378442703268e-9)
  3. reg2 = (bf #e1.171696342770315343021984248619243804181e91)

Specification

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Fortran

real(8) function code(x, l, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 34.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Fortran

real(8) function code(x, l, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 82.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t\_m}^{2}\\ t_3 := t\_2 + {\ell}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 29000000000000:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2}}{\sqrt{t\_2 + \frac{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{\ell}^{2}}{x}\right) + \left(\left(t\_3 + t\_3\right) + \frac{t\_3}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l 2.0))))
   (*
    t_s
    (if (<= t_m 29000000000000.0)
      (/
       (* t_m (sqrt 2.0))
       (sqrt
        (+
         t_2
         (/
          (+
           (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l 2.0) x))
           (+ (+ t_3 t_3) (/ t_3 x)))
          x))))
      (+ 1.0 (/ -1.0 x))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l, 2.0);
	double tmp;
	if (t_m <= 29000000000000.0) {
		tmp = (t_m * sqrt(2.0)) / sqrt((t_2 + ((((2.0 * (pow(t_m, 2.0) / x)) + (pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x)));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l ** 2.0d0)
    if (t_m <= 29000000000000.0d0) then
        tmp = (t_m * sqrt(2.0d0)) / sqrt((t_2 + ((((2.0d0 * ((t_m ** 2.0d0) / x)) + ((l ** 2.0d0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x)))
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l, 2.0);
	double tmp;
	if (t_m <= 29000000000000.0) {
		tmp = (t_m * Math.sqrt(2.0)) / Math.sqrt((t_2 + ((((2.0 * (Math.pow(t_m, 2.0) / x)) + (Math.pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x)));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l, 2.0)
	tmp = 0
	if t_m <= 29000000000000.0:
		tmp = (t_m * math.sqrt(2.0)) / math.sqrt((t_2 + ((((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x)))
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l ^ 2.0))
	tmp = 0.0
	if (t_m <= 29000000000000.0)
		tmp = Float64(Float64(t_m * sqrt(2.0)) / sqrt(Float64(t_2 + Float64(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l ^ 2.0) / x)) + Float64(Float64(t_3 + t_3) + Float64(t_3 / x))) / x))));
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l ^ 2.0);
	tmp = 0.0;
	if (t_m <= 29000000000000.0)
		tmp = (t_m * sqrt(2.0)) / sqrt((t_2 + ((((2.0 * ((t_m ^ 2.0) / x)) + ((l ^ 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x)));
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 29000000000000.0], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(t$95$2 + N[(N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$3 + t$95$3), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if t < 2.9e13

   1. Initial program 27.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 13.2%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

      2. pow3 13.2%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\sqrt[3]{\color{blue}{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   4. Applied egg-rr 13.2%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   5. Taylor expanded in x around -inf 54.1%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\color{blue}{-1 \cdot \frac{\left(-1 \cdot \left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) - -1 \cdot \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + -1 \cdot \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}\right) - \left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right)}{x} + 2 \cdot {t}^{2}}}} \]

   if 2.9e13 < t

   1. Initial program 31.1%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 31.1%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 91.2%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in x around inf 91.4%

      \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 29000000000000:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\sqrt{2 \cdot {t}^{2} + \frac{\left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right) + \left(\left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) + \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 82.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t\_m}^{2}\\ t_3 := t\_2 + {\ell}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 460000000000:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_2 + \frac{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{\ell}^{2}}{x}\right) + \left(\left(t\_3 + t\_3\right) + \frac{t\_3}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l 2.0))))
   (*
    t_s
    (if (<= t_m 460000000000.0)
      (*
       (sqrt 2.0)
       (/
        t_m
        (sqrt
         (+
          t_2
          (/
           (+
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l 2.0) x))
            (+ (+ t_3 t_3) (/ t_3 x)))
           x)))))
      (+ 1.0 (/ -1.0 x))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l, 2.0);
	double tmp;
	if (t_m <= 460000000000.0) {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * (pow(t_m, 2.0) / x)) + (pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l ** 2.0d0)
    if (t_m <= 460000000000.0d0) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((t_2 + ((((2.0d0 * ((t_m ** 2.0d0) / x)) + ((l ** 2.0d0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l, 2.0);
	double tmp;
	if (t_m <= 460000000000.0) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((t_2 + ((((2.0 * (Math.pow(t_m, 2.0) / x)) + (Math.pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l, 2.0)
	tmp = 0
	if t_m <= 460000000000.0:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l ^ 2.0))
	tmp = 0.0
	if (t_m <= 460000000000.0)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l ^ 2.0) / x)) + Float64(Float64(t_3 + t_3) + Float64(t_3 / x))) / x)))));
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l ^ 2.0);
	tmp = 0.0;
	if (t_m <= 460000000000.0)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * ((t_m ^ 2.0) / x)) + ((l ^ 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 460000000000.0], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(t$95$2 + N[(N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$3 + t$95$3), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if t < 4.6e11

   1. Initial program 27.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 27.2%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(\ell, \ell, 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around -inf 54.0%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\sqrt{\color{blue}{-1 \cdot \frac{\left(-1 \cdot \left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) - -1 \cdot \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + -1 \cdot \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}\right) - \left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right)}{x} + 2 \cdot {t}^{2}}}} \]

   if 4.6e11 < t

   1. Initial program 31.1%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 31.1%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 91.2%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in x around inf 91.4%

      \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 460000000000:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{2 \cdot {t}^{2} + \frac{\left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right) + \left(\left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) + \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 82.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 5.2 \cdot 10^{+15}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2}}{\sqrt{\frac{t\_2 + {\ell}^{2}}{x} + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 5.2e+15)
      (/
       (* t_m (sqrt 2.0))
       (sqrt
        (+
         (/ (+ t_2 (pow l 2.0)) x)
         (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l 2.0) x))))))
      (+ 1.0 (/ -1.0 x))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 5.2e+15) {
		tmp = (t_m * sqrt(2.0)) / sqrt((((t_2 + pow(l, 2.0)) / x) + ((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l, 2.0) / x)))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    if (t_m <= 5.2d+15) then
        tmp = (t_m * sqrt(2.0d0)) / sqrt((((t_2 + (l ** 2.0d0)) / x) + ((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l ** 2.0d0) / x)))))
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 5.2e+15) {
		tmp = (t_m * Math.sqrt(2.0)) / Math.sqrt((((t_2 + Math.pow(l, 2.0)) / x) + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l, 2.0) / x)))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 5.2e+15:
		tmp = (t_m * math.sqrt(2.0)) / math.sqrt((((t_2 + math.pow(l, 2.0)) / x) + ((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l, 2.0) / x)))))
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 5.2e+15)
		tmp = Float64(Float64(t_m * sqrt(2.0)) / sqrt(Float64(Float64(Float64(t_2 + (l ^ 2.0)) / x) + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l ^ 2.0) / x))))));
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 5.2e+15)
		tmp = (t_m * sqrt(2.0)) / sqrt((((t_2 + (l ^ 2.0)) / x) + ((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l ^ 2.0) / x)))));
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 5.2e+15], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(N[(N[(t$95$2 + N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] + N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 5.2e15

   1. Initial program 27.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 13.2%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

      2. pow3 13.2%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\sqrt[3]{\color{blue}{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   4. Applied egg-rr 13.2%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   5. Taylor expanded in x around inf 53.8%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\color{blue}{\left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right) - -1 \cdot \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}} \]

   if 5.2e15 < t

   1. Initial program 31.1%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 31.1%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 91.2%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in x around inf 91.4%

      \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 5.2 \cdot 10^{+15}:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\sqrt{\frac{2 \cdot {t}^{2} + {\ell}^{2}}{x} + \left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 82.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.2 \cdot 10^{+18}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\frac{t\_2 + {\ell}^{2}}{x} + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 1.2e+18)
      (*
       (sqrt 2.0)
       (/
        t_m
        (sqrt
         (+
          (/ (+ t_2 (pow l 2.0)) x)
          (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l 2.0) x)))))))
      (+ 1.0 (/ -1.0 x))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.2e+18) {
		tmp = sqrt(2.0) * (t_m / sqrt((((t_2 + pow(l, 2.0)) / x) + ((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l, 2.0) / x))))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    if (t_m <= 1.2d+18) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((((t_2 + (l ** 2.0d0)) / x) + ((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l ** 2.0d0) / x))))))
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.2e+18) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((((t_2 + Math.pow(l, 2.0)) / x) + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l, 2.0) / x))))));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 1.2e+18:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((((t_2 + math.pow(l, 2.0)) / x) + ((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l, 2.0) / x))))))
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.2e+18)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(Float64(Float64(t_2 + (l ^ 2.0)) / x) + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l ^ 2.0) / x)))))));
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.2e+18)
		tmp = sqrt(2.0) * (t_m / sqrt((((t_2 + (l ^ 2.0)) / x) + ((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l ^ 2.0) / x))))));
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.2e+18], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(N[(N[(t$95$2 + N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] + N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 1.2e18

   1. Initial program 27.2%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 27.2%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(\ell, \ell, 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 53.7%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\sqrt{\color{blue}{\left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right) - -1 \cdot \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}} \]

   if 1.2e18 < t

   1. Initial program 31.1%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 31.1%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 91.2%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in x around inf 91.4%

      \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.2 \cdot 10^{+18}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\frac{2 \cdot {t}^{2} + {\ell}^{2}}{x} + \left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 76.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.05 \cdot 10^{-131}:\\ \;\;\;\;{\left(\frac{\ell \cdot \sqrt{\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \frac{1 + \frac{1}{x}}{x}, -1\right)}{x}, \frac{1}{-1 + x}\right)}}{t\_m \cdot \sqrt{2}}\right)}^{-1}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.05e-131)
    (pow
     (/
      (*
       l
       (sqrt
        (fma
         -1.0
         (/ (fma -1.0 (/ (+ 1.0 (/ 1.0 x)) x) -1.0) x)
         (/ 1.0 (+ -1.0 x)))))
      (* t_m (sqrt 2.0)))
     -1.0)
    (sqrt (/ (+ -1.0 x) (+ x 1.0))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double tmp;
	if (t_m <= 1.05e-131) {
		tmp = pow(((l * sqrt(fma(-1.0, (fma(-1.0, ((1.0 + (1.0 / x)) / x), -1.0) / x), (1.0 / (-1.0 + x))))) / (t_m * sqrt(2.0))), -1.0);
	} else {
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	tmp = 0.0
	if (t_m <= 1.05e-131)
		tmp = Float64(Float64(l * sqrt(fma(-1.0, Float64(fma(-1.0, Float64(Float64(1.0 + Float64(1.0 / x)) / x), -1.0) / x), Float64(1.0 / Float64(-1.0 + x))))) / Float64(t_m * sqrt(2.0))) ^ -1.0;
	else
		tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1.05e-131], N[Power[N[(N[(l * N[Sqrt[N[(-1.0 * N[(N[(-1.0 * N[(N[(1.0 + N[(1.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision] + N[(1.0 / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.04999999999999999e-131

   1. Initial program 20.4%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 12.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

      2. pow3 12.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\sqrt[3]{\color{blue}{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   4. Applied egg-rr 12.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   5. Taylor expanded in l around inf 2.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   6. Step-by-step derivation

      1. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\color{blue}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) + \left(-1\right)}}} \]

      2. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{\color{blue}{x + \left(-1\right)}} + \frac{x}{x - 1}\right) + \left(-1\right)}} \]

      3. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + \color{blue}{-1}} + \frac{x}{x - 1}\right) + \left(-1\right)}} \]

      4. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{\color{blue}{x + \left(-1\right)}}\right) + \left(-1\right)}} \]

      5. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{x + \color{blue}{-1}}\right) + \left(-1\right)}} \]

      6. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{x + -1}\right) + \color{blue}{-1}}} \]

      7. associate-+r+ 13.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\color{blue}{\frac{1}{x + -1} + \left(\frac{x}{x + -1} + -1\right)}}} \]

      8. +-commutative 13.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\frac{1}{x + -1} + \color{blue}{\left(-1 + \frac{x}{x + -1}\right)}}} \]

   7. Simplified 13.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\frac{1}{x + -1} + \left(-1 + \frac{x}{x + -1}\right)}}} \]

   8. Taylor expanded in x around -inf 24.3%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\frac{1}{x + -1} + \color{blue}{-1 \cdot \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x}}}} \]
   9. Step-by-step derivation

      1. clear-num 24.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{\ell \cdot \sqrt{\frac{1}{x + -1} + -1 \cdot \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x}}}{\sqrt{2} \cdot t}}} \]

      2. inv-pow 24.3%

         \[\leadsto \color{blue}{{\left(\frac{\ell \cdot \sqrt{\frac{1}{x + -1} + -1 \cdot \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x}}}{\sqrt{2} \cdot t}\right)}^{-1}} \]

      3. +-commutative 24.3%

         \[\leadsto {\left(\frac{\ell \cdot \sqrt{\color{blue}{-1 \cdot \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x} + \frac{1}{x + -1}}}}{\sqrt{2} \cdot t}\right)}^{-1} \]

      4. fma-define 24.3%

         \[\leadsto {\left(\frac{\ell \cdot \sqrt{\color{blue}{\mathsf{fma}\left(-1, \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x}, \frac{1}{x + -1}\right)}}}{\sqrt{2} \cdot t}\right)}^{-1} \]

      5. fmm-def 24.3%

         \[\leadsto {\left(\frac{\ell \cdot \sqrt{\mathsf{fma}\left(-1, \frac{\color{blue}{\mathsf{fma}\left(-1, \frac{1 + \frac{1}{x}}{x}, -1\right)}}{x}, \frac{1}{x + -1}\right)}}{\sqrt{2} \cdot t}\right)}^{-1} \]

      6. metadata-eval 24.3%

         \[\leadsto {\left(\frac{\ell \cdot \sqrt{\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \frac{1 + \frac{1}{x}}{x}, \color{blue}{-1}\right)}{x}, \frac{1}{x + -1}\right)}}{\sqrt{2} \cdot t}\right)}^{-1} \]

   10. Applied egg-rr 24.3%

       \[\leadsto \color{blue}{{\left(\frac{\ell \cdot \sqrt{\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \frac{1 + \frac{1}{x}}{x}, -1\right)}{x}, \frac{1}{x + -1}\right)}}{\sqrt{2} \cdot t}\right)}^{-1}} \]

   if 1.04999999999999999e-131 < t

   1. Initial program 37.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 32.0%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 85.3%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in t around 0 85.5%

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.05 \cdot 10^{-131}:\\ \;\;\;\;{\left(\frac{\ell \cdot \sqrt{\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \frac{1 + \frac{1}{x}}{x}, -1\right)}{x}, \frac{1}{-1 + x}\right)}}{t \cdot \sqrt{2}}\right)}^{-1}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 76.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 2.65 \cdot 10^{-130}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2}}{\ell \cdot \sqrt{\frac{2}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 2.65e-130)
    (/ (* t_m (sqrt 2.0)) (* l (sqrt (/ 2.0 x))))
    (sqrt (/ (+ -1.0 x) (+ x 1.0))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double tmp;
	if (t_m <= 2.65e-130) {
		tmp = (t_m * sqrt(2.0)) / (l * sqrt((2.0 / x)));
	} else {
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 2.65d-130) then
        tmp = (t_m * sqrt(2.0d0)) / (l * sqrt((2.0d0 / x)))
    else
        tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double tmp;
	if (t_m <= 2.65e-130) {
		tmp = (t_m * Math.sqrt(2.0)) / (l * Math.sqrt((2.0 / x)));
	} else {
		tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	tmp = 0
	if t_m <= 2.65e-130:
		tmp = (t_m * math.sqrt(2.0)) / (l * math.sqrt((2.0 / x)))
	else:
		tmp = math.sqrt(((-1.0 + x) / (x + 1.0)))
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	tmp = 0.0
	if (t_m <= 2.65e-130)
		tmp = Float64(Float64(t_m * sqrt(2.0)) / Float64(l * sqrt(Float64(2.0 / x))));
	else
		tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	tmp = 0.0;
	if (t_m <= 2.65e-130)
		tmp = (t_m * sqrt(2.0)) / (l * sqrt((2.0 / x)));
	else
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 2.65e-130], N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(l * N[Sqrt[N[(2.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 2.6500000000000002e-130

   1. Initial program 20.4%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 12.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

      2. pow3 12.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\sqrt[3]{\color{blue}{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   4. Applied egg-rr 12.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\sqrt{\frac{\color{blue}{\sqrt[3]{{\left(x + 1\right)}^{3}}}}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   5. Taylor expanded in l around inf 2.7%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) - 1}}} \]
   6. Step-by-step derivation

      1. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\color{blue}{\left(\frac{1}{x - 1} + \frac{x}{x - 1}\right) + \left(-1\right)}}} \]

      2. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{\color{blue}{x + \left(-1\right)}} + \frac{x}{x - 1}\right) + \left(-1\right)}} \]

      3. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + \color{blue}{-1}} + \frac{x}{x - 1}\right) + \left(-1\right)}} \]

      4. sub-neg 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{\color{blue}{x + \left(-1\right)}}\right) + \left(-1\right)}} \]

      5. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{x + \color{blue}{-1}}\right) + \left(-1\right)}} \]

      6. metadata-eval 2.7%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\left(\frac{1}{x + -1} + \frac{x}{x + -1}\right) + \color{blue}{-1}}} \]

      7. associate-+r+ 13.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\color{blue}{\frac{1}{x + -1} + \left(\frac{x}{x + -1} + -1\right)}}} \]

      8. +-commutative 13.0%

         \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\frac{1}{x + -1} + \color{blue}{\left(-1 + \frac{x}{x + -1}\right)}}} \]

   7. Simplified 13.0%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\color{blue}{\ell \cdot \sqrt{\frac{1}{x + -1} + \left(-1 + \frac{x}{x + -1}\right)}}} \]

   8. Taylor expanded in x around -inf 24.3%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\frac{1}{x + -1} + \color{blue}{-1 \cdot \frac{-1 \cdot \frac{1 + \frac{1}{x}}{x} - 1}{x}}}} \]

   9. Taylor expanded in x around inf 23.9%

      \[\leadsto \frac{\sqrt{2} \cdot t}{\ell \cdot \sqrt{\color{blue}{\frac{2}{x}}}} \]

   if 2.6500000000000002e-130 < t

   1. Initial program 37.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 32.0%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 85.3%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

   6. Taylor expanded in t around 0 85.5%

      \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 2.65 \cdot 10^{-130}:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\ell \cdot \sqrt{\frac{2}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 77.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \sqrt{\frac{-1 + x}{x + 1}} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (* t_s (sqrt (/ (+ -1.0 x) (+ x 1.0)))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	return t_s * sqrt(((-1.0 + x) / (x + 1.0)));
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * sqrt((((-1.0d0) + x) / (x + 1.0d0)))
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	return t_s * Math.sqrt(((-1.0 + x) / (x + 1.0)));
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	return t_s * math.sqrt(((-1.0 + x) / (x + 1.0)))

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	return Float64(t_s * sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0))))
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	tmp = t_s * sqrt(((-1.0 + x) / (x + 1.0)));
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 28.5%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

3. Simplified 25.5%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 44.0%

   \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

6. Taylor expanded in t around 0 44.1%

   \[\leadsto \color{blue}{\sqrt{\frac{x - 1}{1 + x}}} \]

7. Final simplification 44.1%

   \[\leadsto \sqrt{\frac{-1 + x}{x + 1}} \]
8. Add Preprocessing

Alternative 8: 76.6% accurate, 45.0× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \left(1 + \frac{-1}{x}\right) \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m) :precision binary64 (* t_s (+ 1.0 (/ -1.0 x))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	return t_s * (1.0 + (-1.0 / x));
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * (1.0d0 + ((-1.0d0) / x))
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	return t_s * (1.0 + (-1.0 / x));
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	return t_s * (1.0 + (-1.0 / x))

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	return Float64(t_s * Float64(1.0 + Float64(-1.0 / x)))
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	tmp = t_s * (1.0 + (-1.0 / x));
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 28.5%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

3. Simplified 25.5%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 44.0%

   \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

6. Taylor expanded in x around inf 44.1%

   \[\leadsto \color{blue}{1 - \frac{1}{x}} \]

7. Final simplification 44.1%

   \[\leadsto 1 + \frac{-1}{x} \]
8. Add Preprocessing

Alternative 9: 75.9% accurate, 225.0× speedup

Math

\[\begin{array}{l} t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot 1 \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m) :precision binary64 (* t_s 1.0))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	return t_s * 1.0;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    code = t_s * 1.0d0
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	return t_s * 1.0;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	return t_s * 1.0

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	return Float64(t_s * 1.0)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l, t_m)
	tmp = t_s * 1.0;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 28.5%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

3. Simplified 25.5%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(x + 1, \frac{\mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right)}{x + -1}, \ell \cdot \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 44.0%

   \[\leadsto \sqrt{2} \cdot \frac{t}{\color{blue}{\left(t \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1 + x}{x - 1}}}} \]

6. Taylor expanded in x around inf 43.8%

   \[\leadsto \color{blue}{1} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024151 
(FPCore (x l t)
  :name "Toniolo and Linder, Equation (7)"
  :precision binary64
  (/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))