Toniolo and Linder, Equation (7)

Percentage Accurate: 34.7% → 85.7%

Time: 19.5s

Alternatives: 12

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: 34.7% 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: 85.7% 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 := t\_m \cdot \sqrt{2}\\ t_3 := 2 \cdot {t\_m}^{2}\\ t_4 := {l\_m}^{2} + t\_3\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 3.5 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}}}\\ \mathbf{elif}\;t\_m \leq 2.8 \cdot 10^{-157}:\\ \;\;\;\;\frac{t\_2}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t\_m}^{2}, {l\_m}^{2}\right)}{t\_m \cdot \left(\sqrt{2} \cdot x\right)}, t\_2\right)}\\ \mathbf{elif}\;t\_m \leq 4 \cdot 10^{+28}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_3 + \frac{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{l\_m}^{2}}{x}\right) + \left(\left(t\_4 + t\_4\right) + \frac{t\_4}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* t_m (sqrt 2.0)))
        (t_3 (* 2.0 (pow t_m 2.0)))
        (t_4 (+ (pow l_m 2.0) t_3)))
   (*
    t_s
    (if (<= t_m 3.5e-246)
      (* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))))
      (if (<= t_m 2.8e-157)
        (/
         t_2
         (fma
          0.5
          (/
           (* 2.0 (fma 2.0 (pow t_m 2.0) (pow l_m 2.0)))
           (* t_m (* (sqrt 2.0) x)))
          t_2))
        (if (<= t_m 4e+28)
          (*
           (sqrt 2.0)
           (/
            t_m
            (sqrt
             (+
              t_3
              (/
               (+
                (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l_m 2.0) x))
                (+ (+ t_4 t_4) (/ t_4 x)))
               x)))))
          (sqrt (/ (+ x -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 t_2 = t_m * sqrt(2.0);
	double t_3 = 2.0 * pow(t_m, 2.0);
	double t_4 = pow(l_m, 2.0) + t_3;
	double tmp;
	if (t_m <= 3.5e-246) {
		tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l_m) * sqrt((1.0 / x))));
	} else if (t_m <= 2.8e-157) {
		tmp = t_2 / fma(0.5, ((2.0 * fma(2.0, pow(t_m, 2.0), pow(l_m, 2.0))) / (t_m * (sqrt(2.0) * x))), t_2);
	} else if (t_m <= 4e+28) {
		tmp = sqrt(2.0) * (t_m / sqrt((t_3 + ((((2.0 * (pow(t_m, 2.0) / x)) + (pow(l_m, 2.0) / x)) + ((t_4 + t_4) + (t_4 / x))) / x))));
	} else {
		tmp = sqrt(((x + -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)
	t_2 = Float64(t_m * sqrt(2.0))
	t_3 = Float64(2.0 * (t_m ^ 2.0))
	t_4 = Float64((l_m ^ 2.0) + t_3)
	tmp = 0.0
	if (t_m <= 3.5e-246)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x)))));
	elseif (t_m <= 2.8e-157)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * fma(2.0, (t_m ^ 2.0), (l_m ^ 2.0))) / Float64(t_m * Float64(sqrt(2.0) * x))), t_2));
	elseif (t_m <= 4e+28)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_3 + Float64(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l_m ^ 2.0) / x)) + Float64(Float64(t_4 + t_4) + Float64(t_4 / x))) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(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[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Power[l$95$m, 2.0], $MachinePrecision] + t$95$3), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 3.5e-246], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2.8e-157], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision] + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 4e+28], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(t$95$3 + N[(N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$4 + t$95$4), $MachinePrecision] + N[(t$95$4 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if t < 3.5000000000000002e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in l around 0 19.8%

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

   if 3.5000000000000002e-246 < t < 2.8000000000000001e-157

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

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

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

      1. associate-*r/ 73.1%

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

      2. fma-define 73.1%

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

   7. Applied egg-rr 73.1%

      \[\leadsto \color{blue}{\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(0.5, \frac{\mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right) + \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, \sqrt{2} \cdot t\right)}} \]
   8. Step-by-step derivation

      1. *-commutative 73.1%

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

      2. count-2 73.1%

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

      3. *-commutative 73.1%

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

   9. Simplified 73.1%

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

   if 2.8000000000000001e-157 < t < 3.99999999999999983e28

   1. Initial program 56.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 56.3%

      \[\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 91.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 3.99999999999999983e28 < t

   1. Initial program 30.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 30.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 t around 0 91.3%

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

4. Final simplification 53.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 3.5 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\ \mathbf{elif}\;t \leq 2.8 \cdot 10^{-157}:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, t \cdot \sqrt{2}\right)}\\ \mathbf{elif}\;t \leq 4 \cdot 10^{+28}:\\ \;\;\;\;\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({\ell}^{2} + 2 \cdot {t}^{2}\right) + \left({\ell}^{2} + 2 \cdot {t}^{2}\right)\right) + \frac{{\ell}^{2} + 2 \cdot {t}^{2}}{x}\right)}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.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 := t\_m \cdot \sqrt{2}\\ t_3 := 2 \cdot {t\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.95 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}}}\\ \mathbf{elif}\;t\_m \leq 1.45 \cdot 10^{-156}:\\ \;\;\;\;\frac{t\_2}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t\_m}^{2}, {l\_m}^{2}\right)}{t\_m \cdot \left(\sqrt{2} \cdot x\right)}, t\_2\right)}\\ \mathbf{elif}\;t\_m \leq 6.2 \cdot 10^{+28}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\frac{{l\_m}^{2} + t\_3}{x} + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_3 + \frac{{l\_m}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* t_m (sqrt 2.0))) (t_3 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 1.95e-246)
      (* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))))
      (if (<= t_m 1.45e-156)
        (/
         t_2
         (fma
          0.5
          (/
           (* 2.0 (fma 2.0 (pow t_m 2.0) (pow l_m 2.0)))
           (* t_m (* (sqrt 2.0) x)))
          t_2))
        (if (<= t_m 6.2e+28)
          (*
           (sqrt 2.0)
           (/
            t_m
            (sqrt
             (+
              (/ (+ (pow l_m 2.0) t_3) x)
              (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_3 (/ (pow l_m 2.0) x)))))))
          (sqrt (/ (+ x -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 t_2 = t_m * sqrt(2.0);
	double t_3 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.95e-246) {
		tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l_m) * sqrt((1.0 / x))));
	} else if (t_m <= 1.45e-156) {
		tmp = t_2 / fma(0.5, ((2.0 * fma(2.0, pow(t_m, 2.0), pow(l_m, 2.0))) / (t_m * (sqrt(2.0) * x))), t_2);
	} else if (t_m <= 6.2e+28) {
		tmp = sqrt(2.0) * (t_m / sqrt((((pow(l_m, 2.0) + t_3) / x) + ((2.0 * (pow(t_m, 2.0) / x)) + (t_3 + (pow(l_m, 2.0) / x))))));
	} else {
		tmp = sqrt(((x + -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)
	t_2 = Float64(t_m * sqrt(2.0))
	t_3 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.95e-246)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x)))));
	elseif (t_m <= 1.45e-156)
		tmp = Float64(t_2 / fma(0.5, Float64(Float64(2.0 * fma(2.0, (t_m ^ 2.0), (l_m ^ 2.0))) / Float64(t_m * Float64(sqrt(2.0) * x))), t_2));
	elseif (t_m <= 6.2e+28)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(Float64(Float64((l_m ^ 2.0) + t_3) / x) + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_3 + Float64((l_m ^ 2.0) / x)))))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(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[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.95e-246], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.45e-156], N[(t$95$2 / N[(0.5 * N[(N[(2.0 * N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision] + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 6.2e+28], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] + t$95$3), $MachinePrecision] / x), $MachinePrecision] + N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]]

