Toniolo and Linder, Equation (7)

Percentage Accurate: 33.5% → 84.9%

Time: 19.6s

Alternatives: 10

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: 33.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.32 \cdot 10^{-155}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2 \cdot \mathsf{fma}\left(x, 0.5, -0.5\right)}}{l\_m}\\ \mathbf{elif}\;t\_m \leq 5 \cdot 10^{-21}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{2}}{\sqrt{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{l\_m}^{2}}{x}\right)\right) + \frac{t\_2 + {l\_m}^{2}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 1.32e-155)
      (/ (* t_m (sqrt (* 2.0 (fma x 0.5 -0.5)))) l_m)
      (if (<= t_m 5e-21)
        (*
         t_m
         (/
          (sqrt 2.0)
          (sqrt
           (+
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l_m 2.0) x)))
            (/ (+ t_2 (pow l_m 2.0)) x)))))
        (sqrt (/ (+ x -1.0) (+ x 1.0))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.32e-155) {
		tmp = (t_m * sqrt((2.0 * fma(x, 0.5, -0.5)))) / l_m;
	} else if (t_m <= 5e-21) {
		tmp = t_m * (sqrt(2.0) / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l_m, 2.0) / x))) + ((t_2 + pow(l_m, 2.0)) / x))));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.32e-155)
		tmp = Float64(Float64(t_m * sqrt(Float64(2.0 * fma(x, 0.5, -0.5)))) / l_m);
	elseif (t_m <= 5e-21)
		tmp = Float64(t_m * Float64(sqrt(2.0) / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l_m ^ 2.0) / x))) + Float64(Float64(t_2 + (l_m ^ 2.0)) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.32e-155], N[(N[(t$95$m * N[Sqrt[N[(2.0 * N[(x * 0.5 + -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[t$95$m, 5e-21], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 1.3199999999999999e-155

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

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

   5. Taylor expanded in l around inf 2.9%

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

      1. *-commutative 2.9%

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

      2. associate--l+ 10.8%

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

      3. sub-neg 10.8%

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

      4. metadata-eval 10.8%

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

      5. +-commutative 10.8%

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

      6. sub-neg 10.8%

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

      7. metadata-eval 10.8%

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

      8. +-commutative 10.8%

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

   7. Simplified 10.8%

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

   8. Taylor expanded in x around 0 16.1%

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

      1. expm1-log1p-u 15.3%

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

      2. expm1-udef 8.6%

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

      3. associate-*r* 8.6%

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

      4. sqrt-unprod 8.6%

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

      5. *-commutative 8.6%

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

      6. fma-neg 8.6%

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

      7. metadata-eval 8.6%

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

   10. Applied egg-rr 8.6%

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

       1. expm1-def 15.3%

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

       2. expm1-log1p 16.1%

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

       3. *-commutative 16.1%

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

   12. Simplified 16.1%

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

       1. *-commutative 16.1%

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

       2. associate-*r/ 18.4%

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

   14. Applied egg-rr 18.4%

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

   if 1.3199999999999999e-155 < t < 4.99999999999999973e-21

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

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

   5. Taylor expanded in x around inf 89.3%

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

   if 4.99999999999999973e-21 < t

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

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

   5. Taylor expanded in t around inf 97.6%

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

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

4. Final simplification 50.7%

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

Alternative 2: 84.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := \frac{{l\_m}^{2}}{x}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.32 \cdot 10^{-155}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2 \cdot \mathsf{fma}\left(x, 0.5, -0.5\right)}}{l\_m}\\ \mathbf{elif}\;t\_m \leq 2.7 \cdot 10^{-21}:\\ \;\;\;\;t\_m \cdot \frac{\sqrt{2}}{\sqrt{t\_2 + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(2 \cdot {t\_m}^{2} + t\_2\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (/ (pow l_m 2.0) x)))
   (*
    t_s
    (if (<= t_m 1.32e-155)
      (/ (* t_m (sqrt (* 2.0 (fma x 0.5 -0.5)))) l_m)
      (if (<= t_m 2.7e-21)
        (*
         t_m
         (/
          (sqrt 2.0)
          (sqrt
           (+
            t_2
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ (* 2.0 (pow t_m 2.0)) t_2))))))
        (sqrt (/ (+ x -1.0) (+ x 1.0))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = pow(l_m, 2.0) / x;
	double tmp;
	if (t_m <= 1.32e-155) {
		tmp = (t_m * sqrt((2.0 * fma(x, 0.5, -0.5)))) / l_m;
	} else if (t_m <= 2.7e-21) {
		tmp = t_m * (sqrt(2.0) / sqrt((t_2 + ((2.0 * (pow(t_m, 2.0) / x)) + ((2.0 * pow(t_m, 2.0)) + t_2)))));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64((l_m ^ 2.0) / x)
	tmp = 0.0
	if (t_m <= 1.32e-155)
		tmp = Float64(Float64(t_m * sqrt(Float64(2.0 * fma(x, 0.5, -0.5)))) / l_m);
	elseif (t_m <= 2.7e-21)
		tmp = Float64(t_m * Float64(sqrt(2.0) / sqrt(Float64(t_2 + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(Float64(2.0 * (t_m ^ 2.0)) + t_2))))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	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[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.32e-155], N[(N[(t$95$m * N[Sqrt[N[(2.0 * N[(x * 0.5 + -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[t$95$m, 2.7e-21], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(t$95$2 + N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 1.3199999999999999e-155

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

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

   5. Taylor expanded in l around inf 2.9%

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

      1. *-commutative 2.9%

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

      2. associate--l+ 10.8%

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

      3. sub-neg 10.8%

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

      4. metadata-eval 10.8%

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

      5. +-commutative 10.8%

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

      6. sub-neg 10.8%

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

      7. metadata-eval 10.8%

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

      8. +-commutative 10.8%

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

   7. Simplified 10.8%

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

   8. Taylor expanded in x around 0 16.1%

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

      1. expm1-log1p-u 15.3%

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

      2. expm1-udef 8.6%

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

      3. associate-*r* 8.6%

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

      4. sqrt-unprod 8.6%

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

      5. *-commutative 8.6%

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

      6. fma-neg 8.6%

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

      7. metadata-eval 8.6%

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

   10. Applied egg-rr 8.6%

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

       1. expm1-def 15.3%

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

       2. expm1-log1p 16.1%

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

       3. *-commutative 16.1%

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

   12. Simplified 16.1%

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

       1. *-commutative 16.1%

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

       2. associate-*r/ 18.4%

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

   14. Applied egg-rr 18.4%

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

   if 1.3199999999999999e-155 < t < 2.7000000000000001e-21

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

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

   5. Taylor expanded in x around inf 89.3%

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

   6. Taylor expanded in t around 0 88.9%

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

   if 2.7000000000000001e-21 < t

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

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

   5. Taylor expanded in t around inf 97.6%

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

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

4. Final simplification 50.7%

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

Alternative 3: 80.5% accurate, 1.1× 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 5 \cdot 10^{-142}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{2 \cdot \mathsf{fma}\left(x, 0.5, -0.5\right)}}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 5e-142)
    (/ (* t_m (sqrt (* 2.0 (fma x 0.5 -0.5)))) l_m)
    (sqrt (/ (+ x -1.0) (+ x 1.0))))))

C

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

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 5e-142)
		tmp = Float64(Float64(t_m * sqrt(Float64(2.0 * fma(x, 0.5, -0.5)))) / l_m);
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	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_] := N[(t$95$s * If[LessEqual[t$95$m, 5e-142], N[(N[(t$95$m * N[Sqrt[N[(2.0 * N[(x * 0.5 + -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.0000000000000002e-142

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

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

   5. Taylor expanded in l around inf 3.6%

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

      1. *-commutative 3.6%

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

      2. associate--l+ 11.4%

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

      3. sub-neg 11.4%

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

      4. metadata-eval 11.4%

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

      5. +-commutative 11.4%

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

      6. sub-neg 11.4%

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

      7. metadata-eval 11.4%

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

      8. +-commutative 11.4%

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

   7. Simplified 11.4%

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

   8. Taylor expanded in x around 0 16.7%

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

      1. expm1-log1p-u 15.9%

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

      2. expm1-udef 9.2%

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

      3. associate-*r* 9.2%

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

      4. sqrt-unprod 9.2%

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

      5. *-commutative 9.2%

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

      6. fma-neg 9.2%

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

      7. metadata-eval 9.2%

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

   10. Applied egg-rr 9.2%

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

       1. expm1-def 15.9%

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

       2. expm1-log1p 16.7%

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

       3. *-commutative 16.7%

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

   12. Simplified 16.7%

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

       1. *-commutative 16.7%

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

       2. associate-*r/ 18.9%

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

   14. Applied egg-rr 18.9%

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

   if 5.0000000000000002e-142 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.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 92.3%

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

4. Final simplification 49.0%

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

Alternative 4: 80.3% 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 6.5 \cdot 10^{-142}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{x}}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 6.5e-142], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 6.50000000000000027e-142

   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}{\frac{\sqrt{2}}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right) - \ell \cdot \ell}} \cdot t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 54.7%

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

   6. Taylor expanded in t around 0 20.0%

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

      1. cancel-sign-sub-inv 20.0%

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

      2. metadata-eval 20.0%

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

      3. distribute-rgt1-in 20.0%

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

      4. metadata-eval 20.0%

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

   8. Simplified 20.0%

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

   9. Taylor expanded in l around 0 15.9%

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

       1. associate-*l/ 18.2%

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

   11. Simplified 18.2%

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

   if 6.50000000000000027e-142 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.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 92.3%

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

4. Final simplification 48.6%

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

Alternative 5: 77.6% 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 5.7 \cdot 10^{-142}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t\_m}{l\_m}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 5.7e-142], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.69999999999999995e-142

   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}{\frac{\sqrt{2}}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right) - \ell \cdot \ell}} \cdot t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 54.7%

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

   6. Taylor expanded in t around 0 20.0%

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

      1. cancel-sign-sub-inv 20.0%

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

      2. metadata-eval 20.0%

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

      3. distribute-rgt1-in 20.0%

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

      4. metadata-eval 20.0%

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

   8. Simplified 20.0%

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

   9. Taylor expanded in l around 0 15.9%

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

   if 5.69999999999999995e-142 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.0%

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

   6. Taylor expanded in x around inf 91.6%

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

4. Final simplification 47.0%

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

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1.8e-141], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.80000000000000007e-141

   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}{\frac{\sqrt{2}}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right) - \ell \cdot \ell}} \cdot t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 54.7%

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

   6. Taylor expanded in t around 0 20.0%

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

      1. cancel-sign-sub-inv 20.0%

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

      2. metadata-eval 20.0%

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

      3. distribute-rgt1-in 20.0%

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

      4. metadata-eval 20.0%

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

   8. Simplified 20.0%

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

   9. Taylor expanded in l around 0 18.2%

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

       1. associate-*l/ 18.2%

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

       2. *-lft-identity 18.2%

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

   11. Simplified 18.2%

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

   if 1.80000000000000007e-141 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.0%

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

   6. Taylor expanded in x around inf 91.6%

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

4. Final simplification 48.3%

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

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

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= t_m 5.7e-142) (/ 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 <= 5.7e-142) {
		tmp = t_m / (l_m / sqrt(x));
	} else {
		tmp = 1.0 + (-1.0 / x);
	}
	return t_s * tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 5.7e-142], N[(t$95$m / N[(l$95$m / N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.69999999999999995e-142

   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}{\frac{\sqrt{2}}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right) - \ell \cdot \ell}} \cdot t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 54.7%

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

   6. Taylor expanded in t around 0 20.0%

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

      1. cancel-sign-sub-inv 20.0%

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

      2. metadata-eval 20.0%

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

      3. distribute-rgt1-in 20.0%

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

      4. metadata-eval 20.0%

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

   8. Simplified 20.0%

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

   9. Taylor expanded in l around 0 15.9%

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

       1. associate-*l/ 18.2%

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

       2. associate-/l* 18.2%

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

   11. Applied egg-rr 18.2%

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

   if 5.69999999999999995e-142 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.0%

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

   6. Taylor expanded in x around inf 91.6%

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

4. Final simplification 48.3%

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

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 3.6e-141], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 3.60000000000000015e-141

   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}{\frac{\sqrt{2}}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(2, t \cdot t, \ell \cdot \ell\right) - \ell \cdot \ell}} \cdot t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 54.7%

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

   6. Taylor expanded in t around 0 20.0%

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

      1. cancel-sign-sub-inv 20.0%

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

      2. metadata-eval 20.0%

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

      3. distribute-rgt1-in 20.0%

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

      4. metadata-eval 20.0%

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

   8. Simplified 20.0%

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

   9. Taylor expanded in l around 0 15.9%

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

       1. associate-*l/ 18.2%

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

   11. Simplified 18.2%

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

   if 3.60000000000000015e-141 < t

   1. Initial program 39.4%

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

   3. Simplified 39.3%

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

   5. Taylor expanded in t around inf 92.0%

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

   6. Taylor expanded in x around inf 91.6%

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

4. Final simplification 48.3%

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

Alternative 9: 75.6% accurate, 45.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

5. Taylor expanded in t around inf 43.6%

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

6. Taylor expanded in x around inf 43.4%

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

7. Final simplification 43.4%

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

Alternative 10: 74.9% accurate, 225.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

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

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

5. Taylor expanded in t around inf 43.6%

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

6. Taylor expanded in x around inf 43.1%

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

7. Final simplification 43.1%

   \[\leadsto 1 \]
8. Add Preprocessing

Reproduce

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