Toniolo and Linder, Equation (7)

Percentage Accurate: 32.9% → 84.3%

Time: 23.6s

Alternatives: 7

Speedup: 225.0×

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: 32.9% 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: 84.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ 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 + {l\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 2.5 \cdot 10^{-212}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{elif}\;t\_m \leq 9 \cdot 10^{-162}:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_m \leq 5 \cdot 10^{+86}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{2}}{\sqrt{\left(\frac{t\_3 + t\_3}{{x}^{2}} + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{l\_m}^{2}}{x}\right)\right)\right) + \frac{t\_3}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l_m 2.0))))
   (*
    t_s
    (if (<= t_m 2.5e-212)
      (/ (* t_m (sqrt x)) l_m)
      (if (<= t_m 9e-162)
        1.0
        (if (<= t_m 5e+86)
          (*
           t_m
           (/
            (sqrt 2.0)
            (sqrt
             (+
              (+
               (/ (+ t_3 t_3) (pow x 2.0))
               (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l_m 2.0) x))))
              (/ t_3 x)))))
          (sqrt (/ (+ x -1.0) (+ x 1.0)))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l_m, 2.0);
	double tmp;
	if (t_m <= 2.5e-212) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else if (t_m <= 9e-162) {
		tmp = 1.0;
	} else if (t_m <= 5e+86) {
		tmp = t_m * (sqrt(2.0) / sqrt(((((t_3 + t_3) / pow(x, 2.0)) + ((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l_m, 2.0) / x)))) + (t_3 / x))));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    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_m ** 2.0d0)
    if (t_m <= 2.5d-212) then
        tmp = (t_m * sqrt(x)) / l_m
    else if (t_m <= 9d-162) then
        tmp = 1.0d0
    else if (t_m <= 5d+86) then
        tmp = t_m * (sqrt(2.0d0) / sqrt(((((t_3 + t_3) / (x ** 2.0d0)) + ((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l_m ** 2.0d0) / x)))) + (t_3 / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l_m, 2.0);
	double tmp;
	if (t_m <= 2.5e-212) {
		tmp = (t_m * Math.sqrt(x)) / l_m;
	} else if (t_m <= 9e-162) {
		tmp = 1.0;
	} else if (t_m <= 5e+86) {
		tmp = t_m * (Math.sqrt(2.0) / Math.sqrt(((((t_3 + t_3) / Math.pow(x, 2.0)) + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l_m, 2.0) / x)))) + (t_3 / x))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l_m, 2.0)
	tmp = 0
	if t_m <= 2.5e-212:
		tmp = (t_m * math.sqrt(x)) / l_m
	elif t_m <= 9e-162:
		tmp = 1.0
	elif t_m <= 5e+86:
		tmp = t_m * (math.sqrt(2.0) / math.sqrt(((((t_3 + t_3) / math.pow(x, 2.0)) + ((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l_m, 2.0) / x)))) + (t_3 / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 2.5e-212)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	elseif (t_m <= 9e-162)
		tmp = 1.0;
	elseif (t_m <= 5e+86)
		tmp = Float64(t_m * Float64(sqrt(2.0) / sqrt(Float64(Float64(Float64(Float64(t_3 + t_3) / (x ^ 2.0)) + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l_m ^ 2.0) / x)))) + Float64(t_3 / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 2.5e-212)
		tmp = (t_m * sqrt(x)) / l_m;
	elseif (t_m <= 9e-162)
		tmp = 1.0;
	elseif (t_m <= 5e+86)
		tmp = t_m * (sqrt(2.0) / sqrt(((((t_3 + t_3) / (x ^ 2.0)) + ((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l_m ^ 2.0) / x)))) + (t_3 / x))));
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, 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$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.5e-212], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[t$95$m, 9e-162], 1.0, If[LessEqual[t$95$m, 5e+86], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(t$95$3 + t$95$3), $MachinePrecision] / N[Power[x, 2.0], $MachinePrecision]), $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$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]]

Derivation

1. Split input into 4 regimes