Derivation

1. Split input into 4 regimes

2. if t < 1.94999999999999989e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in l around 0 19.8%

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

   if 1.94999999999999989e-246 < t < 1.4500000000000001e-156

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

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

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

      1. associate-*r/ 73.1%

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

      2. fma-define 73.1%

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

   7. Applied egg-rr 73.1%

      \[\leadsto \color{blue}{\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(0.5, \frac{\mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right) + \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, \sqrt{2} \cdot t\right)}} \]
   8. Step-by-step derivation

      1. *-commutative 73.1%

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

      2. count-2 73.1%

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

      3. *-commutative 73.1%

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

   9. Simplified 73.1%

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

   if 1.4500000000000001e-156 < t < 6.2000000000000001e28

   1. Initial program 56.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 56.3%

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

      \[\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 6.2000000000000001e28 < t

   1. Initial program 30.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 30.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 t around 0 91.3%

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

4. Final simplification 53.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.95 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\ \mathbf{elif}\;t \leq 1.45 \cdot 10^{-156}:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, t \cdot \sqrt{2}\right)}\\ \mathbf{elif}\;t \leq 6.2 \cdot 10^{+28}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\frac{{\ell}^{2} + 2 \cdot {t}^{2}}{x} + \left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.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 := \sqrt{\frac{1}{x}}\\ t_3 := t\_m \cdot \sqrt{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 8.4 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot t\_2}\\ \mathbf{elif}\;t\_m \leq 1.2 \cdot 10^{-155}:\\ \;\;\;\;\frac{t\_3}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t\_m}^{2}, {l\_m}^{2}\right)}{t\_m \cdot \left(\sqrt{2} \cdot x\right)}, t\_3\right)}\\ \mathbf{elif}\;t\_m \leq 3.5 \cdot 10^{-136}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot t\_2\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (sqrt (/ 1.0 x))) (t_3 (* t_m (sqrt 2.0))))
   (*
    t_s
    (if (<= t_m 8.4e-246)
      (* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l_m) t_2)))
      (if (<= t_m 1.2e-155)
        (/
         t_3
         (fma
          0.5
          (/
           (* 2.0 (fma 2.0 (pow t_m 2.0) (pow l_m 2.0)))
           (* t_m (* (sqrt 2.0) x)))
          t_3))
        (if (<= t_m 3.5e-136)
          (* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) t_2))))
          (sqrt (/ (+ x -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 t_2 = sqrt((1.0 / x));
	double t_3 = t_m * sqrt(2.0);
	double tmp;
	if (t_m <= 8.4e-246) {
		tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l_m) * t_2));
	} else if (t_m <= 1.2e-155) {
		tmp = t_3 / fma(0.5, ((2.0 * fma(2.0, pow(t_m, 2.0), pow(l_m, 2.0))) / (t_m * (sqrt(2.0) * x))), t_3);
	} else if (t_m <= 3.5e-136) {
		tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * t_2)));
	} else {
		tmp = sqrt(((x + -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)
	t_2 = sqrt(Float64(1.0 / x))
	t_3 = Float64(t_m * sqrt(2.0))
	tmp = 0.0
	if (t_m <= 8.4e-246)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l_m) * t_2)));
	elseif (t_m <= 1.2e-155)
		tmp = Float64(t_3 / fma(0.5, Float64(Float64(2.0 * fma(2.0, (t_m ^ 2.0), (l_m ^ 2.0))) / Float64(t_m * Float64(sqrt(2.0) * x))), t_3));
	elseif (t_m <= 3.5e-136)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * t_2))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(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[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 8.4e-246], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.2e-155], N[(t$95$3 / N[(0.5 * N[(N[(2.0 * N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision] + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.5e-136], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]]

Derivation

1. Split input into 4 regimes

2. if t < 8.39999999999999978e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in l around 0 19.8%

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

   if 8.39999999999999978e-246 < t < 1.2e-155

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

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

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

      1. associate-*r/ 73.1%

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

      2. fma-define 73.1%

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

   7. Applied egg-rr 73.1%

      \[\leadsto \color{blue}{\frac{\sqrt{2} \cdot t}{\mathsf{fma}\left(0.5, \frac{\mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right) + \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, \sqrt{2} \cdot t\right)}} \]
   8. Step-by-step derivation

      1. *-commutative 73.1%

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

      2. count-2 73.1%

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

      3. *-commutative 73.1%

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

   9. Simplified 73.1%

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

   if 1.2e-155 < t < 3.50000000000000029e-136

   1. Initial program 22.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 23.1%

      \[\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 l around inf 23.6%

      \[\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+ 43.7%

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

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

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

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

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

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

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

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

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

      1. associate-*l* 48.9%

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

   10. Simplified 48.9%

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

   if 3.50000000000000029e-136 < t

   1. Initial program 41.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 32.3%

      \[\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 88.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 t around 0 88.3%

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

4. Final simplification 51.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8.4 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}}}\\ \mathbf{elif}\;t \leq 1.2 \cdot 10^{-155}:\\ \;\;\;\;\frac{t \cdot \sqrt{2}}{\mathsf{fma}\left(0.5, \frac{2 \cdot \mathsf{fma}\left(2, {t}^{2}, {\ell}^{2}\right)}{t \cdot \left(\sqrt{2} \cdot x\right)}, t \cdot \sqrt{2}\right)}\\ \mathbf{elif}\;t \leq 3.5 \cdot 10^{-136}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\ell \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.5% accurate, 0.5× 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 := \sqrt{\frac{1}{x}}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.08 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot t\_2}\\ \mathbf{elif}\;t\_m \leq 10^{-155}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{t\_m \cdot \sqrt{2} + \frac{{l\_m}^{2}}{t\_m \cdot \left(\sqrt{2} \cdot x\right)}}\\ \mathbf{elif}\;t\_m \leq 1.4 \cdot 10^{-136}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot t\_2\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (sqrt (/ 1.0 x))))
   (*
    t_s
    (if (<= t_m 1.08e-246)
      (* (sqrt 2.0) (/ t_m (* (* (sqrt 2.0) l_m) t_2)))
      (if (<= t_m 1e-155)
        (*
         (sqrt 2.0)
         (/
          t_m
          (+ (* t_m (sqrt 2.0)) (/ (pow l_m 2.0) (* t_m (* (sqrt 2.0) x))))))
        (if (<= t_m 1.4e-136)
          (* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) t_2))))
          (sqrt (/ (+ x -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 t_2 = sqrt((1.0 / x));
	double tmp;
	if (t_m <= 1.08e-246) {
		tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l_m) * t_2));
	} else if (t_m <= 1e-155) {
		tmp = sqrt(2.0) * (t_m / ((t_m * sqrt(2.0)) + (pow(l_m, 2.0) / (t_m * (sqrt(2.0) * x)))));
	} else if (t_m <= 1.4e-136) {
		tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * t_2)));
	} else {
		tmp = sqrt(((x + -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) :: t_2
    real(8) :: tmp
    t_2 = sqrt((1.0d0 / x))
    if (t_m <= 1.08d-246) then
        tmp = sqrt(2.0d0) * (t_m / ((sqrt(2.0d0) * l_m) * t_2))
    else if (t_m <= 1d-155) then
        tmp = sqrt(2.0d0) * (t_m / ((t_m * sqrt(2.0d0)) + ((l_m ** 2.0d0) / (t_m * (sqrt(2.0d0) * x)))))
    else if (t_m <= 1.4d-136) then
        tmp = sqrt(2.0d0) * (t_m / (l_m * (sqrt(2.0d0) * t_2)))
    else
        tmp = sqrt(((x + (-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 t_2 = Math.sqrt((1.0 / x));
	double tmp;
	if (t_m <= 1.08e-246) {
		tmp = Math.sqrt(2.0) * (t_m / ((Math.sqrt(2.0) * l_m) * t_2));
	} else if (t_m <= 1e-155) {
		tmp = Math.sqrt(2.0) * (t_m / ((t_m * Math.sqrt(2.0)) + (Math.pow(l_m, 2.0) / (t_m * (Math.sqrt(2.0) * x)))));
	} else if (t_m <= 1.4e-136) {
		tmp = Math.sqrt(2.0) * (t_m / (l_m * (Math.sqrt(2.0) * t_2)));
	} else {
		tmp = Math.sqrt(((x + -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):
	t_2 = math.sqrt((1.0 / x))
	tmp = 0
	if t_m <= 1.08e-246:
		tmp = math.sqrt(2.0) * (t_m / ((math.sqrt(2.0) * l_m) * t_2))
	elif t_m <= 1e-155:
		tmp = math.sqrt(2.0) * (t_m / ((t_m * math.sqrt(2.0)) + (math.pow(l_m, 2.0) / (t_m * (math.sqrt(2.0) * x)))))
	elif t_m <= 1.4e-136:
		tmp = math.sqrt(2.0) * (t_m / (l_m * (math.sqrt(2.0) * t_2)))
	else:
		tmp = math.sqrt(((x + -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)
	t_2 = sqrt(Float64(1.0 / x))
	tmp = 0.0
	if (t_m <= 1.08e-246)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(sqrt(2.0) * l_m) * t_2)));
	elseif (t_m <= 1e-155)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(t_m * sqrt(2.0)) + Float64((l_m ^ 2.0) / Float64(t_m * Float64(sqrt(2.0) * x))))));
	elseif (t_m <= 1.4e-136)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * t_2))));
	else
		tmp = sqrt(Float64(Float64(x + -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)
	t_2 = sqrt((1.0 / x));
	tmp = 0.0;
	if (t_m <= 1.08e-246)
		tmp = sqrt(2.0) * (t_m / ((sqrt(2.0) * l_m) * t_2));
	elseif (t_m <= 1e-155)
		tmp = sqrt(2.0) * (t_m / ((t_m * sqrt(2.0)) + ((l_m ^ 2.0) / (t_m * (sqrt(2.0) * x)))));
	elseif (t_m <= 1.4e-136)
		tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * t_2)));
	else
		tmp = sqrt(((x + -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_] := Block[{t$95$2 = N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.08e-246], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1e-155], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.4e-136], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]]