2. if t < 2.50000000000000022e-212

   1. Initial program 27.8%

      \[\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.7%

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

   5. Taylor expanded in l around inf 3.2%

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

      1. associate--l+ 9.8%

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

      2. sub-neg 9.8%

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

      3. metadata-eval 9.8%

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

      4. +-commutative 9.8%

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

      5. sub-neg 9.8%

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

      6. metadata-eval 9.8%

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

      7. +-commutative 9.8%

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

   7. Simplified 9.8%

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

   8. Taylor expanded in x around inf 19.1%

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

   9. Taylor expanded in t around 0 18.5%

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

       1. associate-*l/ 18.5%

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

   11. Applied egg-rr 18.5%

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

   if 2.50000000000000022e-212 < t < 9.00000000000000045e-162

   1. Initial program 6.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 6.5%

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

   5. Taylor expanded in t around inf 86.4%

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

      1. +-commutative 86.4%

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

      2. sub-neg 86.4%

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

      3. metadata-eval 86.4%

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

      4. +-commutative 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 86.4%

      \[\leadsto \color{blue}{1} \]

   if 9.00000000000000045e-162 < t < 4.9999999999999998e86

   1. Initial program 62.7%

      \[\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 62.9%

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

   5. Taylor expanded in x around -inf 88.7%

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

   if 4.9999999999999998e86 < t

   1. Initial program 32.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}} \]

   3. Simplified 32.3%

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

   5. Taylor expanded in t around inf 95.0%

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

      1. +-commutative 95.0%

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

      2. sub-neg 95.0%

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

      3. metadata-eval 95.0%

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

      4. +-commutative 95.0%

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

   7. Simplified 95.0%

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

   8. Taylor expanded in t around 0 95.2%

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

4. Final simplification 50.9%

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

Alternative 2: 84.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ 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.05 \cdot 10^{-210}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{elif}\;t\_m \leq 1.05 \cdot 10^{-161}:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_m \leq 8 \cdot 10^{+86}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{2}}{\sqrt{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{l\_m}^{2}}{x}\right)\right) + \frac{t\_2 + {l\_m}^{2}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 1.05e-210)
      (/ (* t_m (sqrt x)) l_m)
      (if (<= t_m 1.05e-161)
        1.0
        (if (<= t_m 8e+86)
          (*
           t_m
           (/
            (sqrt 2.0)
            (sqrt
             (+
              (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l_m 2.0) x)))
              (/ (+ t_2 (pow l_m 2.0)) x)))))
          (sqrt (/ (+ x -1.0) (+ x 1.0)))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.05e-210) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else if (t_m <= 1.05e-161) {
		tmp = 1.0;
	} else if (t_m <= 8e+86) {
		tmp = t_m * (sqrt(2.0) / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l_m, 2.0) / x))) + ((t_2 + pow(l_m, 2.0)) / x))));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    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.05d-210) then
        tmp = (t_m * sqrt(x)) / l_m
    else if (t_m <= 1.05d-161) then
        tmp = 1.0d0
    else if (t_m <= 8d+86) then
        tmp = t_m * (sqrt(2.0d0) / sqrt((((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l_m ** 2.0d0) / x))) + ((t_2 + (l_m ** 2.0d0)) / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.05e-210) {
		tmp = (t_m * Math.sqrt(x)) / l_m;
	} else if (t_m <= 1.05e-161) {
		tmp = 1.0;
	} else if (t_m <= 8e+86) {
		tmp = t_m * (Math.sqrt(2.0) / Math.sqrt((((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l_m, 2.0) / x))) + ((t_2 + Math.pow(l_m, 2.0)) / x))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 1.05e-210:
		tmp = (t_m * math.sqrt(x)) / l_m
	elif t_m <= 1.05e-161:
		tmp = 1.0
	elif t_m <= 8e+86:
		tmp = t_m * (math.sqrt(2.0) / math.sqrt((((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l_m, 2.0) / x))) + ((t_2 + math.pow(l_m, 2.0)) / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.05e-210)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	elseif (t_m <= 1.05e-161)
		tmp = 1.0;
	elseif (t_m <= 8e+86)
		tmp = Float64(t_m * Float64(sqrt(2.0) / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l_m ^ 2.0) / x))) + Float64(Float64(t_2 + (l_m ^ 2.0)) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.05e-210)
		tmp = (t_m * sqrt(x)) / l_m;
	elseif (t_m <= 1.05e-161)
		tmp = 1.0;
	elseif (t_m <= 8e+86)
		tmp = t_m * (sqrt(2.0) / sqrt((((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l_m ^ 2.0) / x))) + ((t_2 + (l_m ^ 2.0)) / x))));
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, 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.05e-210], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[t$95$m, 1.05e-161], 1.0, If[LessEqual[t$95$m, 8e+86], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]