Derivation

1. Split input into 4 regimes

2. if t < 1.08000000000000003e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in l around 0 19.8%

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

   if 1.08000000000000003e-246 < t < 1.00000000000000001e-155

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

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

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

   6. Taylor expanded in l around inf 73.1%

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

      1. *-commutative 73.1%

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

   8. Simplified 73.1%

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

   if 1.00000000000000001e-155 < t < 1.4e-136

   1. Initial program 22.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 23.1%

      \[\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 l around inf 23.6%

      \[\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+ 43.7%

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

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

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

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

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

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

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

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

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

      1. associate-*l* 48.9%

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

   10. Simplified 48.9%

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

   if 1.4e-136 < t

   1. Initial program 41.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 32.3%

      \[\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 88.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 t around 0 88.3%

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

4. Final simplification 51.2%

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

Alternative 5: 80.6% accurate, 0.7× 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 1.3 \cdot 10^{-135}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \left(\sqrt{2} \cdot \sqrt{\frac{1}{x}}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.3e-135)
    (* (sqrt 2.0) (/ t_m (* l_m (* (sqrt 2.0) (sqrt (/ 1.0 x))))))
    (sqrt (/ (+ x -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 <= 1.3e-135) {
		tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x)))));
	} else {
		tmp = sqrt(((x + -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 <= 1.3d-135) then
        tmp = sqrt(2.0d0) * (t_m / (l_m * (sqrt(2.0d0) * sqrt((1.0d0 / x)))))
    else
        tmp = sqrt(((x + (-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 <= 1.3e-135) {
		tmp = Math.sqrt(2.0) * (t_m / (l_m * (Math.sqrt(2.0) * Math.sqrt((1.0 / x)))));
	} else {
		tmp = Math.sqrt(((x + -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 <= 1.3e-135:
		tmp = math.sqrt(2.0) * (t_m / (l_m * (math.sqrt(2.0) * math.sqrt((1.0 / x)))))
	else:
		tmp = math.sqrt(((x + -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 <= 1.3e-135)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * Float64(sqrt(2.0) * sqrt(Float64(1.0 / x))))));
	else
		tmp = sqrt(Float64(Float64(x + -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 <= 1.3e-135)
		tmp = sqrt(2.0) * (t_m / (l_m * (sqrt(2.0) * sqrt((1.0 / x)))));
	else
		tmp = sqrt(((x + -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, 1.3e-135], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.30000000000000002e-135

   1. Initial program 28.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 28.8%

      \[\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 l around inf 4.1%

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

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

      1. associate-*l* 22.2%

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

   10. Simplified 22.2%

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

   if 1.30000000000000002e-135 < t

   1. Initial program 41.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 32.3%

      \[\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 88.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 t around 0 88.3%

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

4. Final simplification 48.3%

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

Alternative 6: 80.6% accurate, 0.7× 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 1.7 \cdot 10^{-136}:\\ \;\;\;\;\sqrt{2} \cdot \frac{\left(t\_m \cdot \sqrt{0.5}\right) \cdot \sqrt{x}}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.7e-136)
    (* (sqrt 2.0) (/ (* (* t_m (sqrt 0.5)) (sqrt x)) l_m))
    (sqrt (/ (+ x -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 <= 1.7e-136) {
		tmp = sqrt(2.0) * (((t_m * sqrt(0.5)) * sqrt(x)) / l_m);
	} else {
		tmp = sqrt(((x + -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 <= 1.7d-136) then
        tmp = sqrt(2.0d0) * (((t_m * sqrt(0.5d0)) * sqrt(x)) / l_m)
    else
        tmp = sqrt(((x + (-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 <= 1.7e-136) {
		tmp = Math.sqrt(2.0) * (((t_m * Math.sqrt(0.5)) * Math.sqrt(x)) / l_m);
	} else {
		tmp = Math.sqrt(((x + -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 <= 1.7e-136:
		tmp = math.sqrt(2.0) * (((t_m * math.sqrt(0.5)) * math.sqrt(x)) / l_m)
	else:
		tmp = math.sqrt(((x + -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 <= 1.7e-136)
		tmp = Float64(sqrt(2.0) * Float64(Float64(Float64(t_m * sqrt(0.5)) * sqrt(x)) / l_m));
	else
		tmp = sqrt(Float64(Float64(x + -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 <= 1.7e-136)
		tmp = sqrt(2.0) * (((t_m * sqrt(0.5)) * sqrt(x)) / l_m);
	else
		tmp = sqrt(((x + -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, 1.7e-136], N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[(N[(t$95$m * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.7e-136

   1. Initial program 28.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 28.8%

      \[\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 l around inf 4.1%

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

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

      1. associate-*l/ 22.1%

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

   10. Simplified 22.1%

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

   if 1.7e-136 < t

   1. Initial program 41.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 32.3%

      \[\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 88.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 t around 0 88.3%

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

4. Final simplification 48.3%

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

Alternative 7: 78.8% accurate, 1.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 1.9 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t\_m}{l\_m}\\ \mathbf{elif}\;t\_m \leq 3.9 \cdot 10^{-156}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{elif}\;t\_m \leq 1.06 \cdot 10^{-135}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{2 \cdot \left(l\_m \cdot \frac{l\_m}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.9e-246)
    (* (sqrt x) (/ t_m l_m))
    (if (<= t_m 3.9e-156)
      (+ 1.0 (/ -1.0 x))
      (if (<= t_m 1.06e-135)
        (* (sqrt 2.0) (/ t_m (sqrt (* 2.0 (* l_m (/ l_m x))))))
        (sqrt (/ (+ x -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 <= 1.9e-246) {
		tmp = sqrt(x) * (t_m / l_m);
	} else if (t_m <= 3.9e-156) {
		tmp = 1.0 + (-1.0 / x);
	} else if (t_m <= 1.06e-135) {
		tmp = sqrt(2.0) * (t_m / sqrt((2.0 * (l_m * (l_m / x)))));
	} else {
		tmp = sqrt(((x + -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 <= 1.9d-246) then
        tmp = sqrt(x) * (t_m / l_m)
    else if (t_m <= 3.9d-156) then
        tmp = 1.0d0 + ((-1.0d0) / x)
    else if (t_m <= 1.06d-135) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((2.0d0 * (l_m * (l_m / x)))))
    else
        tmp = sqrt(((x + (-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 <= 1.9e-246) {
		tmp = Math.sqrt(x) * (t_m / l_m);
	} else if (t_m <= 3.9e-156) {
		tmp = 1.0 + (-1.0 / x);
	} else if (t_m <= 1.06e-135) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((2.0 * (l_m * (l_m / x)))));
	} else {
		tmp = Math.sqrt(((x + -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 <= 1.9e-246:
		tmp = math.sqrt(x) * (t_m / l_m)
	elif t_m <= 3.9e-156:
		tmp = 1.0 + (-1.0 / x)
	elif t_m <= 1.06e-135:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((2.0 * (l_m * (l_m / x)))))
	else:
		tmp = math.sqrt(((x + -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 <= 1.9e-246)
		tmp = Float64(sqrt(x) * Float64(t_m / l_m));
	elseif (t_m <= 3.9e-156)
		tmp = Float64(1.0 + Float64(-1.0 / x));
	elseif (t_m <= 1.06e-135)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(2.0 * Float64(l_m * Float64(l_m / x))))));
	else
		tmp = sqrt(Float64(Float64(x + -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 <= 1.9e-246)
		tmp = sqrt(x) * (t_m / l_m);
	elseif (t_m <= 3.9e-156)
		tmp = 1.0 + (-1.0 / x);
	elseif (t_m <= 1.06e-135)
		tmp = sqrt(2.0) * (t_m / sqrt((2.0 * (l_m * (l_m / x)))));
	else
		tmp = sqrt(((x + -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, 1.9e-246], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.9e-156], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 1.06e-135], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(l$95$m * N[(l$95$m / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]), $MachinePrecision]

Derivation

1. Split input into 4 regimes

2. if t < 1.89999999999999988e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in t around 0 17.7%

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

   if 1.89999999999999988e-246 < t < 3.9000000000000001e-156

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

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

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

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

   if 3.9000000000000001e-156 < t < 1.06000000000000004e-135

   1. Initial program 22.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 23.1%

      \[\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 l around inf 23.6%

      \[\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+ 43.7%

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

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

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

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

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

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

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

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

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

      1. unpow2 69.9%

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

      2. *-un-lft-identity 69.9%

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

      3. times-frac 79.8%

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

   10. Applied egg-rr 79.8%

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

   if 1.06000000000000004e-135 < t

   1. Initial program 41.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 32.3%

      \[\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 88.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 t around 0 88.3%

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

4. Final simplification 50.2%

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

Alternative 8: 79.2% 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 1.7 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t\_m}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.7e-246)
    (* (sqrt x) (/ t_m l_m))
    (sqrt (/ (+ x -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 <= 1.7e-246) {
		tmp = sqrt(x) * (t_m / l_m);
	} else {
		tmp = sqrt(((x + -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 <= 1.7d-246) then
        tmp = sqrt(x) * (t_m / l_m)
    else
        tmp = sqrt(((x + (-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 <= 1.7e-246) {
		tmp = Math.sqrt(x) * (t_m / l_m);
	} else {
		tmp = Math.sqrt(((x + -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 <= 1.7e-246:
		tmp = math.sqrt(x) * (t_m / l_m)
	else:
		tmp = math.sqrt(((x + -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 <= 1.7e-246)
		tmp = Float64(sqrt(x) * Float64(t_m / l_m));
	else
		tmp = sqrt(Float64(Float64(x + -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 <= 1.7e-246)
		tmp = sqrt(x) * (t_m / l_m);
	else
		tmp = sqrt(((x + -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, 1.7e-246], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.7000000000000001e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in t around 0 17.7%

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

   if 1.7000000000000001e-246 < t

   1. Initial program 36.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 28.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 79.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 79.1%

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

4. Final simplification 47.9%

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

Alternative 9: 78.8% 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 1.1 \cdot 10^{-246}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t\_m}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1 + \frac{-0.5}{x}}{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.1e-246)
    (* (sqrt x) (/ t_m l_m))
    (- 1.0 (/ (+ 1.0 (/ -0.5 x)) 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 <= 1.1e-246) {
		tmp = sqrt(x) * (t_m / l_m);
	} else {
		tmp = 1.0 - ((1.0 + (-0.5 / x)) / 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 <= 1.1d-246) then
        tmp = sqrt(x) * (t_m / l_m)
    else
        tmp = 1.0d0 - ((1.0d0 + ((-0.5d0) / x)) / 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 <= 1.1e-246) {
		tmp = Math.sqrt(x) * (t_m / l_m);
	} else {
		tmp = 1.0 - ((1.0 + (-0.5 / x)) / 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 <= 1.1e-246:
		tmp = math.sqrt(x) * (t_m / l_m)
	else:
		tmp = 1.0 - ((1.0 + (-0.5 / x)) / 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 <= 1.1e-246)
		tmp = Float64(sqrt(x) * Float64(t_m / l_m));
	else
		tmp = Float64(1.0 - Float64(Float64(1.0 + Float64(-0.5 / x)) / 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 <= 1.1e-246)
		tmp = sqrt(x) * (t_m / l_m);
	else
		tmp = 1.0 - ((1.0 + (-0.5 / x)) / 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, 1.1e-246], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(1.0 + N[(-0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.09999999999999999e-246

   1. Initial program 31.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 31.8%

      \[\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 l around inf 3.0%

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

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

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

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

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

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

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

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

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

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

   9. Taylor expanded in t around 0 17.7%

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

   if 1.09999999999999999e-246 < t

   1. Initial program 36.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 28.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 79.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. add-exp-log 36.6%

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

      2. expm1-define 36.6%

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

   7. Applied egg-rr 36.6%

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

   8. Taylor expanded in x around -inf 0.0%

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

   10. Simplified 79.1%

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

4. Final simplification 47.9%

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

Alternative 10: 77.0% accurate, 25.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 + \frac{-0.5}{x}}{x}\right) \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (- 1.0 (/ (+ 1.0 (/ -0.5 x)) 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 + (-0.5 / x)) / 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 + ((-0.5d0) / x)) / 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 + (-0.5 / x)) / 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 + (-0.5 / x)) / 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(Float64(1.0 + Float64(-0.5 / x)) / 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 + (-0.5 / x)) / 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[(N[(1.0 + N[(-0.5 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.0%

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

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

   \[\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. add-exp-log 18.7%

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

   2. expm1-define 18.7%

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

7. Applied egg-rr 18.7%

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

8. Taylor expanded in x around -inf 0.0%

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

10. Simplified 39.9%

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

11. Final simplification 39.9%

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

Alternative 11: 76.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 #s(literal 1 binary64) 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.0%

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

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

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

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

7. Final simplification 39.9%

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

Alternative 12: 76.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 #s(literal 1 binary64) 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.0%

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

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

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

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

Reproduce

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