Derivation

1. Split input into 4 regimes

2. if t < 1.05000000000000008e-210

   1. Initial program 27.8%

      \[\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.7%

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

   5. Taylor expanded in l around inf 3.2%

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

      1. associate--l+ 9.8%

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

      2. sub-neg 9.8%

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

      3. metadata-eval 9.8%

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

      4. +-commutative 9.8%

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

      5. sub-neg 9.8%

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

      6. metadata-eval 9.8%

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

      7. +-commutative 9.8%

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

   7. Simplified 9.8%

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

   8. Taylor expanded in x around inf 19.1%

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

   9. Taylor expanded in t around 0 18.5%

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

       1. associate-*l/ 18.5%

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

   11. Applied egg-rr 18.5%

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

   if 1.05000000000000008e-210 < t < 1.05e-161

   1. Initial program 6.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 6.5%

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

   5. Taylor expanded in t around inf 86.4%

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

      1. +-commutative 86.4%

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

      2. sub-neg 86.4%

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

      3. metadata-eval 86.4%

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

      4. +-commutative 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 86.4%

      \[\leadsto \color{blue}{1} \]

   if 1.05e-161 < t < 8.0000000000000001e86

   1. Initial program 62.7%

      \[\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 62.9%

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

   5. Taylor expanded in x around inf 86.7%

      \[\leadsto \frac{\sqrt{2}}{\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}}}} \cdot t \]

   if 8.0000000000000001e86 < t

   1. Initial program 32.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}} \]

   3. Simplified 32.3%

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

   5. Taylor expanded in t around inf 95.0%

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

      1. +-commutative 95.0%

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

      2. sub-neg 95.0%

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

      3. metadata-eval 95.0%

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

      4. +-commutative 95.0%

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

   7. Simplified 95.0%

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

   8. Taylor expanded in t around 0 95.2%

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

4. Final simplification 50.5%

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

Alternative 3: 79.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \frac{t\_m \cdot \sqrt{x}}{l\_m}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.1 \cdot 10^{-207}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_m \leq 3.6 \cdot 10^{-125}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{elif}\;t\_m \leq 1.75 \cdot 10^{-112}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (/ (* t_m (sqrt x)) l_m)))
   (*
    t_s
    (if (<= t_m 1.1e-207)
      t_2
      (if (<= t_m 3.6e-125)
        (+ 1.0 (/ -1.0 x))
        (if (<= t_m 1.75e-112) t_2 (sqrt (/ (+ x -1.0) (+ x 1.0)))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = (t_m * sqrt(x)) / l_m;
	double tmp;
	if (t_m <= 1.1e-207) {
		tmp = t_2;
	} else if (t_m <= 3.6e-125) {
		tmp = 1.0 + (-1.0 / x);
	} else if (t_m <= 1.75e-112) {
		tmp = t_2;
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = (t_m * sqrt(x)) / l_m
    if (t_m <= 1.1d-207) then
        tmp = t_2
    else if (t_m <= 3.6d-125) then
        tmp = 1.0d0 + ((-1.0d0) / x)
    else if (t_m <= 1.75d-112) then
        tmp = t_2
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = (t_m * Math.sqrt(x)) / l_m;
	double tmp;
	if (t_m <= 1.1e-207) {
		tmp = t_2;
	} else if (t_m <= 3.6e-125) {
		tmp = 1.0 + (-1.0 / x);
	} else if (t_m <= 1.75e-112) {
		tmp = t_2;
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = (t_m * math.sqrt(x)) / l_m
	tmp = 0
	if t_m <= 1.1e-207:
		tmp = t_2
	elif t_m <= 3.6e-125:
		tmp = 1.0 + (-1.0 / x)
	elif t_m <= 1.75e-112:
		tmp = t_2
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(Float64(t_m * sqrt(x)) / l_m)
	tmp = 0.0
	if (t_m <= 1.1e-207)
		tmp = t_2;
	elseif (t_m <= 3.6e-125)
		tmp = Float64(1.0 + Float64(-1.0 / x));
	elseif (t_m <= 1.75e-112)
		tmp = t_2;
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = (t_m * sqrt(x)) / l_m;
	tmp = 0.0;
	if (t_m <= 1.1e-207)
		tmp = t_2;
	elseif (t_m <= 3.6e-125)
		tmp = 1.0 + (-1.0 / x);
	elseif (t_m <= 1.75e-112)
		tmp = t_2;
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, t$95$m_] := Block[{t$95$2 = N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.1e-207], t$95$2, If[LessEqual[t$95$m, 3.6e-125], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.75e-112], t$95$2, N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 1.0999999999999999e-207 or 3.6000000000000002e-125 < t < 1.74999999999999997e-112

   1. Initial program 27.9%

      \[\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.8%

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

   5. Taylor expanded in l around inf 3.2%

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

      1. associate--l+ 9.9%

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

      2. sub-neg 9.9%

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

      3. metadata-eval 9.9%

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

      4. +-commutative 9.9%

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

      5. sub-neg 9.9%

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

      6. metadata-eval 9.9%

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

      7. +-commutative 9.9%

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

   7. Simplified 9.9%

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

   8. Taylor expanded in x around inf 20.0%

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

   9. Taylor expanded in t around 0 18.2%

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

       1. associate-*l/ 18.1%

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

   11. Applied egg-rr 18.1%

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

   if 1.0999999999999999e-207 < t < 3.6000000000000002e-125

   1. Initial program 32.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}} \]

   3. Simplified 32.3%

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

   5. Taylor expanded in t around inf 84.0%

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

      1. +-commutative 84.0%

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

      2. sub-neg 84.0%

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

      3. metadata-eval 84.0%

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

      4. +-commutative 84.0%

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

   7. Simplified 84.0%

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

   8. Taylor expanded in x around inf 84.0%

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

   if 1.74999999999999997e-112 < t

   1. Initial program 45.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 45.2%

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

   5. Taylor expanded in t around inf 90.2%

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

      1. +-commutative 90.2%

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

      2. sub-neg 90.2%

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

      3. metadata-eval 90.2%

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

      4. +-commutative 90.2%

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

   7. Simplified 90.2%

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

   8. Taylor expanded in t around 0 90.4%

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

4. Final simplification 48.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.1 \cdot 10^{-207}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{elif}\;t \leq 3.6 \cdot 10^{-125}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{elif}\;t \leq 1.75 \cdot 10^{-112}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 79.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 6.5 \cdot 10^{-209} \lor \neg \left(t\_m \leq 3.6 \cdot 10^{-125}\right) \land t\_m \leq 2.3 \cdot 10^{-112}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (or (<= t_m 6.5e-209) (and (not (<= t_m 3.6e-125)) (<= t_m 2.3e-112)))
    (/ (* t_m (sqrt x)) l_m)
    (+ 1.0 (/ -1.0 x)))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((t_m <= 6.5e-209) || (!(t_m <= 3.6e-125) && (t_m <= 2.3e-112))) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if ((t_m <= 6.5d-209) .or. (.not. (t_m <= 3.6d-125)) .and. (t_m <= 2.3d-112)) then
        tmp = (t_m * sqrt(x)) / l_m
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if ((t_m <= 6.5e-209) || (!(t_m <= 3.6e-125) && (t_m <= 2.3e-112))) {
		tmp = (t_m * Math.sqrt(x)) / l_m;
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if (t_m <= 6.5e-209) or (not (t_m <= 3.6e-125) and (t_m <= 2.3e-112)):
		tmp = (t_m * math.sqrt(x)) / l_m
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if ((t_m <= 6.5e-209) || (!(t_m <= 3.6e-125) && (t_m <= 2.3e-112)))
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if ((t_m <= 6.5e-209) || (~((t_m <= 3.6e-125)) && (t_m <= 2.3e-112)))
		tmp = (t_m * sqrt(x)) / l_m;
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, t$95$m_] := N[(t$95$s * If[Or[LessEqual[t$95$m, 6.5e-209], And[N[Not[LessEqual[t$95$m, 3.6e-125]], $MachinePrecision], LessEqual[t$95$m, 2.3e-112]]], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 6.50000000000000042e-209 or 3.6000000000000002e-125 < t < 2.29999999999999991e-112

   1. Initial program 27.9%

      \[\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.8%

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

   5. Taylor expanded in l around inf 3.2%

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

      1. associate--l+ 9.9%

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

      2. sub-neg 9.9%

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

      3. metadata-eval 9.9%

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

      4. +-commutative 9.9%

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

      5. sub-neg 9.9%

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

      6. metadata-eval 9.9%

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

      7. +-commutative 9.9%

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

   7. Simplified 9.9%

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

   8. Taylor expanded in x around inf 20.0%

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

   9. Taylor expanded in t around 0 18.2%

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

       1. associate-*l/ 18.1%

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

   11. Applied egg-rr 18.1%

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

   if 6.50000000000000042e-209 < t < 3.6000000000000002e-125 or 2.29999999999999991e-112 < t

   1. Initial program 43.9%

      \[\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 43.8%

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

   5. Taylor expanded in t around inf 89.5%

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

      1. +-commutative 89.5%

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

      2. sub-neg 89.5%

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

      3. metadata-eval 89.5%

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

      4. +-commutative 89.5%

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

   7. Simplified 89.5%

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

   8. Taylor expanded in x around inf 88.8%

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

4. Final simplification 48.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 6.5 \cdot 10^{-209} \lor \neg \left(t \leq 3.6 \cdot 10^{-125}\right) \land t \leq 2.3 \cdot 10^{-112}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.1% accurate, 2.0× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= t_m 8.2e-210) (* (sqrt x) (/ t_m l_m)) (+ 1.0 (/ -1.0 x)))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 8.2e-210) {
		tmp = sqrt(x) * (t_m / l_m);
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 8.2d-210) then
        tmp = sqrt(x) * (t_m / l_m)
    else
        tmp = 1.0d0 + ((-1.0d0) / x)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 8.2e-210) {
		tmp = Math.sqrt(x) * (t_m / l_m);
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 8.2e-210:
		tmp = math.sqrt(x) * (t_m / l_m)
	else:
		tmp = 1.0 + (-1.0 / x)
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 8.2e-210)
		tmp = Float64(sqrt(x) * Float64(t_m / l_m));
	else
		tmp = Float64(1.0 + Float64(-1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 8.2e-210)
		tmp = sqrt(x) * (t_m / l_m);
	else
		tmp = 1.0 + (-1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 8.2e-210], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 8.19999999999999982e-210

   1. Initial program 27.8%

      \[\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.7%

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

   5. Taylor expanded in l around inf 3.2%

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

      1. associate--l+ 9.8%

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

      2. sub-neg 9.8%

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

      3. metadata-eval 9.8%

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

      4. +-commutative 9.8%

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

      5. sub-neg 9.8%

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

      6. metadata-eval 9.8%

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

      7. +-commutative 9.8%

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

   7. Simplified 9.8%

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

   8. Taylor expanded in x around inf 19.1%

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

   9. Taylor expanded in t around 0 18.5%

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

   if 8.19999999999999982e-210 < t

   1. Initial program 43.7%

      \[\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 43.6%

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

   5. Taylor expanded in t around inf 88.1%

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

      1. +-commutative 88.1%

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

      2. sub-neg 88.1%

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

      3. metadata-eval 88.1%

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

      4. +-commutative 88.1%

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

   7. Simplified 88.1%

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

   8. Taylor expanded in x around inf 87.5%

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

4. Final simplification 49.0%

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

Alternative 6: 75.8% accurate, 45.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ 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

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m) :precision binary64 (* t_s (+ 1.0 (/ -1.0 x))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.8%

   \[\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 34.7%

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

5. Taylor expanded in t around inf 41.5%

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

   1. +-commutative 41.5%

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

   2. sub-neg 41.5%

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

   3. metadata-eval 41.5%

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

   4. +-commutative 41.5%

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

7. Simplified 41.5%

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

8. Taylor expanded in x around inf 41.2%

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

9. Final simplification 41.2%

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

Alternative 7: 75.1% accurate, 225.0× speedup

Math

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

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m) :precision binary64 (* t_s 1.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
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$95$m_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 34.8%

   \[\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 34.7%

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

5. Taylor expanded in t around inf 41.5%

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

   1. +-commutative 41.5%

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

   2. sub-neg 41.5%

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

   3. metadata-eval 41.5%

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

   4. +-commutative 41.5%

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

7. Simplified 41.5%

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

8. Taylor expanded in x around inf 40.7%

   \[\leadsto \color{blue}{1} \]

9. Final simplification 40.7%

   \[\leadsto 1 \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024039 
(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)))))